Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

The Label Based Concurrency Control in XML Databases

Authors

[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication

2009

Chapter type

paper

Publication language

english

Abstract

EN We propose a label based technique for an effective management of structural locks in XML databases. In particular we consider two types of such locks, acquired by transactions on sets of nodes. These are path locks and range locks – the latter understood as some subset of document's nodes defined by a pair of labels, with the sub-tree lock being a special case of range lock. We put forward algorithms for consolidation of shared locks that define a continuous covering, a way of initial processing simplifying and accelerating the lock manager. Two algorithms for the lock manager are framed with the use of XML labels for both the 2PL protocol and the cooperative one. We also point to some interesting ties between the lock management and the shortest path problem. Our motivation is given in the context of the SEDNA native XML DB isolation rules, however, our technique is useful for most of the fine-granular lock protocols.

Pages (from - to)

17 - 28

DOI

10.3233/978-1-58603-939-4-17

URL

https://ebooks.iospress.nl/publication/4921

Book

Databases and Information Systems V. Selected Papers from the Eighth International Baltic Conference, DB&IS 2008

Presented on

8th International Baltic Conference : Baltic DB&IS, 2-5.06.2008, Tallin, Estonia

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.