DBScholar

Back to papers

Efficient and Generic Evaluation of Ranked Queries

Summary: Introduces a novel general sequential access scheme for top-k query evaluation that reduces random I/O and outperforms prior methods; extends to subspace and dynamic data. Also analyzes ranking queries (the rank of a given object) with exact and two approximate solutions, validated by extensive experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h84b34c4ca3e1e394
Venue
SIGMOD
Year
2011
Pagerank
5.5370795e-05
Overall Rank
7,394 | 50.29%
DOI
10.1145/1989323.1989386

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jin_sigmod11,
        title = {{Efficient and Generic Evaluation of Ranked Queries}},
        author = {Jin, Wen and Patel, Jignesh M},
        series = {{SIGMOD} '11},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1989323.1989386},
        url = {https://dl.acm.org/doi/10.1145/1989323.1989386},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
3,338 On the Complexity of Query Result Diversification 2013 VLDB 7.4103278e-05
12,599 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.9793485e-05
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