Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval

Summary: Skip-and-Prune (SnP): top-k for cosine-based, non-monotonic scoring in context-aware retrieval. SnP matches inverted-file/full-scan precision, yet is orders of magnitude faster than naive top-k or accumulator-based approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4175
Venue: SIGMOD
Year: 2009
Pagerank: 5.093636e-05
Overall Rank: 12,494 | 14.28%
DOI: 10.1145/1559845.1559859

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Jong Wook Kim (Arizona State University)
2. K. Selçuk Candan (Arizona State University)

BibTeX Citation

@inproceedings{kim_sigmod09,
        title = {{Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval}},
        author = {Kim, Jong Wook and Candan, K. Selçuk},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559859},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559859},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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
243	Efficient Progressive Skyline Computation	2001	VLDB	0.00023495903
399	XSEarch: A Semantic Search Engine for XML	2003	VLDB	0.00019177959
509	Supporting Top-k Join Queries in Relational Databases	2003	VLDB	0.00017220967
1,519	Top-k Query Evaluation with Probabilistic Guarantees	2004	VLDB	0.00010513777
1,689	EntityRank: Searching Entities Directly and Holistically	2007	VLDB	0.00010003102
6,175	Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies	2008	SIGMOD	5.9508648e-05
6,374	Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation	2006	SIGMOD	5.8945632e-05
7,185	Anytime Measures for Top-k Algorithms	2007	VLDB	5.6779179e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,331	Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions	2012	VLDB
2	6,832	A Scalable Index for Top-k Subtree Similarity Queries	2019	SIGMOD
3	2,948	Optimized Query Execution in Large Search Engines with Global Page Ordering	2003	VLDB
4	1,519	Top-k Query Evaluation with Probabilistic Guarantees	2004	VLDB
5	1,967	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB
6	12,308	Optimal Top-k Generation of Attribute Combinations based on Ranked Lists	2012	SIGMOD
7	3,209	An Efficient and Versatile Query Engine for TopX Search	2005	VLDB
8	7,299	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
9	9,484	Context-sensitive Ranking for Document Retrieval	2011	SIGMOD
10	8,281	Efficient Top-K Processing Over Query-Dependent Functions	2008	VLDB