Dekeyser, S. and Hidders, Jan (2003) A commit scheduler for XML databases. In: Zhou, X. and Zhang, Y. and Orlowska, M.E. (eds.) Web Technologies and Applications: 5th Asian-Pacific Web Conference. Lecture Notes in Computer Science 2642. Springer, pp. 83-88. ISBN 9783540023548.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Apr 2021 18:13 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43938 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
