多数据库系统中的查询处理

在多数据库系统中,为实现局部系统的互操作,通常需要建立局部系统的集成视图u多数据库系统的用户针对集成视图表达全局查询请求后,多数据库系统的查询处理器经多级转换和处理后将全局查请求等价地转换为优化的针对局部模式的一组局邮子查询,主局部系统取得的部分查询结果经组装后取得最终的查询结果。     

多数据库系统中查询分解算法的研究

多数据库系统允许用户使用一个集成模式和简单的全局查询语言同时访问多个异构的、自治的数据库系统。全局查询分解处理是多数据库系统中的一个很重要的问题。本文给出了一种多数据库环境中的模式信息管理方法,基于这些模式信息,我们提出一种易于实现的查询分解算法。由于多数据库查询分解处理与模式集成的实现紧密相关,所以本文对多数据库系统的模式集成作了一些描述。     

多数据库系统查询优化算法的研究

介绍了自行研制的panorama多数据库系统的查询优化的实现方法．提出了一种在分布式对象管理体系结构环境下的多数据库系统的动态查询优化技术．在查询优化的执行过程中．使用了基于多元线性回归模型的统计决策机制．由于多数据库的查询优化和模式集成的实现方式也有一定的关系．所以对多数据库系统的模式集成也作了一些描述。     

多数据库系统的数据模式集成与查询处理

在分析了多数据库系统数据模式体系结构的基础上 ,讨论了多数据库查询处理问题 :查询分解、查询转换和查询优化。给出了全局查询分解算法和全局查询优化算法     

校园网异构数据库系统中的一种并行查询策略

在设计新的校级MIS系统时,为了能充分利用原有的数据又不破坏这些系级MIS,我们在校园网上设计了一个异构数据库联合使用系统HDBUS。HDBUS是将分布在网络不同节点上的ORACLE,SYBASE数据库服务器及FoxPro台式数据库中的本地库(LocalDataBase)集成为一个全局库(Global DataBase)并提供全局事务管理和并行查询处理的异构分布式数据库系统。HDBUS选用PB(PoweBuilder)作为主要的开发工具,然而作为客户端工具,我们发现它不支持数据库服务器间的并行工作,因此提出了在PB应用程序与数据库     

PANORAMA多数据库系统的后处理查询策略

分析不同的模式集成语义 ,从而得出后处理查询的两种主要运算 :场地间联接和外联接运算 .运用规则把后处理查询先转换成普通表达式 ,再转换成析取条件范式 ,并讨论了其内部树结构的实现机制 ,生成实际用于调度的全局查询超图集 ,并给出了具体的算法 .在此基础上 ,根据超图集的特点 ,给出后处理查询的三级调度     

一种触发的动态查询再优化方法

对数据库系统内长期运行的查询处理的查询优化提出了一种触发的动态查询再优化方法，对这种动态再优化机制的动态评价方法、原则以及查询计划的重构进行了说明，着重讨论了触发动态再优化的触发机制和查询处理。     

多数据库系统中的关键技术

本文主要介绍多数据库系统（ＭＤＢＳ）中的几个关键技术,包括ＭＤＢＳ的设计原则及体系结构、异构模式消解、查询处理、事务处理等方面的问题。     

基于数据库系统表的通用查询方法

以数据库系统SQLServer7.0和SybaseSQLAnywhere5.0为例,分析了相关数据库系统表。提出了应用系统表的通用查询方法,并使用PowerBuilder做为开发工具,以具体实例详细论述了实现通用查询功能的一般方法。     

XML查询的代数表示及其查询优化

本文绘出了一种XML查询的逻辑代数表示,基于这种代数表示作者探讨了在逻辑层面上进行XML查询优化的可能性和方法。文章按以下方式组织,第一部分给出了一种XML数据的模型表示,接着简单描述了在这个模型上的XML查询语言-AnXQL;第二部分是本文的重点,详细描述了XML查询的逻辑代数操作符,并举例说明;第三部分在逻辑层面上探讨了XML查询优化的方法;最后一部分介绍了相关研究工作,并与本文的方法进行了对比。本文是文[8]中基于半结构化数据模型的集成查询处理研究的重要组成部分。     

Query Optimization in Multidatabase Systems

Global query execution in a multidatabase system can be done parallelly, as all the local databases are independent. In this paper, a cost model that considers parallel execution of subqueries for a global query is developed. In order to obtain maximum parallelism in query execution, it is required to find a query execution plan that is represented in the form of a bushy tree and this query tree should be balanced to the maximal possible extent with respect to execution time. A new bottom up approach called Agglomerative Approach (AA) is proposed to construct balanced bushy trees with respect to execution time. By the deterministic nature of this approach, it generates local optimal solutions. This local minima problem will be severe in the case of graph queries, i.e., queries that are represented with a graph structure. A Simulated annealing Approach (SA) is employed to obtain a (near) optimal solution. These approaches (AA and SA) are suitable for handling on-line and off-line queries respectively. A Hybrid Approach (HA), that is an integration of AA and SA, is proposed to optimize queries for which the estimated time to be spent on optimization is known a priori. Results obtained with AA and SA on both tree and graph structured queries are presented.     

An Object Algebra Approach to Multidatabase Query Decomposition in Donají

