Lehrgebiet Informationssysteme

FB Informatik

LG IS

AG DBIS

(C) AG DBIS

DeweyIDs - The Key to Fine-Grained Management of XML Documents

Michael P. Haustein, Theo Härder, Christian Mathis, Markus Wagner

University of Kaiserslautern
Dept. of Computer Science (AG DBIS)
P.O. Box 3049, 67653 Kaiserslautern, Germany
e-mail: {haustein, haerder, mathis, m_wagner}@informatik.uni-kl.de

Full paper (PDF version)

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.

in: Proc. SBBD 2005.