{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:58:14Z","timestamp":1742929094863,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602444"},{"type":"electronic","value":"9783030602451"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60245-1_42","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T08:06:00Z","timestamp":1601453160000},"page":"614-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimized HybridSketch: More Efficient with Analysis and Algorithm"],"prefix":"10.1007","author":[{"given":"Xiaolei","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Mei","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Minjin","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Qun","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Chunyuan","family":"zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Huang, Q., Lee, P. P., Bao, Y.: Sketchlearn: relieving user burdens in approximate measurement with automated statistical inference. In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication (SIGCOMM \u201918). ACM, New York, NY, USA, pp. 576\u2013590. ACM (2018)","DOI":"10.1145\/3230543.3230559"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Huang, Q., et al.: SketchVisor: robust network measurement for software packet processing. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM \u201917). ACM, New York, NY, USA, pp. 113\u2013126. ACM (2017)","DOI":"10.1145\/3098822.3098831"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Elastic sketch: adaptive and fast network-wide measurements. In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication (SIGCOMM \u201918). ACM, New York, NY, USA, pp. 561\u2013575. ACM (2018)","DOI":"10.1145\/3230543.3230544"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Roy, P., Khan, A., Alonso, G.: Augmented sketch: faster and more accurate stream processing. In Proceedings of the 2016 International Conference on Management of Data (SIGMOD \u201916). ACM, New York, NY, USA, 1449\u20131463. ACM (2016)","DOI":"10.1145\/2882903.2882948"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Sivaraman, V., Narayana, S., Rottenstreich, O., Muthukrishnan, S., Rexford, J.: Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on SDN Research (SOSR \u201917). ACM, New York, NY, USA, 164\u2013176. ACM (2017)","DOI":"10.1145\/3050220.3063772"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Liu, Z., et al.: Nitrosketch: robust and general sketch-based monitoring in software switches. In Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM \u201919). Association for Computing Machinery, New York, NY, USA, pp. 334\u2013350. ACM (2019)","DOI":"10.1145\/3341302.3342076"},{"key":"42_CR7","unstructured":"Li, Y., Miao, R., Kim, C., Yu, M.: Flowradar: a better netflow for data centers. In Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI\u201916). USENIX Association, Berkeley, CA, USA, pp. 311\u2013324. ACM (2016.)"},{"issue":"1","key":"42_CR8","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":"42_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhu, H., Bao, N., Zhang, L.: Comparative analysis of different sketch methods in practical use. In 2018 Sixth International Conference on Advanced Cloud and Big Data (CBD), Lanzhou, pp. 124\u2013129 (2018)","DOI":"10.1109\/CBD.2018.00031"},{"issue":"12","key":"42_CR10","doi-asserted-by":"publisher","first-page":"2650","DOI":"10.1109\/TPDS.2019.2923772","volume":"30","author":"T Yang","year":"2019","unstructured":"Yang, T., Gao, S., Sun, Z., Wang, Y., Shen, Y., Li, X.: Diamond sketch: accurate per-flow measurement for big streaming data. IEEE Trans. Parallel Distrib. Syst. 30(12), 2650\u20132662 (2019)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Z., Manousis, A., Vorsanger, G., Sekar, V., Braverman, V.: One sketch to rule them all: rethinking network flow monitoring with univmon. In: Proceedings of the2016 ACM SIGCOMM Conference (SIGCOMM \u201916). ACM, New York, NY, USA, pp. 101\u2013114. ACM (2016)","DOI":"10.1145\/2934872.2934906"},{"issue":"5","key":"42_CR12","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TNET.2019.2933868","volume":"27","author":"T Yang","year":"2019","unstructured":"Yang, T., et al.: HeavyKeeper: an accurate algorithm for finding top-k elephant flows. IEEE\/ACM Trans. Netw. 27(5), 1845\u20131858 (2019)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"42_CR13","unstructured":"Caida Anonymized Internet Traces 2018 Dataset, (2019). \nhttp:\/\/www.caida.org\/data\/passive\/passive_dataset.xml"},{"key":"42_CR14","first-page":"1","volume":"2009","author":"M Canini","year":"2009","unstructured":"Canini, M., Fay, D., Miller, D.J., Moore, A.W., Bolla, R.: Per flow packet sampling for high-speed network monitoring: first international communication systems and networks and workshops. Bangalore 2009, 1\u201310 (2009)","journal-title":"Bangalore"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Kandula, S., Mahajan, R.: Sampling biases in network path measurements and what to do about it. In: Proceedings of the 9th ACM SIGCOMM conference on Internet measurement (IMC \u201909). ACM, New York, NY, USA, pp. 156\u2013169. ACM (2009)","DOI":"10.1145\/1644893.1644912"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Ben Basat, R., Einziger, G., Friedman, R., Luizelli, M.C., Waisbard, E.: Constant time updates in hierarchical heavy hitters. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM \u201917). ACM, New York, NY, USA, pp. 127\u2013140. ACM (2017)","DOI":"10.1145\/3098822.3098832"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A Metwally","year":"2004","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 398\u2013412. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30570-5_27"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on Very Large Data Bases (VLDB \u201902), VLDB Endowment, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"1","key":"42_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/1012888.1005709","volume":"32","author":"A Kumar","year":"2004","unstructured":"Kumar, A., Sung, M., Xu, J., Wang, J.: Data streaming algorithms for efficient and accurate estimation of flow size distribution. ACM SIGMETRICS Perform. Eval. Rev. 32(1), 177\u2013188 (2004)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Harvey, N.J., Nelson, J., Onak, K.: Sketching and streaming entropy via approximation theory. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 489\u2013498. IEEE (2008)","DOI":"10.1109\/FOCS.2008.76"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60245-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T08:38:43Z","timestamp":1601455123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60245-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602444","9783030602451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60245-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cloud-conf.net\/ica3pp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"495","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"305","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}