Approximate distributed top-\(k\) queries

DOI10.1007/s00446-008-0055-3zbMath1267.68313OpenAlexW2089419727MaRDI QIDQ2377247

Boaz Patt-Shamir, Allon Shafrir

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-008-0055-3

zbMATH Keywords

random samplingdistributed algorithmscommunication complexitysensor networksaggregate queries

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (3)

Randomized algorithms for tracking distributed count, frequencies, and ranks ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Optimal aggregation algorithms for middleware.
• Should Tables Be Sorted?
• An Optimal Algorithm for Monte Carlo Estimation
• Efficient top-K query calculation in distributed networks
• A note on efficient aggregate queries in sensor networks
• Algorithms - ESA 2003

This page was built for publication: Approximate distributed top-\(k\) queries