OLE DB for DM规范与DMX语言分析及应用

数据挖掘语言标准化的研究是开发新一代数据挖掘系统的关键。DMX(Data Mining Extensions,数据挖掘扩展)是OLE DBFor DM规范支持的数据挖掘查询语言,支持数据挖掘系统直接对关系数据库进行挖掘,是数据挖掘原语标准化发展中的一个突破。该文介绍了OLE DB For DM规范下数据挖掘的主要步骤,给出了Microsoft SQL Server Analysis Services中基于DMX的实现方法。     

一种数据挖掘查询语言DMQL

数据挖掘查询语言的设计是开发新一代数据挖掘系统的的内容,然后详细阐述了一种数据挖掘查询语言(DMQL)的各种语法,最后给出了一个实例.     

一种数据挖掘查询语言DMQL

数据挖掘查询语言的设计是开发新一代数据挖掘系统的关键。文章首先总结了一组好的数据挖掘原语应该包括的内容,然后详细阐述了一种数据挖掘查询语言(DMQL)的各种语法,最后给出了一个实例。     

结构化模式查询语言SPQL的实现

数据挖掘系统中挖掘结果模式的存储迫切需要一个好的模式查询语言，并能对存储的挖掘结果较好地执行各种操作。本文给出了对存储的数据挖掘结果执行操作的结构化模式查询语言SPQL的实现方法。SPQL是一个类自然语言同时遵循类SQL语法，SPQL的具体实现通过存储过程来完成。利用SPQL语言可以方便地实现对三类数据挖掘结果模式（关联规则、分类和序列模式）的管理、查询和使用，从而使共享数据挖掘结果和提高数据挖掘效率成为可能。     

PDMQL:一个数据挖掘的原型系统

研究并开发了一个原型系统PDMQL,实现了一种数据挖掘查询语言的原型,以该语言的语法分析为核心,把3类主要挖掘功能紧密联系起来,并实现了结果数据集到XML文档的转换.     

数据挖掘工具的应用与标准化

介绍了数据挖掘概念,给出了目前数据挖掘工具的主要分类及存在的问题,探讨了数据挖掘语言的发展对数据挖掘工具标准化的推 动作用,并对数据挖掘工具未来的发展进行了展望。     

数据挖掘语言研究现状及发展

论文介绍了目前比较流行的几种数据挖掘语言及其标准化方面的研究进展,比较分析了几种数据挖掘语言的优缺点,并对这几种数据挖掘语言的结构和组成进行了探讨和研究,最后探讨了数据挖掘语言的发展趋势,以及需要解决的问题。     

数据挖掘扩展插件语言：DMX

我们都比较熟悉SQL语言以及各种编程语言。在Microsoft SQL Server2005 Analysis Services（SSAS）中,数据挖掘也有自己独特的语言。即：数据挖掘扩展插件DMX语言。用DMX语言进行数据挖掘的优势在于：数据挖掘功能可以全部用语句来实现，我们可以将这些语句嵌入其它的MIS或ERP系统中,实现有机整合。本文将以某钢铁公司的炼钢抽测数据为例。为DMX语言实现数据挖掘的全过程。[编者按]     

空间数据挖掘查询语言GMQL的设计与使用

介绍了一种空间数据挖掘查询语言GMWL，对该语言的设计和使用进行了研究。     

基于Web服务的数据挖掘系统算法的设计

与传统的数据挖掘系统的算法库相比,在数据挖掘系统算法库中引入Web服务可以实现数据、算法和接口的分离,极大的缩减了算法库开发的复杂性并为动态管理算法库提供了便利。此外,从标准的平台无关性的角度来看,采取Web服务的设计的系统具有了平台无关性和语言无关性的特点。我们可以通过任何语言来实现将挖掘算法封装到Web服务中,并从程序设计语言中分离出来,这样就为算法设计提供了最大的自由度,提高了维护性能。因此,基于Web服务技术的数据挖掘系统对于提高数据挖掘的效率具有非常重要的意义。     

一种面向对象DBMS的直观对象查询语言

文章论述了一种面向对象的数据库管理系统的直观对象查询语言。这种基于图形的查询语言可支持图表式查询语言的定义和说明,因此这种语言既有基于文本的结构查询语言的表达能力,也具有基于图形查询语言的直观性。     

Query language feature analysis by usability

