XML数据库并发控制机制的研究

并发控制是改善数据库系统事务性能的最重要的机制,多用户事务并发问题在XML原型数据库领域是一个难点。通过一种类XPath数据模型,定义基于此模型的几种XML数据库操作。在此基础上,提出一种基于XPath的锁协议(XPL)以及锁模型,并验证在此锁协议机制下的调度是可串行性调度,从而实现了XML原型数据库的多用户事务并发控制。最后通过实验对XPL协议的并发性能进行测试和分析。     

实时数据库嵌套事务的并发控制

传统满足可串行化正确性标准的并发控制把数据库作为一个整体来考虑，事务的执行保证数据库的一致性。往往在应用中数据库的不同对象集合之间可以独立保证一致性而不必关心别的对象集合的一致性限制以提高事务执行的并发度，这就比较适合嵌套事务模型中父子事务及兄弟事务之间的应用。本文测对嵌套事务的并发控制进行了讨论。     

Native XML数据库并发控制协议

并发控制是改善数据库系统事务性能的最重要机制,也是Native XML数据库研究领域的一个难点。通过简化XPath数据模型,定义基于该模型的几种Native XML数据库操作,提出一种新的基于XPath的加锁协议,分析该协议下的调度是可串行化调度,并针对其性能问题进行探讨。     

XML的并发加锁协议

随着XML数据库管理系统(XML DBMS)研究的日益深入,研究基于树型结构的XML数据的并发控制协议变得十分重要．由Silberschatz和Kedem提出的树加锁协议(tree protocol)是基于静态树结构数据而定义的．而XML数据是动态变化的树型结构数据．针对XML数据的特点,定义了一个操作集,它可以将一个树型结构的XML文档变化为另外一个合法的树型结构的：XML文档．该操作集的最大特点是其操作对象为一棵子树而非一个结点．在这个操作集基础上定义了XML动态树协议XDTP(XML dynamic tree protocol),并证明了该协议能继续保持静态树协议的优良特性：可串行化(serializability)和无死锁(deadlock-freedom)．在实际的数据集上进行了实验,结果表明XDTP有着较好的性能．     

一种新的实时事务并发控制方法

本文提出一种新的实时事务并发控制方法，并对其性能进行了模拟评测；与锁式协议，乐观协议，基于时间戳的协议相比，它可以获得更新的并发度，与诸如ε－可串行比、△－可串行化等一致性的放松可串行化并发控制技术相比，它维护强一致性，保证严格可串行化。     

数据库的并发控制

事务的并发执行可以显著提高系统的资源利用率,改善对事务的响应时间,但当多个事务对数据库进行并发操作时,如不加任何控制,可能会引起数据库的的数据不一致。本文讲述了并发操作引起的异常及如何解决异常问题。     

实时数据库的准一致性可串行化并发控制

可串行化的并发控制对传统应用是合适的,它旨在确保数据的“绝对正确”性,然而在实时数据库中,事务的定时限制往往比数据的“绝对正确”性更重要。为此,本文提出了新颖的准一致性可串行化的并发控制策略,文中着重讨论了准一致性可串行化的有关概念与理论,调度的可准一致性可串行化的判别方法,并发控制协议以及在事务的准一致性可串行化并发执行中不一致性传播放大的控制策略。     

多数据库事务并发调度算法优化技术研究

研究优化调度数据库中事务问题,为保证多数据库中事务提交顺序,提高事务执行及提交的并发度,研究了事务提交图的调度算法TM2,针对算法TM2中事务管理器无法检测到全局事务与局部事务的间接冲突,提出了优化算法TMO,采用ticket算法在全局事务的每个子事务之间增加数据操作,以便在每个成员数据库的全局子事务之间创造直接冲突,并通过添加保存点恢复中止事务代替重做事务,保持了多数据库中事务的可串行化.通过仿真,对比了两种调度算法的性能.得出算法TMO解决了事务的可串行化问题,提高了事务的并发度,保证了事务的一致性.     

一种新的实时数据库乐观并发控制方法

可串行化的并发控制对传统应用是合适的。而在实时数据库中,为了满足事务定时限制(典型地为截止期),并且考虑到局部的数据库不一致能够随下一次数据采样恢复,人们提出了准一致可串行化标准。本文基于这一标准提出了一种新的乐观并发控制协议,它考虑了数据的相似性及事务特点,提高了事务执行的并发度,有利于实时事务定时限制的满足。     

数据库并发操作的可串行化调度与死锁检测算法

封锁与可串行化调度是数据库并发操作采取的两种主要措施。判断一个调度是否可串行化调度的最有效方法是两段锁协议。但是,一方面,事务遵守两段锁协议只是可串行化调度的充分条件而不是必要条件;另一方面,遵守两段锁协议的事务仍可能发生死锁。文中给出了一种算法,利用该算法,不仅可判断出一个调度是否为可串行化调度,而且可判断出该调度是否会发生死锁。     

