Node Labeling Schemes for Dynamic XML Documents Reconsidered
In: Data & Knowledge Engineering. Elsevier, 2006
Authors
- Theo Härder
- Michael P. Haustein
- Christian Mathis
- Markus Wagner
Abstract
We explore and compare suitable node labeling schemes to be used in collaborative XML DBMSs (XDBMSs, for short) supporting typical XML document processing (XDP) interfaces. Such schemes have to provide holistic support for essential XDBMS processing steps concerning declarative as well as navigational query processing and, with the same importance, lock management. In this paper, we evaluate existing range-based and prefix-based labeling schemes, before we propose our own scheme based on DeweyIDs. We experimentally explore the suitability of DeweyIDs as a general and immutable node labeling mechanism, stress their synergetic potential for query processing and locking, and show how they can be implemented efficiently. Various compression and optimization measures deliver surprising space reductions, frequently reduce the size of storage representation - compared to an already space-efficient encoding scheme - to less than 20 - 30% in the average and, thus, conclude their practical relevance.
Full Text
BibTeX
@Article{ Haerder.Haustein.EA06node,
title = { Node Labeling Schemes for Dynamic XML Documents Reconsidered },
author = { Theo Härder and Michael P. Haustein and Christian Mathis and Markus Wagner },
journal = { Data & Knowledge Engineering },
publisher = { Elsevier },
year = 2006,
}
This publication belongs to the project
A3XDB.
