Approximate Top-k Queries in Sensor Networks

DOI10.1007/11780823_25MaRDI QIDQ3613661zbMATH OpenOpenAlexFDO

Authors Boaz Patt-Shamir, Allon Shafrir

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_25

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Approximate distributed top-\(k\) queries
• A Dynamic Distributed Data Structure for Top-k and k-Select Queries
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Efficient top-k query calculation in distributed networks
• Research on the approximate algorithm of top-k query based on weighted sampling in wireless sensor network

Cited in

(7)

• A filter-based uniform algorithm for optimizing top-k query in distributed networks
• Efficient top-k query calculation in distributed networks
• A Dynamic Distributed Data Structure for Top-k and k-Select Queries
• A note on efficient aggregate queries in sensor networks
• Processing top-k queries from samples
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Research on the approximate algorithm of top-k query based on weighted sampling in wireless sensor network

This page was built for publication: Approximate Top-k Queries in Sensor Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613661)