{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:40:09Z","timestamp":1744605609147,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031877650","type":"print"},{"value":"9783031877667","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-87766-7_20","type":"book-chapter","created":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:09:25Z","timestamp":1744603765000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mean Tail: Top-K and Frequency Estimation with\u00a0Fewer Counters and\u00a0More Keys"],"prefix":"10.1007","author":[{"given":"Dvir","family":"Biton","sequence":"first","affiliation":[]},{"given":"Roy","family":"Friedman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,15]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/TNET.2019.2918929","volume":"27","author":"R Ben Basat","year":"2019","unstructured":"Ben Basat, R., et al.: Randomized admission policy for efficient top-k, frequency, and volume estimation. IEEE\/ACM Trans. Netw. 27(4), 1432\u20131445 (2019)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR2","unstructured":"Biton, D.D.: MT Implementation (2024). https:\/\/github.com\/dbiton\/MeanTail"},{"issue":"1","key":"20_CR3","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.: A formal analysis of the count-min sketch with conservative updates. Theor. Comput. Sci. 312(1), 3\u201315 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR4","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. Theor. Comput. Sci. 312(1), 3\u201315 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"20_CR5","first-page":"1530","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. VLDB 1(2), 1530\u20131541 (2008)","journal-title":"VLDB"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00778-009-0172-z","volume":"19","author":"G Cormode","year":"2010","unstructured":"Cormode, G., Hadjieleftheriou, M.: Methods for finding frequent items in data streams. J. VLDB 19(1), 3\u201320 (2010)","journal-title":"J. VLDB"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., et\u00a0al.: Frequency estimation of internet packet streams with limited space. In: European Symposium on Algorithms (ESA), pp. 348\u2013360. Springer, Cham (2002)","DOI":"10.1007\/3-540-45749-6_33"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Ian Munro, J.: Frequency estimation of internet packet streams with limited space. In: EATCS ESA, pp. 348\u2013360 (2002)","DOI":"10.1007\/3-540-45749-6_33"},{"key":"20_CR10","unstructured":"Drepper, U.: What every programmer should know about memory, pp. 19\u201321, 32\u201333, 54\u201357. Red Hat, Inc. (2007)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"166292","DOI":"10.1109\/ACCESS.2019.2925030","volume":"7","author":"G Einziger","year":"2019","unstructured":"Einziger, G., Friedman, R.: Counting with TinyTable: every bit counts! IEEE Access 7, 166292\u2013166309 (2019)","journal-title":"IEEE Access"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting, vol.\u00a032. ACM (2002)","DOI":"10.1145\/510726.510749"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In: Proceedings of Conference on Analysis of Algorithms (AofA) (2007)","DOI":"10.46298\/dmtcs.3545"},{"key":"20_CR14","unstructured":"Hick, P.: CAIDA Anonymized Internet Trace, equinix-sanjose 2013-12-19 13:00-13:05 UTC, Direction B. (2014)"},{"key":"20_CR15","unstructured":"Hick, P.: CAIDA Anonymized Internet Trace, equinix-nyc, 2016. Dates used: Equinix NYC, 20190117-30400UTC"},{"key":"20_CR16","unstructured":"Li, S., Luo, L., Guo, D., Zhang, Q., Fu, P.: A survey of sketches in traffic measurement: design, optimization, application and implementation (2020)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Z.,\u00a0et\u00a0al.: One sketch to rule them all: rethinking network flow monitoring with univmon. In: Proceedings of 2016 ACM SIGCOMM (2016)","DOI":"10.1145\/2934872.2934906"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Luo, L., Guo, D., Rottenstreich, O., Ma, R.T.B., Luo, X., Ren, B.: The consistent cuckoo filter. In: IEEE Conference on Computer Communications (INFOCOM), pp. 712\u2013720 (2019)","DOI":"10.1109\/INFOCOM.2019.8737454"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Databases, pp. 346\u2013357. Elsevier (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El\u00a0Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory, pp. 398\u2013412. Springer, Cham (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Technical report (1982)","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Pandey, P., et\u00a0al.: A general-purpose counting filter: making every bit count. In: SIGMOD 2017, pp. 775\u2013787 (2017)","DOI":"10.1145\/3035918.3035963"},{"key":"20_CR24","unstructured":"Sekar, V.,\u00a0et\u00a0al.: Lads: large-scale automated DDoS detection system. In: USENIX ATEC, p.\u00a016 (2006)"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/00401706.1962.10490022","volume":"4","author":"BP Welford","year":"1962","unstructured":"Welford, B.P.: Note on a method for calculating corrected sums of squares and products. Technometrics 4, 419\u2013420 (1962)","journal-title":"Technometrics"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-87766-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:09:39Z","timestamp":1744603779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-87766-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031877650","9783031877667"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-87766-7_20","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"value":"2367-4512","type":"print"},{"value":"2367-4520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}