DBScholar

Back to papers

Approximate XML Query Answers

Summary: Proposes TREESKETCH synopses for compact, approximate XML query answering over large tree-structured data. Introduces novel construction algorithms and an error metric, enabling fast twig queries with high accuracy and outperforming selectivity-only approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3586
Venue
SIGMOD
Year
2004
Pagerank
7.6599179e-05
Overall Rank
3,180 | 78.19%
DOI
10.1145/1007568.1007599

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{polyzotis_sigmod04,
        title = {{Approximate XML Query Answers}},
        author = {Polyzotis, Neoklis and Garofalakis, Minos and Ioannidis, Yannis},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007599},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007599},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers