Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Representative Objects: Concise Representations of Semistructured, Hierarchial Data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Change-Centric Management of Versions in an XML Warehouse
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Management of Multiversion Documents by Object Referencing
Proceedings of the 27th International Conference on Very Large Data Bases
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Data stream management for historical XML data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Efficient Processing of Updates in Dynamic XML Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
EBSL: supporting deleted node label reuse in XML
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Hi-index | 0.00 |
To facilitate the XML query processing, several kinds of labeling schemes have been proposed. Based on the labeling schemes, the ancestor-descendant and parent-child relationships in XML queries can be quickly determined without accessing the original XML file. Recently, more researches are focused on how to update the labels when nodes are inserted into the XML. However how to process the deleted labels are not discussed previously. We think that the deleted labels can be processed in two different directions: (1) reuse all the deleted labels to control the label size increasing speed and improve the query performance; (2) never reuse the deleted labels to query different versions of the XML data based on labeling schemes. In this paper, we firstly introduce our previous work, called QED, which can completely avoid the re-labeling in XML updates. Secondly based on QED we propose a new algorithm, called Reuse, which can reuse all the deleted labels to control the label size increasing speed; meanwhile the Reuse algorithm can completely avoid the re-labeling also. Thirdly to query different versions of the XML data, we propose another new algorithm, called NeverReuse, which is the only approach that never reuses any deleted labels. Extensive experimental results show that the algorithms proposed in this paper can control the label size increasing speed when reusing all the deleted labels, and is the only approach to query different versions of the XML data based on labeling schemes.