A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries-Reference-Cited by-同舟云学术

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

Published:2018 Issue: Volume: Page:285-300
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

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

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89441-6_21

Reference19 articles.

1. Lecture Notes in Computer Science;C Arackaparambil,2009

2. Babcock, B., Olston, C.: Distributed Top-K monitoring. In: International Conference on Management of Data, pp. 28–39. ACM (2003)

3. Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J., Sundermeier, J.: Monitoring of domain-related problems in distributed data streams. In: 24th International Colloquium on Structural Information and Communication Complexity (to appear)

4. Biermeier, F., Feldkord, B., Malatyali, M., Meyer auf der Heide, F.: A communication-efficient distributed data structure for top-k and k-select queries. arXiv preprint arXiv:1709.07259 (2017)

5. Canetti, R., Even, G., Goldreich, O.: Lower bounds for sampling algorithms for estimating the average. Inf. Process. Lett. 53(1), 17–25 (1995)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Dynamic Distributed Data Structure for Top-k and k-Select Queries;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018

2. A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries;Approximation and Online Algorithms;2018