DeweyIDs - The Key to Fine-Grained Management of XML Documents
In: Proc. 20th Brasilian Symposium on Databases (SBBD 2005), Uberlandia, Brazil. P. 85--99, October, 2005
Authors
- Michael P. Haustein
- Theo Härder
- Christian Mathis
- Markus Wagner
Abstract
Because XML documents tend to be very large and are more and more processed in a collaborative way, their fine-grained storage and management is a must for which, in turn, a flexible tree representation is mandatory. Performance requirements dictate efficient query and update processing in multi-user environments. For this reason, three aspects are of particular importance: index support to directly access each internal document node if needed, navigation along the sibling and descendant axes, selective and direct locking of minimal document granules. The secret to effectively accelerate all of them are DeweyIDs. They identify the tree nodes, avoid relabeling of them even under heavy node insertions and deletions, and allow, at the same time, the derivation of all ancestor node IDs without accessing the document. In this paper, we explore the concept of DeweyIDs, refine the ORDPATH addressing scheme, illustrate its efficient implementation, and give an exhaustive performance evaluation of its practical use.
Full Text
BibTeX
@InProceedings{ Haustein.Haerder.EA05deweyids,
title = { DeweyIDs - The Key to Fine-Grained Management of XML Documents },
author = { Michael P. Haustein and Theo Härder and Christian Mathis and Markus Wagner },
booktitle = { Proc. 20th Brasilian Symposium on Databases (SBBD 2005), Uberlandia, Brazil },
pages = { 85--99 },
month = oct,
year = 2005,
}
This publication belongs to the project
A3XDB.
