An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
XAL: an algebra for XML query optimization
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
APEX: an adaptive path index for XML data
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
Estimating Answer Sizes for XML Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th 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
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th 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
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
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
Index Structures for Matching XML Twigs Using Relational Query Processors
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
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
XSKETCH synopses for XML data graphs
ACM Transactions on Database Systems (TODS)
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
Structure and value synopses for XML data graphs
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
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
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
A path-based labeling scheme for efficient structural join
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Index vs. navigation in XPath evaluation
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
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
| Hi-index | 0.00 |
XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g., articles in a digital library, documents on the web, and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years. If we consider some classes of indexing methods, we distinguish two kinds of joins for processing twig queries. The first join merges two sets retrieved from an inverted list. The second join applies the first query result in building the second query. Although authors propose improvements of their joins, there has not yet been a discussion about the advantages of applying various join operations. In this article, we propose a join selection based on the cost of a join. By choosing a more appropriate join operation, twig query processing efficiency is significantly improved.