DBScholar

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
3905
Venue
SIGMOD
Year
2007
Pagerank
7.3597562e-05
Overall Rank
3,500 | 75.99%
DOI
10.1145/1247480.1247494

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{xin_sigmod07,
        title = {{Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions}},
        author = {Xin, Dong and Han, Jiawei and Chang, Kevin Chen-Chuan},
        series = {{SIGMOD} '07},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1247480.1247494},
        url = {https://dl.acm.org/doi/10.1145/1247480.1247494},
        year = {2007}
}

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