Over the last decade many database management systems have been developed with one or more query languages for user manipulation and modification of data. This paper presents the results of a comparative analysis performed on eighteen query languages. The purpose of this analysis is to identify and categorize the features which influence the usability of the language. To this end, seven broad categories are detailed: data models, language functions, expression complexity, language format, environment, intended user expertise and interface facilities. These categories are described with examples from the languages. The framework this categorization begins to develop may be useful to perspective users as well as new language designers.     

Database query languages and functional logic programming

Functional logic programming is a paradigm which integrates functional and logic programming. It is based on the use of rewriting rules for defining programs, and rewriting for goal solving. In this context, goals, usually, consist of equality (and, sometimes, inequality) constraints, which are solved in order to obtain answers, represented by means of substitutions. On the other hand, database programming languages involve a data model, a data definition language and, finally, a query language against the data defined according to the data model. To use functional logic programming as a database programming language, (1) we will propose a data model involving the main features adopted from functional logic programming (for instance, handling of partial and infinite data), (2) we will use conditional rewriting rules as data definition language, and finally, (3) we will deal with equality and inequality constraints as query language. Moreover, as most database systems, (4) we will propose an extended relational calculus and algebra, which can be used as alternative query languages in this framework. Finally, (5) we will prove that three alternative query languages are equivalent.     

Fuzzy database query languages and their relational completenesstheorem

Two fuzzy database query languages are proposed. They are used to query fuzzy databases that are enhanced from relational databases in such a way that fuzzy sets are allowed in both attribute values and truth values. A fuzzy calculus query language is constructed based on the relational calculus, and a fuzzy algebra query language is also constructed based on the relational algebra. In addition, a fuzzy relational completeness theorem such that the languages have equivalent expressive power is proved     

Atlas: a nested relational database system for text applications

Advanced database applications require facilities such as text indexing, image storage, and the ability to store data with a complex structure. However, these facilities are not usually included in traditional database systems. In this paper we describe Atlas, a nested relational database system that has been designed for text-based applications. The Atlas query language is TQL, an SQL-like query language with text operators. The query language is supported by signature file text indexing techniques, and by a parser that can be configured for different text formats and even some foreign languages. Atlas can also be used to store images and audio     

How to Comprehend Queries Functionally

Compilers and optimizers for declarative query languages use some form of intermediate language to represent user-level queries. The advent of compositional query languages for orthogonal type systems (e.g., OQL) calls for internal query representations beyond extensions of relational algebra. This work adopts a view of query processing which is greatly influenced by ideas from the functional programming domain. A uniform formal framework is presented which covers all query translation phases, including user-level query language compilation, query optimization, and execution plan generation. We pursue the type-based design—based on initial algebras—of a core functional language which is then developed into an intermediate representation that fits the needs of advanced query processing. Based on the principle of structural recursion we extend the language by monad comprehensions (which provide us with a calculus-style sublanguage that proves to be useful during the optimization of nested queries) and combinators (abstractions of the query operators implemented by the underlying target query engine). Due to its functional nature, the language is susceptible to program transformation techniques that were developed by the functional programming as well as the functional data model communities. We show how database query processing can substantially benefit from these techniques.     

Producing Interoperable Queries for Relational and Object-Oriented Databases

In this paper, we develop techniques to produce interoperable queries with object and relational databases. A user poses a local query in a local query language, against a local object or relational schema. We transparently produce appropriate queries with respect to a remote target object or relational schema, corresponding to some remote database which contains data relevant to the user's query. Mapping knowledge to resolve representational heterogeneities in local and remote schemas is expressed in a canonical representation, CRmapping, and is independent of the particular data model. A canonical representation CRquery is also used to resolve heterogeneities of query languages. A set of heterogeneous transformation algorithms define the appropriate transformations from the local queries to the remote queries. The use of canonical representations (CR) allows us to represent queries independent of the particular query language, and to resolve representational conflicts in a uniform manner, independent of models and query languages.     

Object-oriented query languages: the notion and the issues

The authors describe how the characteristics of an object-oriented data model, such as object identity, complex object structure, methods, and class hierarchies, have an impact on the design of a query language. They also point out major differences with respect to relational query languages. The discussion is supported through the definition of OOPC, a formal object-oriented query language based on predicate calculus, which incorporates in a consistent formal notation most features of existing object-oriented query languages