ACM Home Page
Please provide us with feedback. Feedback
Labeling dynamic XML trees
Full text PdfPdf (267 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Madison, Wisconsin
SESSION: Research session 8: semistructured data and XML table of contents
Pages: 271 - 281  
Year of Publication: 2002
ISBN:1-58113-507-6
Authors
Edith Cohen  AT&T Labs-Research
Haim Kaplan  Tel Aviv University
Tova Milo  INRIA & Tel Aviv University
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 71,   Citation Count: 39
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/543613.543648
What is a DOI?

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 us 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
5
 
6
R. G. G. Cattell, editor. The Object Database Standard: ODMG-93. Morgan Kaufmann, San Mateo, California, 1994.
 
7
D. Chamberlin, J. Clark, D. Florescu, J. Robie, J. Siméon, and M. Stefanescu. XQuery 1.0: An XML Query Language. W3C working draft, June 2001. http://www.w3.org/TR/xquery.
 
8
 
9
 
10
N. Santoro and R. Khatib. Labeling and implicit routing in networds. The Computer J., 28:5-8, 1985.
 
11
W3C. Extensible markup language (XML) 1.0. http://www.w3.org/TR/REC-xml.
 
12
W3C. Extensible stylesheet language (XSL). http://www.w3.org/Style/XSL/.
 
13
W3C. Xsl transformations (xslt) specification. http://www.w3.org/TR/WD-xslt.
 
14
Xdex. http://www.xmlindex.com.
 
15
Xyleme. A dynamic data warehouse for the XML data of the Web. http://www.xyleme.com.
 
16
A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 17th Annual Symposium on Foundations of Computer Science, pages 222-227, 1977.
17

CITED BY  39

Collaborative Colleagues:
Edith Cohen: colleagues
Haim Kaplan: colleagues
Tova Milo: colleagues