Integration of a structural index with a structural join for accelerating path queries

Authors:
Jongik Kim;SooCheol Lee;Oh-Cheon Kwon
Affiliations:
Telematics Service Convergence Research Team, Telematics USN Research Division, Electronics and Telecommunications Research Institute, Daejon, Korea;Telematics Service Convergence Research Team, Telematics USN Research Division, Electronics and Telecommunications Research Institute, Daejon, Korea;Telematics Service Convergence Research Team, Telematics USN Research Division, Electronics and Telecommunications Research Institute, Daejon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 8
Cited 0

A query language for XML

WWW '99 Proceedings of the eighth international conference on World Wide Web
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current techniques for processing XML queries can be divided into two groups. One is structural index techniques that reduce the search space by traversing a structural summary instead of a data graph. And the other is structural join techniques that can efficiently compute ancestor-descendant pairs from two lists of nodes without traversing the data graph. In this paper, we propose a structural index technique and a novel structural join technique and we prove that these two proposed techniques are integrated to accelerate processing of a path query in the experiments.