{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T11:16:33Z","timestamp":1794482193953,"version":"4.9.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319098722","type":"print"},{"value":"9783319098739","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09873-9_23","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T02:04:21Z","timestamp":1407722661000},"page":"270-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Top-k Item Identification on Dynamic and Distributed Datasets"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Guerrieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Velegrakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Last.fm, \n                    \n                      http:\/\/www.lastfm.com"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proc. of STOC 1996, pp. 20\u201329. ACM (1996)","DOI":"10.1145\/237814.237823"},{"key":"23_CR3","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, Part I. LNCS, vol.\u00a05555, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"23_CR4","unstructured":"Arlitt, M., Jin, T.: 1998 World Cup web site access logs (August 1998), \n                    \n                      http:\/\/www.acm.org\/sigcomm\/ITA\/"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proc. of SIGMOD 2003, pp. 28\u201339 (2003)","DOI":"10.1145\/872757.872764"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: Proc. of PODC 2004, pp. 206\u2013215. ACM (2004)","DOI":"10.1145\/1011767.1011798"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theoretical Computer Science\u00a0312(1), 3\u201315 (2004)","journal-title":"Theoretical Computer Science"},{"key":"23_CR8","unstructured":"Chi, Y., Wang, H., Yu, P., Muntz, R.: Moment: Maintaining closed frequent itemsets over a stream sliding window. In: Proc. of ICDM 2004. IEEE (2004)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Cormode, G.: Continuous distributed monitoring: A short survey. In: Proc. of AlMoDEP 2011, pp. 1\u201310. ACM (2011)","DOI":"10.1145\/2031792.2031793"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.N.: Sketching probabilistic data streams. In: Proc. of SIGMOD 2007, pp. 281\u2013292 (2007)","DOI":"10.1145\/1247480.1247513"},{"issue":"2","key":"23_CR11","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 Transactions on Algorithms\u00a07(2), 21 (2011)","journal-title":"ACM Transactions on Algorithms"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Matias, Y.: Synopsis data structures for massive data sets. In: External Memory Algorithms, pp. 39\u201370. American Mathematical Society (1999)","DOI":"10.1090\/dimacs\/050\/02"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M. Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM TOCS\u00a023(3), 219\u2013252 (2005)","journal-title":"ACM TOCS"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. ACM TOCS\u00a025(3) (August 2007)","DOI":"10.1145\/1275517.1275520"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R. Karp","year":"2003","unstructured":"Karp, R., Shenker, S., Papadimitriou, C.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst.\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"12","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.jpdc.2010.07.006","volume":"70","author":"B. Lahiri","year":"2010","unstructured":"Lahiri, B., Tirthapura, S.: Identifying frequent items in a network using gossip. J. Parallel Distrib. Computing\u00a070(12), 1241\u20131253 (2010)","journal-title":"J. Parallel Distrib. Computing"},{"key":"23_CR17","unstructured":"Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (recently) frequent items in distributed data streams. In: Proc. of ICDE 2005. IEEE (2005)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: PeerSim: A scalable P2P simulator. In: Proc. of P2P 2009, pp. 99\u2013100 (September 2009)","DOI":"10.1109\/P2P.2009.5284506"},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00607-012-0220-1","volume":"95","author":"J. Sacha","year":"2013","unstructured":"Sacha, J., Montresor, A.: Identifying frequent items in distributed data sets. Computing\u00a095(4), 289\u2013307 (2013)","journal-title":"Computing"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Tirthapura, S., Woodruff, D.P.: Optimal random sampling from distributed streams revisited. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 283\u2013297. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_27"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09873-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:16:51Z","timestamp":1587327411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09873-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098722","9783319098739"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9_23","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}