A Commit Scheduler for XML Databases
- 450 Downloads
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 ) 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.
Unable to display preview. Download preview PDF.
- 1.S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan-Kaufmann, San Francisco, 1999.Google Scholar
- 2.P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison Wesley, Reading, Mass., 1987.Google Scholar
- 3.J. Clark and S. DeRose. XML Path Language (XPath). W3C Recommendation, November 1999.Google Scholar
- 4.S. Dekeyser and J. Hidders. A path-lock scheduler for XML databases. Technical Report 02-13, University of Antwerp, 2002. ftp://win-ftp.uia.ac.be/pub/dekeyser/scheduler.ps.
- 5.S. Dekeyser and J. Hidders. Path locks for XML document collaboration. In Proceedings of the Second WISE Conference, 2002.Google Scholar
- 6.J. Gray. Notes on database operating systems. In Operating Systems: an Advanced Course. Springer-Verlag, New York, 1978.Google Scholar
- 8.G. Weikum and G. Vossen. Transactional Information Systems. Morgan Kaufmann, 2002. ISBN: 1-55860-508-8.Google Scholar