Using a compact tree to index and query XML data

Authors:
Qinghua Zou;Shaorong Liu;Wesley W. Chu
Affiliations:
University of California - Los Angeles, Los Angeles, CA;University of California - Los Angeles, Los Angeles, CA;University of California - Los Angeles, Los Angeles, CA
Venue:
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Year:
2004

Citing 3
Cited 0

DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Configurable indexing and ranking for XML information retrieval

Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Ctree: a compact tree for indexing XML data

Proceedings of the 6th annual ACM international workshop on Web information and data management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but also detailed child-parent relationships at element level. Based on Ctree, we are able to measure how well XML data is structured. We also propose a three-step query processing method. Its efficiency is achieved by: (1) summarizing large XML data structures into a condensed Ctree; (2) pruning irrelevant groups to significantly reduce the search space; (3) eliminating join operations between the matches for value predicates and those for structure constraints and (4) using Ctree properties such as regular groups to reduce query processing time. Our experiments reveal that Ctree is an effective data structure for managing XML data.