Dekeyser, Stijn and Hidders, Jan and Paredaens, Jan (2004) A transaction model for XML databases. World Wide Web, 7 (1). pp. 29-57. ISSN 1386-145X
|HTML Citation||EndNote||MODS||Dublin Core||Reference Manager|
Full text not available from this archive.
Official URL: http://dx.doi.org/10.1023/B:WWWJ.0000015864.75561.98
Identification Number or DOI: doi: 10.1023/B:WWWJ.0000015864.75561.98
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 show that concurrency control mechanisms in CVS, relational, and object-oriented database systems are inadequate for collaborative systems based on semistructured data. We therefore propose two new locking schemes based on path locks which are tightly coupled to the document instance. We also introduce two scheduling algorithms that can both be used with any of the two proposed path lock schemes. We prove that both schedulers guarantee serializability, and show that the conflict rules are necessary.
|Item Type:||Article (Commonwealth Reporting Category C)|
|Additional Information:||Author version not held.|
|Uncontrolled Keywords:||XML; concurrency control; path lock; scheduler; semistructured data; serializability|
|Fields of Research (FOR2008):||08 Information and Computing Sciences > 0806 Information Systems > 080604 Database Management|
|Socio-Economic Objective (SEO2008):||B Ecomonic Development > 89 Information and Communication Services > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified|
|Deposited On:||16 May 2010 21:25|
|Last Modified:||29 Aug 2012 13:12|
Archive Staff Only: edit this record