A Dynamic Distributed Data Structure for Top-k and k-Select Queries

DOI10.1007/978-3-319-98355-4_18MaRDI QIDQ6163633zbMATH OpenOpenAlexFDO

Authors Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide

Publication date 30 June 2023

Published in Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-98355-4_18

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Approximate Top-k Queries in Sensor Networks
• Approximate distributed top-\(k\) queries
• Efficient top-\(k\) query calculation in distributed networks
• How to Select the Top k Elements from Evolving Data?

Cites work

• scientific article; zbMATH DE number 5764835 (Why is no real title available?)
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Algorithms for distributed functional monitoring
• Data streams: algorithms and applications.
• Functional Monitoring without Monotonicity
• Monitoring of domain-related problems in distributed data streams
• Optimal tracking of distributed heavy hitters and quantiles
• Shout echo selection in distributed files

Cited in

(6)

• Approximate Top-k Queries in Sensor Networks
• A dynamic data structure for top-\(k\) queries on uncertain data
• Efficient top-\(k\) queries for orthogonal ranges
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Approximate distributed top-\(k\) queries
• scientific article; zbMATH DE number 2080920 (Why is no real title available?)

This page was built for publication: A Dynamic Distributed Data Structure for Top-k and k-Select Queries

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