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
VLEI Code: An Efficient Labeling Method for Handling XML Documents in an RDB
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
LSDX: a new labelling scheme for dynamically updating XML data
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
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
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Efficient Secure Labeling Method under Dynamic XML Data Streams
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
An efficient XML encoding and labeling method for query processing and updating on dynamic XML data
Journal of Systems and Software
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Compacting XML Structures Using a Dynamic Labeling Scheme
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
A Binary String Approach for Updates in Dynamic Ordered XML Data
IEEE Transactions on Knowledge and Data Engineering
Desirable properties for XML update mechanisms
Proceedings of the 2010 EDBT/ICDT Workshops
An efficient scheme to completely avoid re-labeling in XML updates
WISE'06 Proceedings of the 7th international conference on Web Information Systems
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
An improved prefix labeling scheme: a binary string approach for dynamic ordered XML
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limit the growth rate in node label size, and consequently increase query performance and reduce update costs. The ability to reuse deleted node labels is a key property in achieving this goal. In this paper, we review the existing dynamic labeling schemes that provide this functionality and identify their shortcomings. We present our own dynamic labeling scheme that guarantees every delete node label can be reused. Further, we provide a deleted node label reuse strategy that best suits the nature of node insertions and deletions in an XML tree.