On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 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
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Tree logical classes for efficient evaluation of XQuery
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
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
Full-Fledged Algebraic XPath Processing in Natix
ICDE '05 Proceedings of the 21st 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
Tree-pattern queries on a lightweight XML processor
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
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the efficient search of an XML twig query in large DataGuide trees
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
On the Efficiency of a Prefix Path Holistic Algorithm
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Using Structural Joins and Holistic Twig Joins for Native XML Query Optimization
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Efficient holistic twig joins in leaf-to-root combining with root-to-leaf way
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Twiglist: make twig pattern matching fast
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
TwigBuffer: avoiding useless intermediate solutions completely in twig joins
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
An integrative approach to query optimization in native XML database management systems
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Benchmarking the compression of XML node streams
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
TP+Output: modeling complex output information in XML twig pattern query
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Indexing and querying XML using extended Dewey labeling scheme
Data & Knowledge Engineering
Proceedings of the VLDB Endowment
Extended XML Tree Pattern Matching: Theories and Algorithms
IEEE Transactions on Knowledge and Data Engineering
TwigTable: using semantics in XML twig pattern query processing
Journal on data semantics XV
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
Implementation of XPath axes in the multi-dimensional approach to indexing XML data
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Holistic Boolean-Twig Pattern Matching for Efficient XML Query Processing
IEEE Transactions on Knowledge and Data Engineering
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
Hi-index | 0.00 |
Searching for occurrences of a twig pattern query (TPQ) in an XML document is a core task of all XML database query languages. The generalized twig pattern (GTP) extends the TPQ model to include semantics related to output nodes, optional nodes, and boolean expressions which are part of the XQuery language. Preorder filtering holistic algorithms such as TwigStack represent a significant class of TPQ processing approaches with a linear worst-case I/O complexity with respect to the sum of the input and output sizes for some query classes. Another important class of holistic approaches is represented by postorder filtering holistic algorithms such as $$\text{ Twig}^2$$ Stack which introduced a linear output enumeration time with respect to the result size. In this article, we introduce a holistic algorithm called GTPStack which is the first approach capable of processing a GTP with a linear worst-case I/O complexity with respect to the GTP result size. This is achieved by using a combination of the preorder and postorder filterings before storing nodes in an intermediate storage. Additionally, another contribution of this article is an introduction of a new perspective of holistic algorithm optimality. We show that the optimality depends not only on a query class but also on XML document characteristics. This new view on the optimality extends the general knowledge about the type of queries for which the holistic algorithms are optimal. Moreover, it allows us to determine that GTPStack is optimal for any GTP when a specific XML document is considered. We present a comprehensive experimental study of the state-of-the-art holistic algorithms showing under which conditions GTPStack outperforms the other holistic approaches.