Dekeyser, Stijn and Hidders, Jan (2003) A commit scheduler for XML databases. In: 5th Asia-Pacific Web Conference (APWeb 2003): Web Technologies and Applications , 23-25 Apr 2003, Xian, China.
PDF (Author Version)
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 signicantly 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 claries the ideas in our previous work.
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Additional Information:||Deposited in accordance with the copyright policy of the publisher. Copyright 2003 Springer. This is the author's version of the work. It is posted here with permission of the publisher for your personal use. No further distribution is permitted. The item is also available in Lecture Notes in Computer Science v. 2642 at http://www.springerlink.com|
|Uncontrolled Keywords:||concurrency control; databases; semistructured; XML|
|Depositing User:||Dr. Stijn Dekeyser|
|Date Deposited:||14 May 2010 06:18|
|Last Modified:||02 Jul 2013 23:46|
Actions (login required)
|Archive Repository Staff Only|