Database Paper Browser

Back to papers

On Efficient Top-k Query Processing in Highly Distributed Environments

Summary: SPEERTO applies skyline-based routing to top-k queries in large-scale peer-to-peer networks with horizontally distributed data across super-peers. A thresholding, progressive delivery scheme returns exact results while minimizing queried peers and data transfer; variants balance data volume and response time, scaling with dataset size and network heterogeneity, with simulations showing feasibility. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4030
Venue
SIGMOD
Year
2008
Pagerank
4.731326e-05
Overall Rank
7,435 | 48.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
3,904 Progressive Top-k Subarray Query Processing in Array Databases 2019 VLDB 6.6424961e-05
6,391 k-Hit Query: Top-k Query with Probabilistic Utility Function 2015 SIGMOD 5.0842079e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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