{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:51:40Z","timestamp":1749271900341,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708079"},{"type":"electronic","value":"9789819708086"}],"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-0808-6_25","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:02:20Z","timestamp":1708963340000},"page":"428-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Popularity Cuckoo Filter: Always Keeping Popular Items in Mind"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8130-4835","authenticated-orcid":false,"given":"Xuetan","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4886-9974","authenticated-orcid":false,"given":"Lailong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangrui","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-5540","authenticated-orcid":false,"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"25_CR1","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, 422\u2013426 (1970). https:\/\/doi.org\/10.1145\/362686.362692","journal-title":"Commun. ACM"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003). New York (2003). https:\/\/doi.org\/10.1145\/872757.872787","DOI":"10.1145\/872757.872787"},{"key":"25_CR3","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area Web cache sharing protocol. IEEE\/ACM Trans. Netw. 8, 281\u2013293 (2000). https:\/\/doi.org\/10.1109\/90.851975","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Kumar, A., Xu, J., Zegara, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (2005). https:\/\/doi.org\/10.1109\/infcom.2005.1498343","DOI":"10.1109\/infcom.2005.1498343"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Mitzenmacher, M.: Compressed bloom filters. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), New York (2001). https:\/\/doi.org\/10.1145\/383962.384004","DOI":"10.1145\/383962.384004"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Rhea, S.C., Kubiatowicz, J.: Probabilistic location and routing. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (2002). https:\/\/doi.org\/10.1109\/infcom.2002.1019375","DOI":"10.1109\/infcom.2002.1019375"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bruck, J., Jie, G., Anxiao, J.: Weighted bloom filter. In: 2006 IEEE International Symposium on Information Theory. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261978"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/jsac.2005.843561","volume":"23","author":"F Ye","year":"2005","unstructured":"Ye, F., Luo, H., Lu, S., Zhang, L.: Statistical en-route filtering of injected false data in sensor networks. IEEE J. Select. Areas Commun. 23, 839\u2013850 (2005). https:\/\/doi.org\/10.1109\/jsac.2005.843561","journal-title":"IEEE J. Select. Areas Commun."},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: Presented at the An Improved Construction for Counting Bloom Filters (2006). https:\/\/doi.org\/10.1007\/11841036_61","DOI":"10.1007\/11841036_61"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Bender, M.A., et al.: Don\u2019t thrash. Proc. VLDB Endow 5, 1627\u20131637 (2012). https:\/\/doi.org\/10.14778\/2350229.2350275","DOI":"10.14778\/2350229.2350275"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1007\/s00521-019-04397-1","volume":"32","author":"D Kleyko","year":"2019","unstructured":"Kleyko, D., Rahimi, A., Gayler, R.W., Osipov, E.: Autoscaling Bloom filter: controlling trade-off between true and false positives. Neural Comput. Appl. 32, 3675\u20133684 (2019). https:\/\/doi.org\/10.1007\/s00521-019-04397-1","journal-title":"Neural Comput. Appl."},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, New York (2014). https:\/\/doi.org\/10.1145\/2674005.2674994","DOI":"10.1145\/2674005.2674994"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51, 122\u2013144 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2003.12.002","journal-title":"J. Algorithms"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 1999), Conference on Computer Communications. The Future is Now (Cat. No. 99CH36320) (1999). https:\/\/doi.org\/10.1109\/infcom.1999.749260","DOI":"10.1109\/infcom.1999.749260"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Liu, S., Kang, L., Chen, L., Ni, L.: Distributed incomplete pattern matching via a novel weighted bloom filter. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems (2012). https:\/\/doi.org\/10.1109\/icdcs.2012.24","DOI":"10.1109\/icdcs.2012.24"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/comst.2018.2889329","volume":"21","author":"L Luo","year":"2019","unstructured":"Luo, L., Guo, D., Ma, R.T.B., Rottenstreich, O., Luo, X.: Optimizing bloom filter: challenges, solutions, and comparisons. IEEE Commun. Surv. Tutorials. 21, 1912\u20131949 (2019). https:\/\/doi.org\/10.1109\/comst.2018.2889329","journal-title":"IEEE Commun. Surv. Tutorials."},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Presented at the Finding Frequent Items in Data Streams (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_59","DOI":"10.1007\/3-540-45465-9_59"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/tc.2011.108","volume":"61","author":"Y Hua","year":"2012","unstructured":"Hua, Y., Xiao, B., Veeravalli, B., Feng, D.: Locality-sensitive bloom filter for approximate membership query. IEEE Trans. Comput. 61, 817\u2013830 (2012). https:\/\/doi.org\/10.1109\/tc.2011.108","journal-title":"IEEE Trans. Comput."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"2956","DOI":"10.1109\/tpds.2014.2363458","volume":"26","author":"H Alexander","year":"2015","unstructured":"Alexander, H., Khalil, I., Cameron, C., Tari, Z., Zomaya, A.: Cooperative web caching using dynamic interest-tagged filtered bloom filters. IEEE Trans. Parallel Distrib. Syst. 26, 2956\u20132969 (2015). https:\/\/doi.org\/10.1109\/tpds.2014.2363458","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Sun, B., Luo, L., Li, S., Chen, Y., Guo, D.: The parallelized cuckoo filter for cold data representation. In: 2021 IEEE 23rd International Conference on High Performance Computing & Communications; 7th International Conference on Data Science & Systems; 19th International Conference on Smart City; 7th International Conference on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC\/DSS\/SmartCity\/DependSys) (2021). https:\/\/doi.org\/10.1109\/hpcc-dss-smartcity-dependsys53884.2021.00055","DOI":"10.1109\/hpcc-dss-smartcity-dependsys53884.2021.00055"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Dayan, N., Twitto, M.: Chucky: a succinct cuckoo filter for LSM-tree. In: Proceedings of the 2021 International Conference on Management of Data, New York (2021). https:\/\/doi.org\/10.1145\/3448016.3457273","DOI":"10.1145\/3448016.3457273"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s00778-019-00561-0","volume":"29","author":"AD Breslow","year":"2019","unstructured":"Breslow, A.D., Jayasena, N.S.: Morton filters: fast, compressed sparse cuckoo filters. VLDB J. 29, 731\u2013754 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00561-0","journal-title":"VLDB J."},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Einziger, G., Friedman, R.: Counting with TinyTable. In: Proceedings of the 17th International Conference on Distributed Computing and Networking, New York (2016). https:\/\/doi.org\/10.1145\/2833312.2833449","DOI":"10.1145\/2833312.2833449"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1017\/s0963548315000334","volume":"25","author":"N Fountoulakis","year":"2015","unstructured":"Fountoulakis, N., Khosla, M., Panagiotou, K.: The multiple-orientability thresholds for random hypergraphs. Combinator. Probab. Comp. 25, 870\u2013908 (2015). https:\/\/doi.org\/10.1017\/s0963548315000334","journal-title":"Combinator. Probab. Comp."},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2007.02.054","volume":"380","author":"M Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380, 47\u201368 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.02.054","journal-title":"Theor. Comput. Sci."},{"key":"25_CR27","unstructured":"Fan, B., Andersen, D., Kaminsky, M.: MemC3: compact and concurrent MemCache with dumber caching and smarter hashing. In: Symposium on Networked Systems Design and Implementation (2013)"},{"key":"25_CR28","unstructured":"Fu, P., Luo, L., Guo, D., Zhao, X., Li, S., Wang, H.: Jump filter: a dynamic sketch for big data governance. J. Softw. 34(3) (2022)"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Fu, P., Luo, L., Li, S., Guo, D., Cheng, G., Zhou, Y.: The vertical cuckoo filters: a family of insertion-friendly sketches for online applications. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS). IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00015"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Li, S., Luo, L., Guo, D., Zhao, Y.: Stable cuckoo filter for data streams. In: 2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS). IEEE (2021)","DOI":"10.1109\/ICPADS53394.2021.00023"},{"key":"25_CR31","unstructured":"Luo, L., Fu, P., Li, S., Guo, D., Zhang, Q., Wang, H.: Ark Filter: A General and Space-Efficient Sketch for Network Flow Analysis IEEE\/ACM Transactions on Networking"},{"key":"25_CR32","unstructured":"Fu, P., Luo, L., Guo, D., Li, S., Zhou, Y.: A Shifting Filter Framework for Dynamic Set Queries IEEE\/ACM Transactions on Networking"}],"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-0808-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:06:10Z","timestamp":1708963570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0808-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708079","9789819708086"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0808-6_25","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)"}}]}}