DBScholar

Back to papers

Labeling Dynamic XML Trees

Summary: Assign immutable insertion-time labels to nodes of dynamic XML trees so ancestry is decidable from label pairs; labels are provably shortest up to constant factors. Schemes that exploit DTD/statistical "clues" yield shorter, near-minimal labels. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1270
Venue
PODS
Year
2002
Pagerank
7.9151381e-05
Overall Rank
2,967 | 79.65%
DOI
10.1145/543613.543648

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{cohen_pods02,
        address = {New York, NY, USA},
        series = {{PODS} '02},
        title = {{Labeling Dynamic XML Trees}},
        url = {https://dl.acm.org/doi/10.1145/543613.543648},
        doi = {10.1145/543613.543648},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Cohen, Edith and Kaplan, Haim and Milo, Tova},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers