A Transaction Model for XML Databases
World Wide Web
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
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An efficient infrastructure for native transactional XML processing
Data & Knowledge Engineering
Optimizing lock protocols for native XML processing
Data & Knowledge Engineering
Quantity comparison of concurrency control methods for XML database systems based on DOM API
International Journal of Web Engineering and Technology
Optimistic path-based concurrency control over XML documents
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
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
Cooperative data management for XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
The hierarchical and semistructured nature of XML datacan cause complicated types of update-behavior. The updatesare not limited to entire document trees, but can involvesubtrees and even individual elements. These documentparts correspond to e.g. sections in text documents orsub-diagrams in vector graphics files. Providing suitablelocking mechanisms for semi-structured data can significantlyimprove collaboration systems that store their dataas XML documents.In this paper we show that concurrency control mechanismsin CVS, relational, and object oriented database systemsare inadequate for collaboration systems based on semi-structureddata. We therefore propose a new locking schemeof fine granularity based on path locks. We also show thatour proposed mechanism avoids conflicts by ensuring serializability,that it supports both top-down and bottom-upquery evaluation, and that it is relatively efficient.