A high concurrency XPath-based locking protocol for XML databases

Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past few years. Being an important language for addressing data in XML documents, XPath expressions are the basis of several query languages, such as XQurey and XSLT. In this paper, we propose a lock-based concurrency control protocol, called XLP, for transactions accessing XML data by the XPath model. XLP is based on the XPath model and has the features of rich lock modes, low lock conflict and lock conversion. XLP is also proved to ensure conflict serializability. In sum, there are three major contributions in this paper. The proposed XLP supports most XPath axes, rather than simple path expressions only. Conflict conditions and rules in the XPath model are analyzed and derived. Moreover, a lightweighted lock mode, P-lock, is invented and integrated into XLP for better concurrency.     

Recommending XML physical designs for XML databases

Database systems employ physical structures such as indexes and materialized views to improve query performance, potentially by orders of magnitude. It is therefore important for a database administrator to choose the appropriate configuration of these physical structures for a given database. XML database systems are increasingly being used to manage semi-structured data, and XML support has been added to commercial database systems. In this paper, we address the problem of automatic physical design for XML databases, which is the process of automatically selecting the best set of physical structures for a database and a query workload. We focus on recommending two types of physical structures: XML indexes and relational materialized views of XML data. We present a design advisor for recommending XML indexes, one for recommending materialized views, and an integrated design advisor that recommends both indexes and materialized views. A key characteristic of our advisors is that they are tightly coupled with the query optimizer of the database system, and they rely on the optimizer for enumerating and evaluating physical designs. We have implemented our advisors in a prototype version of IBM DB2 V9, and we experimentally demonstrate the effectiveness of their recommendations using this implementation.     

XML数据库和关系数据库之比较

XML已经成为数据表示和交换的数据格式标准。随着大量XML文档的出现,应用数据库技术实现对XML数据的管理引起了越来越多研究者的兴趣。作为研究XML数据库技术的一个开始点,通过与关系数据库比较,可以深刻理解XML数据库与关系数据库的异同,进而为解决XML数据库所面临的问题,如为数据冗余控制、并发访问控制等提供必要的基础。两种数据库的比较是从数据模型、查询路径、完整性约束和规范化5个方面进行的,由于数据模型是数据库的基石,二者的数据模型从构造机制、名字的惟一性、空值、实体标识、实体问关系、文档顺序、数据结构的规则性、递归、数据自描述性等9个方面进行了详细讨论。     

Objects,XML and databases

The 16th Annual ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA) was held in Tampa Bay, Florida in October 2001. This special issue of Information and Software Technology includes selected papers from the Workshop on Objects, XML and databases that was held at the conference on Sunday and Monday, 14 and 15 October.     

Semantic-based locking technique in object-oriented databases

This paper presents a locking-based concurrency control dealing with three important issues in object-oriented databases: semantics of methods, nested method invocation and referentially shared object. In the proposed scheme, locks are required for the execution of methods instead of atomic operations. This can reduce the locking overhead and deadlocks due to lock escalation. Also, a way of automating commutativity of methods is provided. In addition, concurrency is increased further by use of run-time information. A performance study is conducted by means of simulation using 007 benchmark. Through the simulation, the proposed technique is then compared with the two existing techniques. The performance studies show that the proposed scheme is superior to existing works.     

An optimistic locking technique for concurrency control indistributed databases

A method called optimistic method with dummy locks (ODL) is suggested for concurrency control in distributed databases. It is shown that by using long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and, during the validation test, only the related sites are checked. The transactions to be aborted are immediately recognized before the validation test, reducing the costs of restarts. Usual read and write locks are used as short-term locks during the validation test. The use of short-term locks in the optimistic approach eliminates the need for the system-wide critical section and results in a distributed and parallel validation test. The performance of ODL is compared with strict two-phase locking (2PL) through simulation, and it is found out that for the low conflict cases they perform almost the same, but for the high conflicting cases, ODL performs better than strict 2PL     

基于XML的异构数据库间联合使用

分析了目前异构数据库系统的存在问题和XML在解决异构数据库联合使用问题中的优势，并在此基础上提出了一个基于XML的异构数据库间联合使用的设想和实现方案。通过实践着重研究和验证了如何构造系统的XML元数据，以及如何实现基于XML的异构数据库的数据转换和数据透明访问等一系列问题。     

纯XML数据库语义缓存综述

介绍了语义缓存、XML查询语言等概念,对现有的多种纯XML数据库语义缓存技术及其实现、技术特点等进行了详细的阐述。在讨论了当前语义缓存的研究中遇到的新问题与挑战之后,介绍了一种语义缓存匹配视图的快速查找算法U ViewMatch,并总结了语义缓存的技术路线。     

Query optimization in XML structured-document databases

While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become more important than ever. This article reports our recent advances in XML structured-document query optimization. In this article, we elaborate on a novel approach and the techniques developed for XML query optimization. Our approach performs heuristic-based algebraic transformations on XPath queries, represented as PAT algebraic expressions, to achieve query optimization. This article first presents a comprehensive set of general equivalences with regard to XML documents and XML queries. Based on these equivalences, we developed a large set of deterministic algebraic transformation rules for XML query optimization. Our approach is unique, in that it performs exclusively deterministic transformations on queries for fast optimization. The deterministic nature of the proposed approach straightforwardly renders high optimization efficiency and simplicity in implementation. Our approach is a logical-level one, which is independent of any particular storage model. Therefore, the optimizers developed based on our approach can be easily adapted to a broad range of XML data/information servers to achieve fast query optimization. Experimental study confirms the validity and effectiveness of the proposed approach.