A time optimal algorithm for evaluating tree pattern queries

Authors:
Yangjun Chen
Affiliations:
University of Winnipeg, Winnipeg, Manitoba, Canada
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 10
Cited 0

Pattern Matching in Trees

Journal of the ACM (JACM)
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
Query Optimization for XML

VLDB '99 Proceedings of the 25th 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
On boosting holism in XML twig pattern matching using structural indexing techniques

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Twiglist: make twig pattern matching fast

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient processing of XML twig pattern: a novel one-phase holistic solution

DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tree pattern matching, which is used to find all occurrences of a tree pattern in an XML database, is a core operation for XML query processing. In this paper, we study this issue and discuss a new algorithm for processing unordered tree pattern queries, which works bottom-up. Its main idea is a new labeling method for tree pattern queries. Both the time and space complexities of the algorithm are bounded by O(|D|·|Q|), where Q stands for a tree pattern and D is a largest data stream associated with a node q of Q, which contains the database nodes that match the node predicate at q. In addition, the algorithm can be adapted to an indexing environment with XB-trees being used.