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
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Introduction to Algorithms
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient ordering for XML data
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
MASS: a multi-axis storage structure for large XML documents
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
LLS: level-based labeling scheme for XML databases
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
Hi-index | 0.00 |
With the increasing popularity of XML, there arises the need for managing and querying information in this form. Several query languages, such as XQuery, have been proposed which return their results in document order. However, most recent efforts focused on query optimization have either disregarded order or proposed static schemes in which updates are not handled efficiently. Some dynamic labelling schemes have been proposed but they do not consider type information that is usually available with the XML documents or maintained by the database system. This paper presents theoretically sound algorithms for maintaining the well-known region algebra labeling schemes, which can take advantage of type information, often present in XML documents.