{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:10Z","timestamp":1742914030452,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708109"},{"type":"electronic","value":"9789819708116"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0811-6_2","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T17:02:24Z","timestamp":1708966944000},"page":"19-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Persistent Sketch: A Memory-Efficient and\u00a0Robust Algorithm for\u00a0Finding Top-k Persistent Flows"],"prefix":"10.1007","author":[{"given":"Ziqi","family":"Sun","sequence":"first","affiliation":[]},{"given":"Yu-E","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Du","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"He","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Lahiri, B., Chandrashekar, J., Tirthapura, S.: Space-efficient tracking of persistent items in a massive data stream. In: Proceedings of the 5th ACM International Conference on Distributed Event-Based System, pp. 255\u2013266 (2011)","DOI":"10.1145\/2002259.2002294"},{"issue":"1","key":"2_CR2","first-page":"99","volume":"15","author":"R Oentaryo","year":"2014","unstructured":"Oentaryo, R., et al.: Detecting click fraud in online advertising: a data mining approach. J. Mach. Learn. Res. 15(1), 99\u2013140 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Zhu, T., Meng, Y., Hu, H., Zhang, X., Xue, M., Zhu, H.: Dissecting click fraud autonomy in the wild. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, New York, NY, USA, pp. 271\u2013286 (2021)","DOI":"10.1145\/3460120.3484546"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Qiao, Y., Zhen, M., Chen, S.: Estimating the persistent spreads in high-speed networks. In: 2014 IEEE 22nd International Conference on Network Protocols, pp. 131\u2013142 (2014)","DOI":"10.1109\/ICNP.2014.33"},{"key":"2_CR5","first-page":"1","volume":"20","author":"Z Xu","year":"2022","unstructured":"Xu, Z., Wang, X., Zhang, Y.: Towards persistent detection of DDoS attacks in NDN: a sketch-based approach. IEEE Trans. Dependable Secure Comput. 20, 1\u201317 (2022)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/3143314.3078593","volume":"45","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Zhou, Y., Chen, M., Chen, S.: Persistent spread measurement for big network data based on register intersection. SIGMETRICS Perform. Eval. Rev. 45(1), 67 (2017)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Javed, M., Paxson, V.: Detecting stealthy, distributed SSH brute-forcing. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, New York, NY, USA, pp. 85\u201396 (2013)","DOI":"10.1145\/2508859.2516719"},{"issue":"4","key":"2_CR8","first-page":"50","volume":"4","author":"I Ghafir","year":"2014","unstructured":"Ghafir, I., P\u0159enosil, V.: Advanced persistent threat attack detection: an overview. Int. J. Adv. Comput. Netw. Secur. 4(4), 50\u201354 (2014)","journal-title":"Int. J. Adv. Comput. Netw. Secur."},{"issue":"10","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/TKDE.2018.2873319","volume":"31","author":"P Wang","year":"2019","unstructured":"Wang, P., Jia, P., Tao, J., Guan, X.: Detecting a variety of long-term stealthy user behaviors on high speed links. IEEE Trans. Knowl. Data Eng. 31(10), 1912\u20131925 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/MSP.2018.1331034","volume":"16","author":"M Albanese","year":"2018","unstructured":"Albanese, M., Jajodia, S., Venkatesan, S.: Defending from stealthy botnets using moving target defenses. IEEE Secur. Priv. 16(1), 92\u201397 (2018)","journal-title":"IEEE Secur. Priv."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1109\/COMST.2019.2891891","volume":"21","author":"A Alshamrani","year":"2019","unstructured":"Alshamrani, A., Myneni, S., Chowdhary, A., Huang, D.: A survey on advanced persistent threats: techniques, solutions, challenges, and research opportunities. IEEE Commun. Surv. Tutor. 21(2), 1851\u20131877 (2019)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Zhong, Z., Yan, S., Li, Z., Tan, D., Yang, T., Cui, B.: BurstSketch: finding bursts in data streams. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2375\u20132383 (2021)","DOI":"10.1145\/3448016.3452775"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Chen, L., Phan, R.C.W., Chen, Z., Huang, D.: Persistent items tracking in large data streams based on adaptive sampling. In: IEEE Conference on Computer Communications, pp. 1948\u20131957 (2022)","DOI":"10.1109\/INFOCOM48880.2022.9796709"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.14778\/3025111.3025112","volume":"10","author":"H Dai","year":"2016","unstructured":"Dai, H., Shahzad, M., Liu, A.X., Zhong, Y.: Finding persistent items in data streams. Proc. VLDB Endow. 10(4), 289\u2013300 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et al.: On-off sketch: a fast and accurate sketch on persistence. In: Proceedings of the VLDB Endowment, vol. 14, pp. 128\u2013140 (2020)","DOI":"10.14778\/3425879.3425884"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Du, Y., et al.: Short-term memory sampling for spread measurement in high-speed networks. In: IEEE Conference on Computer Communications, pp. 470\u2013479 (2022)","DOI":"10.1109\/INFOCOM48880.2022.9796702"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/TNET.2022.3212066","volume":"31","author":"Y Du","year":"2023","unstructured":"Du, Y., Huang, H., Sun, Y.E., Chen, S., Gao, G., Wu, X.: Self-adaptive sampling based per-flow traffic measurement. IEEE\/ACM Trans. Netw. 31(3), 1010\u20131025 (2023)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Sun, Y.E., Huang, H., Ma, C., Chen, S., Du, Y., Xiao, Q.: Online spread estimation with non-duplicate sampling. In: IEEE Conference on Computer Communications, pp. 2440\u20132448 (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155525"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.1109\/TNET.2021.3078725","volume":"29","author":"H Huang","year":"2021","unstructured":"Huang, H., et al.: Spread estimation with non-duplicate sampling in high-speed networks. IEEE\/ACM Trans. Networking 29(5), 2073\u20132086 (2021)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1109\/TNET.2020.2982003","volume":"28","author":"H Huang","year":"2020","unstructured":"Huang, H., et al.: An efficient k-persistent spread estimator for traffic measurement in high-speed networks. IEEE\/ACM Trans. Networking 28(4), 1463\u20131476 (2020)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, Y., et al.: Cold filter: a meta-framework for faster and more accurate stream processing. In: Proceedings of the 2018 International Conference on Management of Data, pp. 741\u2013756 (2018)","DOI":"10.1145\/3183713.3183726"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, B., Li, X., Tian, B., Mei, Z., Wu, W.: DHS: adaptive memory layout organization of sketch slots for fast and accurate data stream processing. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 2285\u20132293 (2021)","DOI":"10.1145\/3447548.3467353"},{"issue":"5","key":"2_CR23","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. Networking 27(5), 1845\u20131858 (2019)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Yang, T., Gong, J., Zhang, H., Zou, L., Shi, L., Li, X.: HeavyGuardian: separate and guard hot items in data streams. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2584\u20132593 (2018)","DOI":"10.1145\/3219819.3219978"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Ting, D.: Data sketches for disaggregated subset sum and frequent item estimation. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1129\u20131140 (2018)","DOI":"10.1145\/3183713.3183759"},{"issue":"7","key":"2_CR26","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"2_CR27","unstructured":"CAIDA: Anonymized Internet Traces 2016. https:\/\/catalog.caida.org\/dataset\/passive_2016_pcap. Accessed 20 June 2022"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Powers, D.M.W.: Applications and Explanations of Zipf\u2019s Law. In: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning, pp. 151\u2013160 (1998)","DOI":"10.3115\/1603899.1603924"},{"key":"2_CR29","unstructured":"Appleby, A.: Murmurhash. https:\/\/sites.google.com\/site\/murmurhash\/. Accessed 9 June 2022"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0811-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T17:02:44Z","timestamp":1708966964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0811-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708109","9789819708116"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0811-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","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":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","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":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","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":"145","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":"0","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":"33% - 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":"3","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}