On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
XMLTM: efficient transaction management for XML documents
Proceedings of the eleventh international conference on Information and knowledge management
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Path Locks for XML Document Collaboration
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
A Transaction Model for XML Databases
World Wide Web
Evaluating lock-based protocols for cooperation on XML documents
ACM SIGMOD Record
Don't be a Pessimist: Use Snapshot based Concurrency Control for XML
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Freshness Control of XML Documents for Query Load Balancing
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
A commit scheduler for XML databases
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
XDGL: XPath-based concurrency control protocol for XML data
BNCOD'05 Proceedings of the 22nd British National conference on Databases: enterprise, Skills and Innovation
| Hi-index | 0.00 |
We present a new approach for concurrency control over XML documents. Unlike most of other approaches, we use an optimistic scheme, since we believe that it is better suited for Web applications. The originality of our solution resides in the fact that we use path expressions associated with operations to detect conflicts between transactions. This makes our approach scalable since conflict detection except in few cases does not depend on the database size nor on the amount of modified fragments. In this paper, we describe and motivate our concurrency mechanism architecture, we describe the conflict detection algorithm which is the core of our proposal and exhibit first experimental results.