TY - JOUR
T1 - A transaction model for XML databases
AU - Dekeyser, S.
AU - Hidders, A.J.H.
AU - Paredaens, J.
PY - 2004
Y1 - 2004
N2 - 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 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.
Keywords
XML, semistructured data, path lock, serializability, scheduler, concurrency control
AB - 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 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.
Keywords
XML, semistructured data, path lock, serializability, scheduler, concurrency control
U2 - 10.1023/B:WWWJ.0000015864.75561.98
DO - 10.1023/B:WWWJ.0000015864.75561.98
M3 - Article
SN - 1386-145X
VL - 7
SP - 29
EP - 57
JO - World Wide Web
JF - World Wide Web
IS - 1
ER -