A path-based approach for efficient structural join with not-predicates

Authors:
Hanyu Li;Mong Li Lee;Wynne Hsu;Ling Li
Affiliations:
School of Computing, National University of Singapore;School of Computing, National University of Singapore;School of Computing, National University of Singapore;School of Computing, National University of Singapore
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 9
Cited 3

Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Multi-level operator combination in XML query processing

Proceedings of the eleventh international conference on Information and knowledge management
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach

Proceedings of the thirteenth ACM international conference on Information and knowledge management
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
TwigStackList ¬: a holistic twig join algorithm for twig query with not-predicates on XML data

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
PathStack¬: a holistic path join algorithm for path query with not-predicates on XML data

DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
A path-based labeling scheme for efficient structural join

XSym'05 Proceedings of the Third international conference on Database and XML Technologies

Efficient evaluation of NOT-twig queries in tree-unaware relational databases

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
ANDES: efficient evaluation of NOT-twig queries in relational databases

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient processing of twig query with compound predicates in fuzzy XML

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

There has been much research on XML query processing. However, there has been little work on the evaluation of XML queries involving not-predicates. Such queries are useful and common in many real-life applications. In this paper, we present a model called XQuery tree to model queries involving not-predicates and describe a path-based method to evaluate such queries efficiently. A comprehensive set of experiments is carried out to demonstrate the effectiveness and efficiency of the proposed solution.