A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries

F Biermeier, B Feldkord, M Malatyali… - … and Online Algorithms …, 2018 - Springer
We consider the scenario of n sensor nodes observing streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

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

B Feldkord, M Malatyali… - … on the Occasion of His 60th …, 2018 - Springer
We consider a scenario where n sensor nodes observe streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

[PDF][PDF] Distributed Data Streams

J Castenow, B Feldkord, J Hanselle… - Algorithms for Big …, 2023 - library.oapen.org
We consider a scenario where a server is wirelessly connected to countless sensor nodes
that continuously measure data. The task of the server is to monitor the sensors' data. More …

[PDF][PDF] Big data: sublinear algorithms for distributed data streams.

M Malatyali - 2019 - digital.ub.uni-paderborn.de
We consider a sensor network comprised of numerous nodes which sense the environment
and are equipped with communication capabilities to convey this information to a server …

and Friedhelm Meyer auf der Heide Computer Science Department, Heinz Nixdorf Institute, Paderborn University, Paderborn, Germany {felixbm, bjoernf, malatya …

F Biermeier, B Feldkord… - Approximation and Online …, 2018 - books.google.com
We consider the scenario of n sensor nodes observing streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

[引用][C] On Practical Subversion-Resilience

P Bemmann - 2024 - Universitätsbibliothek