Efficient top-K query calculation in distributed networks
From MaRDI portal
Publication:5501500
DOI10.1145/1011767.1011798zbMath1321.68215OpenAlexW2116400826MaRDI QIDQ5501500
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011798
Database theory (68P15) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Distributed systems (68M14)
Related Items
A filter-based uniform algorithm for optimizing top-k query in distributed networks, Approximate distributed top-\(k\) queries, Survey of DHT topology construction techniques in virtual computing environments, Top-\(k\) vectorial aggregation queries in a distributed environment, Identifying frequent items in distributed data sets, Identifying frequent items in a network using gossip, Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy, Unnamed Item