Database Paper Browser

Back to papers

Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions

Summary: Progressive and Selective Merge: top-k with ad-hoc ranking functions. Index-merge over tree indices; double-heap for progressive search and generation; join-signature materialization prunes empty-states, enabling ~10x speed-up. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3844
Venue
SIGMOD
Year
2007
Pagerank
6.6343292e-05
Overall Rank
3,911 | 72.82%
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 11 of 11 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
7,966 Efficient Top-K Processing Over Query-Dependent Functions 2008 VLDB 4.6089395e-05
3,447 Towards Robust Indexing for Ranked Queries 2006 VLDB 7.082382e-05
5,845 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 5.3057391e-05
3,665 Ad-hoc Top-k Query Answering for Data Streams 2007 VLDB 6.8631567e-05
7,512 Ranking Large Temporal Data 2012 VLDB 4.7135369e-05
2,014 IO-Top-k: Index-access Optimized Top-k Query Processing 2006 VLDB 9.7982231e-05
4,178 Best Position Algorithms for Top-k Queries 2007 VLDB 6.3757762e-05
7,273 Efficient and Generic Evaluation of Ranked Queries 2011 SIGMOD 4.775366e-05
7,660 Processing Top-k Join Queries 2010 VLDB 4.6814547e-05
12,119 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1905499e-05