Database Paper Browser

Back to papers

Towards Robust Indexing for Ranked Queries

Summary: Introduces sequentially layered indexing for robust top-k query answering under arbitrary linear rankings. Robustness minimizes top-k tuple counts for all k; provides a necessary and sufficient condition, an exact O(n^d log n) construction, and an efficient O(2^d n (log n)^{r(d)-1}) approximation with experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9440
Venue
VLDB
Year
2006
Pagerank
7.082382e-05
Overall Rank
3,447 | 76.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank Citing Paper Year Venue Pagerank
1,202 SPARK: Top-k Keyword Query in Relational Databases 2007 SIGMOD 0.0001333126
3,100 Answering Why-not Questions on Reverse Top-k Queries 2015 VLDB 7.5625111e-05
5,074 Branch-and-Bound Algorithm for Reverse Top-k Queries 2013 SIGMOD 5.7113169e-05
5,113 Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative 2017 SIGMOD 5.6827696e-05
5,839 Why Not Yet: Fixing a Top-k Ranking that Is Not Fair to Individuals 2023 VLDB 5.3073497e-05
6,219 Reverse k-Ranks Query 2014 VLDB 5.1458862e-05
6,804 RRR: Rank-Regret Representative 2019 SIGMOD 4.917138e-05
7,273 Efficient and Generic Evaluation of Ranked Queries 2011 SIGMOD 4.775366e-05
11,197 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 4.1905499e-05
11,660 Top-k Queries over Digital Traces 2019 SIGMOD 4.1905499e-05
11,891 Query Reranking As A Service 2016 VLDB 4.1905499e-05
12,143 Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions 2012 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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