On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Database System Implementation
Database System Implementation
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
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 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
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
High performance index build algorithms for intranet search engines
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Evaluating structural summaries as access methods for XML
Proceedings of the 15th international conference on World Wide Web
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Efficient evaluation of generalized path pattern queries on XML data
Proceedings of the 17th international conference on World Wide Web
Semantic query Cache using Dynamic Facts (SCDF): a novel approach to efficient information retrieval
International Journal of Metadata, Semantics and Ontologies
Proceedings of the VLDB Endowment
Efficient XPath query processing
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Towards unifying advances in twig join algorithms
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
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
XPath query processing improvements
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
XML query processing: efficiency and optimality
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Structural joins are a fundamental operation in XML query processing and a large body of work has focused on index-based algorithms for executing them. In this paper, we describe how two well-known index features -- path indices and ancestor information -- can be combined in a novel way to replace one or more of the physical index cursors in a structural join with virtual cursors. The position of a virtual cursor is derived from the path and ancestor information of a physical cursor. Implementation results are provided to show that, by eliminating index I/O, virtual cursors can improve the performance of structural joins by an order of magnitude or more.