DBScholar

Back to papers

Covering Indexes for XML Queries: Bisimulation - Simulation = Negation

Summary: Shows simulation quotients are the smallest covering indexes for BPQ+ and TPQ, while bisimulation is required for unrestricted BPQ. Hence “bisimulation − simulation = negation”: excluding negation can yield exponentially smaller XML indexes. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
hd1ba528a112bf32e
Venue
VLDB
Year
2003
Pagerank
5.4111901e-05
Overall Rank
7,995 | 46.25%
DOI
10.1016/B978-012722442-8/50023-9

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{ramanan_vldb03,
        title = {{Covering Indexes for XML Queries: Bisimulation - Simulation = Negation}},
        author = {Ramanan, Prakash},
        journal = {PVLDB},
        series = {{VLDB} '03},
        doi = {10.1016/B978-012722442-8/50023-9},
        url = {https://doi.org/10.1016/B978-012722442-8/50023-9},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,339 Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs 2007 VLDB 5.5490881e-05
12,974 Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document 2006 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
679 Efficient Algorithms for Processing XPath Queries 2002 VLDB 0.00014837097
740 Covering Indexes for Branching Path Queries 2002 SIGMOD 0.00014325275
1,096 Minimization of Tree Pattern Queries 2001 SIGMOD 0.00012050482
2,733 Efficient Algorithms for Minimizing Tree Pattern Queries 2002 SIGMOD 8.0819e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 12,824 Efficient Rewriting of XPath Queries Using Query Set Specifications 2009 VLDB
2 9,862 Answering Tree Pattern Queries Using Views 2006 VLDB
3 12,767 XPath Whole Query Optimization 2010 VLDB
4 6,133 Minimization of Tree Pattern Queries with Constraints 2008 SIGMOD
5 1,599 Conjunctive Queries over Trees 2004 PODS
6 4,066 Rewriting XPath Queries Using Materialized Views 2005 VLDB
7 4,636 On Testing Satisfiability of Tree Pattern Queries 2004 VLDB
8 2,525 Path Queries on Compressed XML 2003 VLDB
9 2,881 On the minimization of XPath queries 2003 VLDB
10 740 Covering Indexes for Branching Path Queries 2002 SIGMOD