{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:05Z","timestamp":1787017325048,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2101140, CNS-2107078, CCF-1563710, DMS-2023528"],"award-info":[{"award-number":["CCF-2101140, CNS-2107078, CCF-1563710, DMS-2023528"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0020200"],"award-info":[{"award-number":["DE-SC0020200"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3526167","type":"proceedings-article","created":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T22:33:49Z","timestamp":1654986829000},"page":"1670-1684","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Proteus: A Self-Designing Range Filter"],"prefix":"10.1145","author":[{"given":"Eric R.","family":"Knorr","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baptiste","family":"Lemaire","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stratos","family":"Idreos","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556556"},{"key":"e_1_3_2_1_2_1","volume-title":"et al","author":"Alsubaiee Sattam","year":"2014","unstructured":"Sattam Alsubaiee, Yasser Altowim, Hotham Altwaijry, Alexander Behm, Vinayak Borkar, Yingyi Bu, Michael Carey, Inci Cetindil, Madhusudan Cheelangi, Khurram Faraaz, et al . 2014. AsterixDB: A scalable, open source BDMS. arXiv preprint arXiv:1407.0454 (2014)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786006.2786007"},{"key":"e_1_3_2_1_4_1","unstructured":"Sabrina Amrouche Laurent Basara Paolo Calafiura Dmitry Emeliyanov Victor Estrade Steven Farrell C\u00e9cile Germain Vladimir Vava Gligorov Tobias Golling Sergey Gorbunov Heather Gray Isabelle Guyon Mikhail Hushchyn Vincenzo Innocente Moritz Kiehn Marcel Kunze Edward Moyse David Rousseau Andreas Salzburger Andrey Ustyuzhanin and Jean-Roch Vlimant. 2021. The Tracking Machine Learning challenge : Throughput phase. arXiv:2105.01160 [cs.LG]"},{"key":"e_1_3_2_1_5_1","unstructured":"Austin Appleby. 2008. . https:\/\/sites.google.com\/site\/murmurhash\/"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790231.2790240"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00026"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1146-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_12_1","volume-title":"18th USENIX Conference on File and Storage Technologies (FAST 20)","author":"Cao Zhichao","unstructured":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H.C. Du. 2020. Characterizing, Modeling, and Benchmarking RocksDB Key-Value Workloads at Facebook. In 18th USENIX Conference on File and Storage Technologies (FAST 20). USENIX Association, Santa Clara, CA, 209--223. https:\/\/www.usenix.org\/conference\/fast20\/presentation\/cao-zhichao"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_14_1","volume-title":"Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier. CoRR abs\/1910.09131","author":"Dai Zhenwei","year":"2019","unstructured":"Zhenwei Dai and Anshumali Shrivastava. 2019. Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier. CoRR abs\/1910.09131 (2019). arXiv:1910.09131 http:\/\/arxiv.org\/abs\/1910.09131"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436919"},{"key":"e_1_3_2_1_16_1","unstructured":"Dgraph. 2017. Fast Key-value DB in Go. https:\/\/github.com\/dgraph-io\/badger"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"e_1_3_2_1_18_1","volume-title":"Dillinger and Stefan Walzer","author":"Peter","year":"2021","unstructured":"Peter C. Dillinger and Stefan Walzer. 2021. Ribbon filter: practically smaller than Bloom and Xor. CoRR abs\/2103.02515 (2021). arXiv:2103.02515 https:\/\/arxiv.org\/abs\/2103.02515"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483840"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0547--4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Mayank Goswami Allan Gr\u00f8nlund Kasper Green Larsen and Rasmus Pagh. [n.d.]. Approximate Range Emptiness in Constant Time and Optimal Space. 769--775. https:\/\/doi.org\/10.1137\/1.9781611973730.52 arXiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611973730.52","DOI":"10.1137\/1.9781611973730.52"},{"key":"e_1_3_2_1_24_1","volume-title":"Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters. CoRR abs\/1912.08258","author":"Graf Thomas Mueller","year":"2019","unstructured":"Thomas Mueller Graf and Daniel Lemire. 2019. Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters. CoRR abs\/1912.08258 (2019). arXiv:1912.08258 http:\/\/arxiv.org\/abs\/1912.08258"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3383133"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3199671"},{"key":"e_1_3_2_1_27_1","unstructured":"Facebook Inc. 2012. RocksDB. https:\/\/github.com\/facebook\/rocksdb"},{"key":"e_1_3_2_1_28_1","unstructured":"Facebook Inc. 2020. Compression. https:\/\/github.com\/facebook\/rocksdb\/wiki\/ Compression"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_30_1","volume-title":"SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, and Thomas Neumann. 2019. SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems (2019)."},{"key":"e_1_3_2_1_31_1","volume-title":"Coconut Palm: Static and Streaming Data Series Exploration Now in your Palm. arXiv:2006.13079 [cs.DB]","author":"Kondylakis Haridimos","year":"2020","unstructured":"Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, and Themis Palpanas. 2020. Coconut Palm: Static and Streaming Data Series Exploration Now in your Palm. arXiv:2006.13079 [cs.DB]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_33_1","unstructured":"Aapo Kyrola and Carlos Guestrin. 2014. GraphChi-DB: Simple Design for a Scalable Graph Database System -- on Just a PC. arXiv:1403.0701 [cs.DB]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-015-0110-5"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"e_1_3_2_1_38_1","unstructured":"Merriam-Webster. [n.d.]. Protean. In Merriam-Webster.com dictionary. https:\/\/www.merriam-webster.com\/dictionary\/Protean"},{"key":"e_1_3_2_1_39_1","volume-title":"Garnett (Eds.)","volume":"31","author":"Mitzenmacher Michael","year":"2018","unstructured":"Michael Mitzenmacher. 2018. A Model for Learned Bloom Filters and Optimizing by Sandwiching. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/2018\/file\/0f49c89d1e7298bb9930789c8ed59d48-Paper.pdf"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher Salvatore Pontarelli and Pedro Reviriego. 2017. Adaptive Cuckoo Filters. arXiv:1704.06818 [cs.DS]","DOI":"10.1137\/1.9781611975055.4"},{"key":"e_1_3_2_1_41_1","volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213945"},{"key":"e_1_3_2_1_44_1","volume-title":"Retrieved","author":"Turkynewych Bohdan","year":"2022","unstructured":"Bohdan Turkynewych. 2022. Domains Project. Retrieved March 20, 2022 from https:\/\/domainsproject.org\/"},{"key":"e_1_3_2_1_45_1","volume-title":"Partitioned Learned Bloom Filter. CoRR abs\/2006.03176","author":"Vaidya Kapil","year":"2020","unstructured":"Kapil Vaidya, Eric Knorr, Tim Kraska, and Michael Mitzenmacher. 2020. Partitioned Learned Bloom Filter. CoRR abs\/2006.03176 (2020). arXiv:2006.03176 https:\/\/arxiv.org\/abs\/2006.03176"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300083"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359077"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526167","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526167","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:10:13Z","timestamp":1750169413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":48,"alternative-id":["10.1145\/3514221.3526167","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3526167","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}