Labeling dynamic XML trees

Edith Cohen, Haim Kaplan, Tova Milo

Research output: Contribution to conferencePaperpeer-review

Abstract

We present algorithms to label the nodes of an XML tree which is subject to insertions and deletions of nodes. The labeling is done such that (1) we label each node immediately when it is inserted and this label remains unchanged, and (2) from a pair of labels alone, we can decide whether one node is an ancestor of the other. This problem arises in the context of XML databases that support queries on the structure of the documents as well as on the changes made to the documents over time. We prove that our algorithms assign the shortest possible labels (up to a constant factor) which satisfy these requirements. We also consider the same problem when "clues" that provide guarantees on possible future insertions are given together with newly inserted nodes. Such clues can be derived from the DTD or from statistics on similar XML trees. We present algorithms that use the clues to assign shorter labels. We also prove that the length of our labels is close to the minimum possible.

Original languageEnglish
Pages271-281
Number of pages11
DOIs
StatePublished - 2002
EventProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) - Madison, WI, United States
Duration: 3 Jun 20025 Jun 2002

Conference

ConferenceProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002)
Country/TerritoryUnited States
CityMadison, WI
Period3/06/025/06/02

Fingerprint

Dive into the research topics of 'Labeling dynamic XML trees'. Together they form a unique fingerprint.

Cite this