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: 4478
Venue: SIGMOD
Year: 2011
Pagerank: 5.6513289e-05
Overall Rank: 7,299 | 49.93%
DOI: 10.1145/1989323.1989386

Incoming Non-self Citations Over Time

Authors

1. Wen Jin (Independent)
2. Jignesh M Patel (University of Wisconsin)

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,596	On the Complexity of Query Result Diversification	2013	VLDB	7.2722683e-05
12,308	Optimal Top-k Generation of Attribute Combinations based on Ranked Lists	2012	SIGMOD	5.093636e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010828372
108	Optimizing Multi-Feature Queries for Image Databases	2000	VLDB	0.00033228866
333	The Onion Technique: Indexing for Linear Optimization Queries	2000	SIGMOD	0.0002089582
499	Supporting Incremental Join Queries on Ranked Inputs	2001	VLDB	0.00017431827
827	Minimal Probing: Supporting Expensive Predicates for Top-k Queries	2002	SIGMOD	0.00013769938
1,759	Rank-aware Query Optimization	2004	SIGMOD	9.8160244e-05
1,967	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB	9.3804693e-05
2,525	Answering Top-k Queries Using Views	2006	VLDB	8.4653166e-05
3,007	Towards Robust Indexing for Ranked Queries	2006	VLDB	7.8583548e-05
3,702	Best Position Algorithms for Top-k Queries	2007	VLDB	7.1838636e-05
6,175	Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies	2008	SIGMOD	5.9508648e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,550	Processing Top-k Join Queries	2010	VLDB
2	12,308	Optimal Top-k Generation of Attribute Combinations based on Ranked Lists	2012	SIGMOD
3	3,317	Ad-hoc Top-k Query Answering for Data Streams	2007	VLDB
4	2,525	Answering Top-k Queries Using Views	2006	VLDB
5	3,007	Towards Robust Indexing for Ranked Queries	2006	VLDB
6	4,587	Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach	2006	VLDB
7	2,427	Processing a Large Number of Continuous Preference Top-k Queries	2012	SIGMOD
8	635	Evaluating Top-k Selection Queries	1999	VLDB
9	1,967	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB
10	8,281	Efficient Top-K Processing Over Query-Dependent Functions	2008	VLDB