VLEI Code: An Efficient Labeling Method for Handling XML Documents in an RDB

Authors:
Kazuhito Kobayashi;Wenxin Wenxin;Dai Kobayashi;Akitsugu Watanabe;Haruo Yokota
Affiliations:
Tokyo Institute of Technology;Tokyo Institute of Technology;Tokyo Institute of Technology;Tokyo Institute of Technology;Tokyo Institute of Technology
Venue:
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Year:
2005

Citing 3
Cited 4

Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Maintaining order in a linked list

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data

MedTAKMI-CDI: interactive knowledge discovery for clinical decision intelligence

IBM Systems Journal
A method for online analytical processing of text data

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
EBSL: supporting deleted node label reuse in XML

XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of XML labeling methods have been proposed to store XML documents in relational databases. However, they have a vulnerable point, in insertion operations. We propose the Variable Length Endless Insertable (VLEI) code and apply it to XML labeling to reduce the cost of insertion operations. Results of our experiments indicate that a combination of the VLEI code and Dewey order is effective for handling skewed insertions.