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

DOI10.1007/978-3-319-98355-4_18zbMATH Open1514.68046OpenAlexW2886475386MaRDI QIDQ6163633FDOQ6163633

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

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?

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Data streams: algorithms and applications.
• Monitoring of domain-related problems in distributed data streams
• Algorithms for distributed functional monitoring
• Title not available (Why is that?)
• Optimal tracking of distributed heavy hitters and quantiles
• Shout echo selection in distributed files
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• Functional Monitoring without Monotonicity

Cited In (6)

• 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
• Title not available (Why is that?)
• Approximate distributed top-\(k\) queries
• Approximate Top-k Queries in Sensor Networks

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)