Maintaining order in a generalized linked list
Acta Informatica
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An XML Indexing Structure with Relative Region Coordinate
Proceedings of the 17th International Conference on Data Engineering
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 Tight Lower Bound for On-line Monotonic List Labeling
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
From XML Schema to Relations: A Cost-Based Approach to XML Storage
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Querying and maintaining a compact XML storage
Proceedings of the 16th international conference on World Wide Web
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
A bi-labeling based XPath processing system
Information Systems
Processing keyword search on XML: a survey
World Wide Web
Dynamic range labeling for XML trees
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems While most of the recent work focuses on efficient XML query processing, XML databases also need to support efficient updates To speed up query processing, various labeling schemes have been proposed However, the vast majority of these schemes have poor update performance In this paper, we introduce a dynamic labeling structure for XML data: L-Tree and its order-preserving labeling scheme with O(log n) amortized update cost and O(log n) bits per label L-Tree has good performance on updates without compromising the performance of query processing We present the update algorithm for L-Tree and analyze its complexity.