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
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient ordering for XML data
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
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Indexing XML data stored in a relational database
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
L-Tree: a dynamic labeling structure for ordered XML data
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Lazy XML updates: laziness as a virtue, of update and structural join efficiency
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
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
XML Document Indexes: A Classification
IEEE Internet Computing
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
Proceedings of the 14th ACM international conference on Information and knowledge management
Dynamic labeling schemes for ordered XML based on type information
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Querying and maintaining a compact XML storage
Proceedings of the 16th international conference on World Wide Web
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Dynamic interval-based labeling scheme for efficient XML query and update processing
Journal of Systems and Software
Value-based notification conditions in large-scale publish/subscribe systems?
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
XML Storage and Processing on Mobile Devices
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Dynamic Labelling Scheme for XML Data Processing
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Query translation from XPath to SQL in the presence of recursive DTDs
The VLDB Journal — The International Journal on Very Large Data Bases
A bi-labeling based XPath processing system
Information Systems
Desirable properties for XML update mechanisms
Proceedings of the 2010 EDBT/ICDT Workshops
SIAM Journal on Computing
Adaptively indexing dynamic XML
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Reuse or never reuse the deleted labels in XML query processing based on labeling schemes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
DeltaNI: an efficient labeling scheme for versioned hierarchical data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment join and twig matching. While labeling for static XML documents is well understood, less is known about how to maintain accurate labeling for dynamic XML documents, when elements and subtrees are inserted and deleted. Most existing approaches do not work well for arbitrary update patterns; they either produce unacceptably long labels or incur enormous relabeling costs. We present two novel I/O-efficient data structures, W-BOX and B-BOX, thatefficiently maintain labeling for large, dynamic XML documents. We show analytically and experimentally that both, despite consuming minimal amounts of storage, gracefully handle arbitrary update patterns without sacrificing lookupefficiency. The two structures together provide a nice tradeoff between update and lookup costs: W-BOX has logarithmic amortized update cost and constant worst-case lookup cost, while B-BOX has constant amortized update cost and logarithmic worst-case lookup cost. We further propose techniques to eliminate the lookup cost for read-heavy workloads.