Instance-independent view serializability for semistructured databases
Article
Article Title | Instance-independent view serializability for semistructured databases |
---|---|
Article Category | Article |
Authors | Dekeyser, Stijn (Author), Hidders, Jan (Author), Paredaens, Jan (Author) and Vercammen, Roel (Author) |
Journal Title | The Computing Research Repository (CoRR) |
Number of Pages | 21 |
Year | 2005 |
Web Address (URL) | http://arxiv.org/abs/cs/0505074 |
Abstract | Semistructured databases require tailor-made concurrency control mechanisms since traditional solutions for the relational model have been shown to be inadequate. Such mechanisms need to take full advantage of the hierarchical structure of semistructured data, for instance allowing concurrent updates of subtrees of, or even individual elements in, XML documents. We present an approach for concurrency control which is document-independent in the sense that two schedules of semistructured transactions are considered equivalent if they are equivalent on all possible documents. We prove that it is decidable in polynomial time whether two given schedules in this framework are equivalent. This also solves the view serializability for semistructured schedules polynomially in the size of the schedule and exponentially in the number of transactions. |
Keywords | databases ; semistructured; view serializability; computing theory |
ANZSRC Field of Research 2020 | 460699. Distributed computing and systems software not elsewhere classified |
460999. Information systems not elsewhere classified | |
461399. Theory of computation not elsewhere classified | |
Public Notes | Not refereed. |
Byline Affiliations | Department of Mathematics and Computing |
University of Antwerp, Belgium |
https://research.usq.edu.au/item/9zqv9/instance-independent-view-serializability-for-semistructured-databases
Download files
1996
total views120
total downloads2
views this month3
downloads this month