{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:03:21Z","timestamp":1743109401320,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819772407"},{"type":"electronic","value":"9789819772414"}],"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-7241-4_21","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"326-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["KTSketch: Finding k-Persistent t-Spread Flows in\u00a0High-Speed Networks"],"prefix":"10.1007","author":[{"given":"Shaolong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoju","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-e","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihuai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"21_CR1","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: ACM SIGCOMM (2016)","DOI":"10.1145\/2934872.2934906"},{"issue":"5","key":"21_CR2","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"},{"key":"21_CR3","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: ACM SIGKDD (2018)","DOI":"10.1145\/3219819.3219978"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Elastic Sketch: adaptive and fast network-wide measurements In: ACM SIGCOMM (2018)","DOI":"10.1145\/3230543.3230544"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Ting, D.: Data sketches for disaggregated subset sum and frequent item estimation. In: ACM SIGMOD (2018)","DOI":"10.1145\/3183713.3183759"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Yoon, M., Li, T., Chen, S., Peir, J.-K.: Fit a spread estimator in small memory. In: IEEE INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5061956"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Chen, S., Chen, M., Ling, Y.: Hyper-compact virtual estimators for big network data based on register sharing. In: ACM SIGMETRICS (2015)","DOI":"10.1145\/2745844.2745870"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TKDE.2020.2975625","volume":"34","author":"P Jia","year":"2020","unstructured":"Jia, P., et al.: Accurately estimating user cardinalities and detecting super spreaders over time. IEEE Trans. Knowl. Data Eng. 34(1), 92\u2013106 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1109\/TNET.2018.2865125","volume":"26","author":"H Dai","year":"2018","unstructured":"Dai, H., Shahzad, M., Liu, A.X., Li, M., Zhong, Y., Chen, G.: Identifying and estimating persistent items in data streams. IEEE\/ACM Trans. Networking 26(6), 2429\u20132442 (2018)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNET.2019.2946417","volume":"28","author":"H Dai","year":"2019","unstructured":"Dai, H., Li, M., Liu, A.X., Zheng, J., Chen, G.: Finding persistent items in distributed datasets. IEEE\/ACM Trans. Networking 28(1), 1\u201314 (2019)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14778\/3425879.3425884","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., et al.: On-off sketch: a fast and accurate sketch on persistence. Proc. VLDB Endowment 14(2), 128\u2013140 (2020)","journal-title":"Proc. VLDB Endowment"},{"key":"21_CR12","series-title":"Wireless Networks","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47340-6","volume-title":"Traffic Measurement for Big Network Data","author":"S Chen","year":"2017","unstructured":"Chen, S., Chen, M., Xiao, Q.: Traffic Measurement for Big Network Data. WN, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-47340-6"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1764873.1764877","volume":"40","author":"H Haddadi","year":"2010","unstructured":"Haddadi, H.: Fighting online click-fraud using bluff ads. ACM SIGCOMM Comput. Commun. Rev. 40(2), 21\u201325 (2010)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.cose.2014.05.011","volume":"45","author":"S Garc\u00eda","year":"2014","unstructured":"Garc\u00eda, S., Grill, M., Stiborek, J., Zunino, A.: An empirical comparison of botnet detection methods. Comput. Secur. 45, 100\u2013123 (2014). https:\/\/doi.org\/10.1016\/j.cose.2014.05.011","journal-title":"Comput. Secur."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K-Y Whang","year":"1990","unstructured":"Whang, K.-Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. 15(2), 208\u2013229 (1990)","journal-title":"ACM Trans. Database Syst."},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. Discrete Math. Theor. Comput. Sci. (2007). https:\/\/doi.org\/10.46298\/dmtcs.3545","DOI":"10.46298\/dmtcs.3545"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Fan, Z., et al.: Pisketch: finding persistent and infrequent flows. In: Proceedings of the ACM SIGCOMM Workshop on Formal Foundations and Security of Programmable Network Infrastructures (2022)","DOI":"10.1145\/3528082.3544834"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Qiao, Y., Zhen, M., Chen, S.: Estimating the persistent spreads in high-speed networks. In: IEEE ICNP (2014)","DOI":"10.1109\/ICNP.2014.33"},{"issue":"4","key":"21_CR19","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"},{"issue":"260","key":"21_CR20","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/01621459.1952.10483446","volume":"47","author":"DG Horvitz","year":"1952","unstructured":"Horvitz, D.G., Thompson, D.J.: A generalization of sampling without replacement from a finite universe. J. Am. Stat. Assoc. 47(260), 663\u2013685 (1952)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR21","unstructured":"Murmurhash. https:\/\/github.com\/aappleby\/smhasher\/"},{"key":"21_CR22","unstructured":"The CAIDA anonymized internet traces. https:\/\/www.caida.org\/catalog\/datasets\/"},{"key":"21_CR23","unstructured":"The network dataset internet traces. http:\/\/snap.stanford.edu\/data\/"},{"key":"21_CR24","unstructured":"The data center dataset. https:\/\/pages.cs.wisc.edu\/"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7241-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:20:36Z","timestamp":1724775636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7241-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772407","9789819772414"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7241-4_21","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":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}