Labeling XML Documents

Labeling XML Documents

Jiaheng Lu, Liang Xu, Tok Wang Ling, Changqing Li
Copyright: © 2010 |Pages: 18
DOI: 10.4018/978-1-61520-727-5.ch006
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

XML labeling schemes play an important role in XML query processing. Containment and Prefix labeling schemes are two of the most popular labeling schemes. In order to perform efficient XML query processing, this chapter shows how to extend the traditional prefix labeling scheme to speedup query processing. In addition, for XML documents that are updated frequently, many labeling schemes require relabeling which can be very expensive. A lot of research interest has been generated on designing dynamic XML labeling schemes. Making labeling schemes dynamic turns out to be a challenging problem and many of the approaches proposed only partially avoid relabeling. This chapter describes some recently emerged dynamic labeling schemes that can completely avoid relabeling, making efficient update processing in XML database management systems possible.
Chapter Preview
Top

Static Xml Labeling Schemes

In order to perform XML query processing efficiently, one way is to develop a labeling scheme to capture the structural information of XML documents to facilitate query processing without traversing the original XML documents.

The existing labeling scheme use a tree-traversal order(e.g. extended preorder [Li&Moon, 2001]) or textual positions of start and end tags (e.g. containment [Bruno, Koudas, & Srivastava 2005]) or path expressions(e.g. Dewey ID [Tatarinov et al. 2002]) or prime numbers (e.g. [Wu&Lee, 2004]). By applying these labeling schemes, one can determine the relationship (e.g. ancestor-descendent and parent-child) between two elements in XML documents from their labels alone. We introduce the labeling schemes for static documents as follows.

Complete Chapter List

Search this Book:
Reset