{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:10:10Z","timestamp":1751789410087,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983547"},{"type":"electronic","value":"9783319983554"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98355-4_18","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T10:34:57Z","timestamp":1533724497000},"page":"311-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Distributed Data Structure for Top-k and k-Select Queries"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Feldkord","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-02927-1_10","volume-title":"Automata, Languages and Programming","author":"C Arackaparambil","year":"2009","unstructured":"Arackaparambil, C., Brody, J., Chakrabarti, A.: Functional monitoring without monotonicity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 95\u2013106. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_10"},{"doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed Top-K monitoring. In: ACM SIGMOD International Conference on Management of Data, pp. 28\u201339. ACM (2003)","key":"18_CR2","DOI":"10.1145\/872757.872764"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-72050-0_13","volume-title":"Structural Information and Communication Complexity","author":"P Bemmann","year":"2017","unstructured":"Bemmann, P., et al.: Monitoring of domain-related problems in\u00a0distributed data streams. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 212\u2013226. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72050-0_13"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-89441-6_21","volume-title":"Approximation and Online Algorithms","author":"F Biermeier","year":"2018","unstructured":"Biermeier, F., Feldkord, B., Malatyali, M., Meyer auf der Heide, F.: A communication-efficient distributed data structure for Top-k and k-select queries. In: Solis-Oba, R., Fleischer, R. (eds.) WAOA 2017. LNCS, vol. 10787, pp. 285\u2013300. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_21"},{"doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Space-and time-efficient deterministic algorithms for biased quantiles over data streams. In: 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 263\u2013272. ACM (2006)","key":"18_CR5","DOI":"10.1145\/1142351.1142389"},{"doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Effective computation of biased quantiles over data streams. In: 21st International Conference on Data Engineering, pp. 20\u201331. IEEE (2005)","key":"18_CR6","DOI":"10.1109\/ICDE.2005.55"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1921659.1921667","volume":"7","author":"G Cormode","year":"2011","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. ACM Trans. Algorithms 7(2), 21 (2011)","journal-title":"ACM Trans. Algorithms"},{"unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1076\u20131085. Society for Industrial and Applied Mathematics (2008)","key":"18_CR8"},{"doi-asserted-by":"crossref","unstructured":"M\u00e4cker, A., Malatyali, M., Meyer auf der Heide, F.: Online Top-$$k$$-position monitoring of distributed data streams. In: 29th International Parallel and Distributed Processing Symposium, pp. 357\u2013364. IEEE (2015)","key":"18_CR9","DOI":"10.1109\/IPDPS.2015.40"},{"doi-asserted-by":"crossref","unstructured":"M\u00e4cker, A., Malatyali, M., Meyer auf der Heide, F.: On competitive algorithms for approximations of Top-$$k$$-position monitoring of distributed streams. In: 30th International Parallel and Distributed Processing Symposium, pp. 700\u2013709. IEEE (2016)","key":"18_CR10","DOI":"10.1109\/IPDPS.2016.91"},{"doi-asserted-by":"crossref","unstructured":"Madden, S., Franklin, M., Hellerstein, J., Hong, W.: The design of an acquisitional query processor for sensor networks. In: ACM SIGMOD International Conference on Management of Data, pp. 491\u2013502. ACM (2003)","key":"18_CR11","DOI":"10.1145\/872757.872817"},{"unstructured":"Marberg, J., Gafni, E.: An optimal shout-echo algorithm for selection in distributed sets. In: 23rd Allerton Conference on Communication, Control, and Computing (1985)","key":"18_CR12"},{"doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Now Publishers Inc. (2005)","key":"18_CR13","DOI":"10.1561\/9781933019604"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/net.3230160108","volume":"16","author":"D Rotem","year":"1986","unstructured":"Rotem, D., Santoro, N., Sidney, J.: Shout echo selection in distributed files. Networks 16(1), 77\u201386 (1986)","journal-title":"Networks"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s00453-011-9584-4","volume":"65","author":"K Yi","year":"2013","unstructured":"Yi, K., Zhang, Q.: Optimal tracking of distributed heavy hitters and quantiles. Algorithmica 65(1), 206\u2013223 (2013)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Zengfeng, H., Yi, K., Zhang, Q.: Randomized algorithms for tracking distributed count, frequencies, and ranks. In: 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 295\u2013306. ACM (2012)","key":"18_CR16","DOI":"10.1145\/2213556.2213596"}],"container-title":["Lecture Notes in Computer Science","Adventures Between Lower Bounds and Higher Altitudes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98355-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T07:38:18Z","timestamp":1751787498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98355-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983547","9783319983554"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98355-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}