{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:55:59Z","timestamp":1758268559866,"version":"3.40.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T00:00:00Z","timestamp":1352937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00607-012-0220-1","type":"journal-article","created":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T05:33:27Z","timestamp":1352871207000},"page":"289-307","source":"Crossref","is-referenced-by-count":8,"title":["Identifying frequent items in distributed data sets"],"prefix":"10.1007","volume":"95","author":[{"given":"Jan","family":"Sacha","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,15]]},"reference":[{"key":"220_CR1","unstructured":"Arlitt M, Jin T (1998) World Cup web site access logs. Available at http:\/\/www.acm.org\/sigcomm\/ITA\/"},{"key":"220_CR2","doi-asserted-by":"crossref","unstructured":"Babcock B, Olston C (2003) Distributed top- $$k$$ monitoring. In: Proceedings of the international conference on management of data (SIGMOD\u201903), pp 28\u201339. ACM, San Diego","DOI":"10.1145\/872757.872764"},{"key":"220_CR3","doi-asserted-by":"crossref","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations. In: Proceedings of the 38th ACM symposium on theory of computing (STOC\u201998), pp 327\u2013336. ACM, Dallas","DOI":"10.1145\/276698.276781"},{"key":"220_CR4","doi-asserted-by":"crossref","unstructured":"Cao P, Wang Z (2004) Efficient top- $$k$$ query calculation in distributed networks. In: Proceedings of the 23rd symposium on principles of distributed computing (PODC\u201904), pp 206\u2013215. ACM, St. John\u2019s","DOI":"10.1145\/1011767.1011798"},{"issue":"1","key":"220_CR5","doi-asserted-by":"crossref","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 (2004) Finding frequent items in data streams. Theor Comput Sci 312(1):3\u201315","journal-title":"Theor Comput Sci"},{"key":"220_CR6","doi-asserted-by":"crossref","unstructured":"Cormode G (2011) Continuous distributed monitoring: a short survey. In: Proc. of the 1st international workshop on algorithms and models for distributed event processing (AlMoDEP\u201911), pp 1\u201310. ACM, Rome","DOI":"10.1145\/2031792.2031793"},{"key":"220_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1090\/dimacs\/050\/02","volume-title":"External memory algorithms","author":"PB Gibbons","year":"1999","unstructured":"Gibbons PB, Matias Y (1999) Synopsis data structures for massive data sets. In: Abello JM, Vitter JS (eds) External memory algorithms. American Mathematical Society, Boston, pp 39\u201370"},{"key":"220_CR8","doi-asserted-by":"crossref","unstructured":"Golab L, DeHaan D, Demaine ED, Lopez-Ortiz A, Munro JI (2003) Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of the 3rd ACM SIGCOMM conference on internet measurement (IMC\u201903), pp 173\u2013178. ACM, Miami Beach","DOI":"10.1145\/948224.948227"},{"issue":"3","key":"220_CR9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity M, Montresor A, Babaoglu O (2005) Gossip-based aggregation in large dynamic networks. ACM TOCS 23(3):219\u2013252","journal-title":"ACM TOCS"},{"key":"220_CR10","doi-asserted-by":"crossref","unstructured":"Jelasity M, Voulgaris S, Guerraoui R, Kermarrec A-M, van Steen M (2007) Gossip-based peer sampling. ACM TOCS 25(3)","DOI":"10.1145\/1275517.1275520"},{"key":"220_CR11","doi-asserted-by":"crossref","unstructured":"Jin C, Qian W, Sha C, Yu JX, Zhou A (2003) Dynamically maintaining frequent items over a data stream. In: Proceedings of the 12th international conference on information and knowledge management (CIKM\u201903), pp 287\u2013294. ACM, New Orleans","DOI":"10.1145\/956915.956918"},{"key":"220_CR12","doi-asserted-by":"crossref","unstructured":"Lahiri B, Tirthapura S (2010) Identifying frequent items in a network using gossip. J Parallel Distrib Comput 70(12):1241\u20131253","DOI":"10.1016\/j.jpdc.2010.07.006"},{"key":"220_CR13","doi-asserted-by":"crossref","unstructured":"Li M, Lee W-C (2008) Identifying frequent items in P2P systems. In: Proceedings of the 28th international conference on distributed computing systems (ICDCS\u201908), pp 36\u201344. IEEE","DOI":"10.1109\/ICDCS.2008.78"},{"key":"220_CR14","doi-asserted-by":"crossref","unstructured":"Manjhi A, Shkapenyuk V, Dhamdhere K, Olston C (2005) Finding (recently) frequent items in distributed data streams. In: Proc. of the 21st international conference on data engineering (ICDE\u201905), pp 767\u2013778. IEEE","DOI":"10.1109\/ICDE.2005.68"},{"key":"220_CR15","doi-asserted-by":"crossref","unstructured":"Montresor A, Jelasity M (2009) PeerSim: a scalable P2P simulator. In Proceedings of the 9th international conference on peer-to-peer (P2P\u201909), pp 99\u2013100, Seattle","DOI":"10.1109\/P2P.2009.5284506"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Raab M, Steger A (1998) \u201cBalls into bins\u201d \u2014 a simple and tight analysis. In: Randomization and approximation techniques in computer science. Lecture notes in computer science, vol 1518, pp 159\u2013170. Springer","DOI":"10.1007\/3-540-49543-6_13"},{"key":"220_CR17","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement (IMC\u201906), pp 189\u2013202. ACM, Rio de Janeriro","DOI":"10.1145\/1177080.1177105"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0220-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0220-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0220-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T21:13:07Z","timestamp":1745183587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0220-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,15]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0220-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2012,11,15]]}}}