Dynamic range labeling for XML trees

Authors:
Takeharu Eda;Yasushi Sakurai;Toshiyuki Amagasa;Masatoshi Yoshikawa;Shunsuke Uemura;Takashi Honishi
Affiliations:
NTT Cyber Space Laboratories, Japan;NTT Cyber Space Laboratories, Japan;Graduate School of Information Science, Nara Institute of Science and Technology, Japan;Information Technology Center, Nagoya University, Japan;Graduate School of Information Science, Nara Institute of Science and Technology, Japan;NTT Cyber Space Laboratories, Japan
Venue:
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Year:
2004

Citing 8
Cited 3

Labeling dynamic XML trees

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of labeling schemes for ancestor queries

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
A Structural Numbering Scheme for XML Data

EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Storing and Querying Multiversion XML Documents using Durable Node Numbers

WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
L-Tree: a dynamic labeling structure for ordered XML data

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient labeling scheme for dynamic XML trees

Information Sciences: an International Journal
Dynamically querying possibilistic XML data

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structural joins based on range labeling schemes are considered as one of the most important topics in studies on XML query processing When an XML data set is updated, however, the nodes have to be relabeled in order to keep their order relationship Costly bulk node relabeling should be avoided to allow for continuous processing of queries for dynamic XML trees that are updated often In this paper, we propose two dynamic node labeling schemes to avoid “gap shortfalls” One is simple local relabeling scheme and the other is more sophisticated in that it uses approximate histograms that keep the statistics of the update operations These two techniques allow node labels to be managed dynamically and locally Experiments show that they can avoid bulk relabeling while still permitting update operations.