An Efficient XML Index Structure with Bottom-Up Query Processing

Authors:
Dong Min Seo;Jae Soo Yoo;Ki Hyung Cho
Affiliations:
Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Korea;Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Korea;Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 8
Cited 0

A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
APEX: an adaptive path index for XML data

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimizing Regular Path Expressions Using Graph Schemas

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
On the Sequencing of Tree Structures for XML Indexing

ICDE '05 Proceedings of the 21st 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

With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and B+Tree was proposed to reduce the search time of the documents. However, it can cause a lot of unnecessary computation and I/O when processing structural join queries because the numbering scheme of ViST is not optimized. In this paper, we propose a novel index structure to solve the problems of ViST. Our index structure provides the bottom-up query processing method to efficiently process structural queries. Our experiments show that the proposed index structure is efficient in processing both single-path and branching queries with various wild-cards (`*' and `//').