Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Index structures for structured documents
Proceedings of the first ACM international conference on Digital libraries
Lore: a database management system for semistructured data
ACM SIGMOD Record
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Journal of the American Society for Information Science and Technology - XML
Accelerating XPath location steps
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
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
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Indexing XML data stored in a relational database
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Exploiting native XML indexing techniques for XML retrieval in relational database systems
Proceedings of the 7th annual ACM international workshop on Web information and data management
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Persistent Labeling Scheme for Dynamic Ordered XML Trees
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Processing queries with metrical constraints in XML-based IR systems
Journal of the American Society for Information Science and Technology
Using a relational database for scalable XML search
The Journal of Supercomputing
Integrating and querying distributed XML data via XLink
Information Systems
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
ACM Computing Surveys (CSUR)
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
This paper introduces the BIRD family of numbering schemes for tree databases, which is based on a structural summary such as the DataGuide. Given the BIRD IDs of two database nodes and the corresponding nodes in the structural summary we decide the extended XPath relations Child, Child+, Child∗, Following, NextSibling, NextSibling+, NextSibling∗ for the nodes without access to the database. Similarly we can reconstruct the parent node and neighbouring siblings of a given node. All decision and reconstruction steps are based on simple arithmetic operations. The BIRD scheme offers high expressivity and efficiency paired with modest storage demands. Compared to other identification schemes with similar expressivity, BIRD performs best in terms of both storage consumption and execution time, with experiments underlining the crucial role of ID reconstruction in query evaluation. A very attractive feature of the BIRD scheme is that all extended XPath relations can be decided and reconstructed in constant time, i.e., independent of tree position and distance of the nodes involved. All results are shown to scale up to the multi-Gigabyte level.