Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
A Fast Index for Semistructured Data
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
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BLAS: an efficient XPath processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
A cost-based join selection for XML twig content-based queries
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
A path-based approach for efficient structural join with not-predicates
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
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
On the efficient processing regular path expressions of an enormous volume of XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
ANDES: efficient evaluation of NOT-twig queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
The structural join has become a core operation in XML query processing. This work examines how path information in XML can be utilized to speed up the structural join operation. We introduce a novel approach to pre-filter path expressions and identify a minimal set of candidate elements for the structural join. The proposed solution comprises of a path-based node labeling scheme and a path join algorithm. The former associates every node in an XML document with its path type, while the latter greatly reduces the cost of subsequent element node join by filtering out elements with irrelevant path types. Comparative experiments with the state-of-the-art holistic join algorithm clearly demonstrate that the proposed approach is efficient and scalable for queries ranging from simple paths to complex branch queries.