Tree inclusion algorithm, signatures and evaluation of path-oriented queries

Authors:
Yangjun Chen;Yong Shi;Yibin Chen
Affiliations:
University of Winnipeg, Manitoba, Canada;University of Manitoba, Manitoba, Canada;University of Winnipeg, Manitoba, Canada
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 9
Cited 4

Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
More efficient algorithm for ordered tree inclusion

Journal of Algorithms
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Introduction to Modern Information Retrieval

Introduction to Modern Information Retrieval
Signature-based structures for objects with set-valued attributes

Information Systems - Databases: Creation, management and utilization
A New Query Processing Technique for XML Based on Signature

DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
A New Algorithm for the Ordered Tree Inclusion Problem

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
On the Tree Inclusion Problem

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data

Application of tree mining to matching of knowledge structures of decision tree type

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Weak inclusion for XML types

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Path-Oriented integration method for complex trees

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Weak inclusion for recursive XML types

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a method to evaluate path-oriented queries in document databases is proposed. The main idea of this method is to handle the evaluation of a path-oriented query as a tree inclusion problem. A new algorithm for tree-inclusion is discussed, which integrates a top-down process into a bottom-up searching strategy. On the one hand, the algorithm can be arranged to access the data on disk page-wise and fits therefore within a database environment. On the other hand, the algorithm can be combined with the signature indexing technique to cut off useless subtree inclusion checking as early as possible. Experiments have been conducted to compare this method with some existing approaches, which shows that the integration of the signatures into the top-down tree inclusion is highly promising.