The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Path Locks for XML Document Collaboration
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Evaluating lock-based protocols for cooperation on XML documents
ACM SIGMOD Record
Conflict scheduling of transactions on XML documents
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Optimistic path-based concurrency control over XML documents
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Computer Standards & Interfaces
| Hi-index | 0.00 |
The hierarchical and semistructured nature of XML data may cause complicated update-behavior. Updates should not be limited to entire document trees, but should ideally involve subtrees and even individual elements. Providing a suitable scheduling algorithm for semistructured data can significantly improve collaboration systems that store their data -- e.g. word processing documents or vector graphics-- as XML documents. In this paper we improve upon earlier work (see [5]) which presented two equivalent concurrency control mechanisms based on Path Locks. In contrast to the earlier work, we now provide details regarding the workings of a commit scheduler for XML databases which uses the path lock conflict rules. We also give a comprehensive proof of serializability which enhances and clarifies the ideas in our previous work.