Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
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
Holistically processing XML twig queries with AND, OR, and NOT predicates
Proceedings of the 2nd international conference on Scalable information systems
S3: Evaluation of tree-pattern XML queries supported by structural summaries
Data & Knowledge Engineering
Proceedings of the VLDB Endowment
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
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
Efficient processing of ordered XML twig pattern
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Holistic Boolean-Twig Pattern Matching for Efficient XML Query Processing
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
Efficient twig pattern matching is essential to XML queries and other tree-based queries. Numerous so-called holistic algorithms have been proposed to process the twig patterns in XML queries. However, a more general form of twig patterns, called B-twig (or Boolean-twig), which allow arbitrary combination of all the three logical connectives, AND, OR, and NOT in the twig patterns, has not yet been adequately addressed. In this paper, a new approach accompanied with an optimal implementation algorithm is presented for efficiently processing B-twig XML queries. Experimental study confirms the viability and performance superiority of our new approach.