Instance-independent view serializability for semistructured databases

Dekeyser, S. and Hidders, Jan and Paredaens, J. and Vercammen, R. (2005) Instance-independent view serializability for semistructured databases. The Computing Research Repository.

Full text not available from this repository.

Official URL: https://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.

Metadata

Item Type:	Other
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	13 Apr 2021 18:07
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43884

Statistics

Archive Staff Only (login required)

Edit/View Item