DBScholar

Back to papers

The View Selection Problem for XML Content Based Routing

Summary: View selection for XML content-based routing: pick binary packet views enabling XPath evaluation without parsing to maximize throughput. Reduce problem to NP-hard Integer Cover and show the greedy log-n approximation is optimal for typical hierarchical XML workloads and degrades gracefully. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1279
Venue
PODS
Year
2003
Pagerank
5.5313703e-05
Overall Rank
7,853 | 46.13%
DOI
10.1145/773153.773161

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gupta_pods03,
        address = {New York, NY, USA},
        series = {{PODS} '03},
        title = {{The View Selection Problem for XML Content Based Routing}},
        url = {https://dl.acm.org/doi/10.1145/773153.773161},
        doi = {10.1145/773153.773161},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gupta, Ashish Kumar and Suciu, Dan and Halevy, Alon Y.},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,583 Efficient XML Data Dissemination with Piggybacking 2007 SIGMOD 5.2528121e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
236 Efficient Filtering of XML Documents for Selective Dissemination of Information 2000 VLDB 0.00023721569
738 Stream Processing of XPath Queries with Predicates 2003 SIGMOD 0.00014484337
Previous Page 1 / 1 Next

Semantically Similar Papers