Database Paper Browser

Back to papers

Ad-hoc Top-k Query Answering for Data Streams

Summary: Geometric arrangement representation enables ad-hoc top-k queries over data streams, not limited to pre-specified targets. Incremental maintenance plus pruning yields a main-memory index for streaming updates and fast ad-hoc evaluation, with experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9574
Venue
VLDB
Year
2007
Pagerank
6.8633354e-05
Overall Rank
3,665 | 74.51%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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

Overall Rank Paper Year Venue Pagerank
805 Evaluating Top-k Selection Queries 1999 VLDB 0.00016437265
2,976 Processing a Large Number of Continuous Preference Top-k Queries 2012 SIGMOD 7.789303e-05
12,111 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1945683e-05
2,933 Answering Top-k Queries Using Views 2006 VLDB 7.8679669e-05
7,963 Efficient Top-K Processing Over Query-Dependent Functions 2008 VLDB 4.613363e-05
7,276 Efficient and Generic Evaluation of Ranked Queries 2011 SIGMOD 4.7798595e-05
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05
3,807 Supporting Ad-hoc Ranking Aggregates 2006 SIGMOD 6.747576e-05
1,784 Continuous Monitoring of Top-k Queries over Sliding Windows 2006 SIGMOD 0.00010567363
4,080 Sliding-Window Top-k Queries on Uncertain Streams 2008 VLDB 6.4652983e-05