{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:31:23Z","timestamp":1764937883139,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628292"},{"type":"electronic","value":"9789819628308"}],"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-981-96-2830-8_19","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T19:18:15Z","timestamp":1743362295000},"page":"243-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LightFinder: Finding Persistent Items with\u00a0Small Memory"],"prefix":"10.1007","author":[{"given":"Lu","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqiang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhe","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,29]]},"reference":[{"key":"19_CR1","unstructured":"The source codes of lightfinder and other related algorithms (2025). https:\/\/github.com\/doubleblind2025\/Light-Finder"},{"issue":"4","key":"19_CR2","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."},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TNET.2006.882836","volume":"14","author":"C Estan","year":"2006","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high-speed links. IEEE\/ACM Trans. Netw. 14(5), 925\u2013937 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Fan, Z., Hu, Z., Wu, Y., Guo, J., Liu, W., Yang, T.: PISketch: finding persistent and infrequent flows. In: ACM SIGCOMM, pp. 8\u201314 (2022)","DOI":"10.1145\/3528082.3544834"},{"issue":"12","key":"19_CR5","doi-asserted-by":"publisher","first-page":"12887","DOI":"10.1109\/TKDE.2023.3278028","volume":"35","author":"Z Fan","year":"2023","unstructured":"Fan, Z., Wang, R.: OneSketch: a generic and accurate sketch for data streams. IEEE Trans. Knowl. Data Eng. 35(12), 12887\u201312901 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"C","key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2019.107404","volume":"169","author":"F Gama","year":"2020","unstructured":"Gama, F., Marques, A.G., Mateos, G., Ribeiro, A.: Rethinking sketching as sampling: a graph signal processing approach. Signal Process. 169(C), 107404 (2020)","journal-title":"Signal Process."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: SIGMOD \u201901. Association for Computing Machinery, New York (2001)","DOI":"10.1145\/375663.375670"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/376284.375670","volume":"30","author":"M Greenwald","year":"2001","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. SIGMOD Rec. 30(2), 58\u201366 (2001)","journal-title":"SIGMOD Rec."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Chandrashekar, J., Taft, N.: How healthy are today\u2019s enterprise networks? In: Proceedings of the 8th ACM SIGCOMM Conference on Internet Measurement, IMC \u201908, p.\u00a06. Association for Computing Machinery (2008)","DOI":"10.1145\/1452520.1452538"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Huang, H., Yu, J., Du, Y., Liu, J.: Memory-efficient and flexible detection of heavy hitters in high-speed networks. In: ACM SIGMOD (2024)","DOI":"10.1145\/3617334"},{"key":"19_CR11","unstructured":"Center for Applied Internet Data Analysis: The CAIDA traces (2016). http:\/\/www.caida.org\/data\/overview\/"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Lahiri, B., Chandrashekar, J., Tirthapura, S.: Space-efficient tracking of persistent items in a massive data stream. In: DEBS. Association for Computing Machinery (2011)","DOI":"10.1145\/2002259.2002294"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Li, H., Chen, Q., Zhang, Y., Yang, T., Cui, B.: Stingy sketch: a sketch framework for accurate and fast frequency estimation. In: ACM VLDB (2022)","DOI":"10.14778\/3523210.3523220"},{"issue":"12","key":"19_CR14","doi-asserted-by":"publisher","first-page":"12987","DOI":"10.1109\/TKDE.2023.3273709","volume":"35","author":"M Li","year":"2023","unstructured":"Li, M., Chen, D., Dai, H., Xie, R.: Seesaw counting filter: a dynamic filtering framework for vulnerable negative keys. IEEE Trans. Knowl. Data Eng. 35(12), 12987\u201313001 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00778-022-00755-z","volume":"32","author":"M Li","year":"2023","unstructured":"Li, M., et al.: A pareto optimal bloom filter family with hash adaptivity. VLDB J. 32(3), 525\u2013548 (2023)","journal-title":"VLDB J."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Li, W., Patras, P.: Tight-sketch: a high-performance sketch for heavy item-oriented data stream mining with limited memory size. In: ACM CIKM (2023)","DOI":"10.1145\/3583780.3615080"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Santos, A., Bessa, A., Musco, C., Freire, J.: A sketch-based index for correlated dataset search. In: ICDE, pp. 2928\u20132941 (2022)","DOI":"10.1109\/ICDE53745.2022.00264"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1109\/TNET.2022.3232098","volume":"31","author":"Q Shi","year":"2023","unstructured":"Shi, Q., Xu, Y., Qi, J., Li, W., Yang, T.: Cuckoo counter: adaptive structure of counters for accurate frequency and top-k estimation. IEEE\/ACM Trans. Netw. 31(4), 1854\u20131869 (2023)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551\u20132567 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.874390","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Ting, D.: Count-min: optimal estimation and tight error bounds using empirical error distributions. In: ACM SIGKDD, pp. 2319\u20132328 (2018)","DOI":"10.1145\/3219819.3219975"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: Bamboo filters: make resizing smooth. In: IEEE ICDE (2022)","DOI":"10.1109\/ICDE53745.2022.00078"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Wang, L., Luo, G., Yi, K., Cormode, G.: Quantiles over data streams: an experimental study. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201913, p.\u00a012. Association for Computing Machinery (2013)","DOI":"10.1145\/2463676.2465312"},{"issue":"3","key":"19_CR23","first-page":"391","volume":"32","author":"Z Xiaohuan","year":"2015","unstructured":"Xiaohuan, Z., Minghui, L.: Large flow identification based on counting bloom filter and space saving. J. Univ. Chin. Acad. Sci. 32(3), 391 (2015)","journal-title":"J. Univ. Chin. Acad. Sci."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Yang, T., Gong, J.: HeavyGuardian: separate and guard hot items in data streams. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201918), pp. 2584\u20132593. ACM, New York (2018)","DOI":"10.1145\/3219819.3219978"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Yang, T., Zhang, H., Yang, D.: Finding significant items in data streams, pp. 1394\u20131405 (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00126","DOI":"10.1109\/ICDE.2019.00126"},{"issue":"11","key":"19_CR26","doi-asserted-by":"publisher","first-page":"2372","DOI":"10.14778\/3425879.3425884","volume":"13","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Li, J., Lei, Y.: On-off sketch: a fast and accurate sketch on persistence. Proc. VLDB Endow. 13(11), 2372\u20132385 (2020). https:\/\/doi.org\/10.14778\/3425879.3425884","journal-title":"Proc. VLDB Endow."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Han, W., Zhong, Z., Zhang, Y., Yang, T., Cui, B.: Double-anonymous sketch: achieving top-k-fairness for finding global top-k frequent items. In: ACM SIGMOD (2023)","DOI":"10.1145\/3588933"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2830-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T09:38:18Z","timestamp":1757151498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2830-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628292","9789819628308"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2830-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Network and Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","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":"7 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","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":"npc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}