Database Paper Browser

Back to papers

Branch-and-Bound Algorithm for Reverse Top-k Queries

Summary: Proposes a branch-and-bound algorithm for reverse top-k queries that avoids per-user top-k executions and full preference scans. Leverages pruning properties and optimizations; experiments show large gains over RTA on large preference collections. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4687
Venue
SIGMOD
Year
2013
Pagerank
5.7021328e-05
Overall Rank
5,095 | 64.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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

Overall Rank Paper Year Venue Pagerank
805 Evaluating Top-k Selection Queries 1999 VLDB 0.00016437265
2,933 Answering Top-k Queries Using Views 2006 VLDB 7.8679669e-05
7,135 Anytime Measures for Top-k Algorithms 2007 VLDB 4.8221884e-05
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05
7,276 Efficient and Generic Evaluation of Ranked Queries 2011 SIGMOD 4.7798595e-05
7,963 Efficient Top-K Processing Over Query-Dependent Functions 2008 VLDB 4.613363e-05
12,111 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1945683e-05
2,976 Processing a Large Number of Continuous Preference Top-k Queries 2012 SIGMOD 7.789303e-05
5,047 Identifying the Most Influential Data Objects with Reverse Top-k Queries 2010 VLDB 5.7379554e-05
6,222 Reverse k-Ranks Query 2014 VLDB 5.1503175e-05