This paper presents an approach to query decomposition in a multidatabase environment. The unique aspect of this approach is that it is based on performing transformations over an object algebra that can be used as the basis for a global query language. In the paper, we first present our multidatabase environment and semantic framework, where a global conceptual schema based on the Object Data Management Group standard encompasses the information from heterogeneous data sources that include relational databases as well as object-oriented databases and flat file sources. The meta-data about the global schema is enhanced with information about virtual classes as well as virtual relationships and inheritance hierarchies that exist between multiple sources. The AQUA object algebra is used as the formal foundation for manipulation of the query expression over the multidatabase. AQUA is enhanced with distribution operators for dealing with data distribution issues. During query decomposition we perform an extensive analysis of traversals for path expressions that involve virtual relationships and hierarchies for access to several heterogeneous sources. The distribution operators defined in algebraic terms enhance the global algebra expression with semantic information about the structure, distribution, and localization of the data sources relevant to the solution of the query. By using an object algebra as the basis for query processing, we are able to define algebraic transformations and exploit rewriting techniques during the decomposition phase. Our use of an object algebra also provides a formal and uniform representation for dealing with an object-oriented approach to multidatabase query processing. As part of our query processing discussion, we include an overview of a global object identification approach for relating semantically equivalent objects from diverse data sources, illustrating how knowledge about global object identity is used in the decomposition and assembly processes.     

多数据库系统中的全局查询转换方法研究

使用查询树作为查询转换的内部表示,通过使用多数据库规范树对全局查询树进行规范化处理,并给出了相应的转换规则。最后给出了多数据库查询转换算法,并对查询转换的等价性进行了分析。     

AbIx: An Approach to Content-Based Approximate Query Processing in Peer-to-Peer Data Systems

In recent years there has been a significant interest in peer-to-peer （P2P） environments in the community of data management. However, almost all work, so far, is focused on exact query processing in current P2P data systems. The autonomy of peers also is not considered enough. In addition, the system cost is very high because the information publishing method of shared data is based on each document instead of document set. In this paper, abstract indices （AbIx） are presented to implement content-based approximate queries in centralized, distributed and structured P2P data systems. It can be used to search as few peers as possible but get as many returns satisfying users＇ queries as possible on the guarantee of high autonomy of peers. Also, abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. In order to verify the effectiveness of abstract indices, a simulator of 10,000 peers, over 3 million documents is made, and several metrics are proposed. The experimental results show that abstract indices work well in various P2P data systems.     

Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems

To meet users' growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recently. A key feature of an MDBS is local autonomy. For a query retrieving data from multiple databases, global query optimization should be performed to achieve good system performance. There are a number of new challenges for global query optimization in an MDBS. Among them, a major one is that some local optimization information, such as local cost parameters, may not be available at the global level because of local autonomy. It creates difficulties for finding a good decomposition of a global query during query optimization. To tackle this challenge, a new query sampling method is proposed in this paper. The idea is to group component queries into homogeneous classes, draw a sample of queries from each class, and use observed costs of sample queries to derive a cost formula for each class by multiple regression. The derived formulas can be used to estimate the cost of a query during query optimization. The relevant issues, such as query classification rules, sampling procedures, and cost model development and validation, are explored in this paper. To verify the feasibility of the method, experiments were conducted on three commercial database management systems supported in an MDBS. Experimental results demonstrate that the proposed method is quite promising in estimating local cost parameters in an MDBS.     

一种处理图数据库中超图集合的查询方法

针对图数据库中超图集合查询问题给出有效解决方案,算法采用过滤-验证框架机制,过滤器是基于特征的索引树。给出从数据库中快速提取特征的算法以及索引建立方法。将特征组织在一棵树中,使得过滤阶段两个特征的公共诱导子图只与查询图做一次子图同构测试。在验证阶段,将Ullman算法与极大团查找算法相结合进行子图同构检测。     

OBSERVER: An Approach for Query Processing in Global Information Systems Based on Interoperation Across Pre-Existing Ontologies

There has been an explosion in the types, availability and volume of data accessible in an information system, thanks to the World Wide Web (the Web) and related inter-networking technologies. In this environment, there is a critical need to replace or complement earlier database integration approaches and current browsing and keyword-based techniques with concept-based approaches. Ontologies are increasingly becoming accepted as an important part of any concept or semantics based solution, and there is increasing realization that any viable solution will need to support multiple ontologies that may be independently developed and managed. In particular, we consider the use of concepts from pre-existing real world domain ontologies for describing the content of the underlying data repositories. The most challenging issue in this approach is that of vocabulary sharing, which involves dealing with the use of different terms or concepts to describe similar information. In this paper, we describe the architecture, design and implementation of the OBSERVER system. Brokering across the domain ontologies is enabled by representing and utilizing interontology relationships such as (but not limited to) synonyms, hyponyms and hypernyms across terms in different ontologies. User queries are rewritten by using these relationships to obtain translations across ontologies. Well established metrics like precision and recall based on the extensions underlying the concepts are used to estimate the loss of information, if any.     

多数据库事务处理原型系统的设计与实现

本文给出了多数据库事务处理原型系统ＭＤＢＳ－１的设计方案，并着重讨论了事务处理核心和局部代理的设计与实现。利用多线索技术来提高事务间的和事务内的并行性，以提高系统的性能。     

多数据库环境下的模式集成及查询分解

在不同数据库表模式间定义了一种结构冲突,并通过元数据的方法,描述了具有结构冲突的表模式间的模式集成。讨论了将集成后的表模式上的查询转换到原表模式上的查询分解方法。