Database Paper Browser

Back to papers

Efficient Top-K Processing Over Query-Dependent Functions

Summary: Top-k processing for data where item scores are computed by item-specific functions with a query-time parameter. Introduces a workload-aware, interval-based parameter compression that bounds scores and prunes candidates, avoiding per-item evaluation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9736
Venue
VLDB
Year
2008
Pagerank
4.6089395e-05
Overall Rank
7,966 | 44.64%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,279 Database-support for Continuous Prediction Queries over Streaming Data 2010 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers