{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:52Z","timestamp":1775638492439,"version":"3.50.1"},"reference-count":96,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["OAC 2339521"],"award-info":[{"award-number":["OAC 2339521"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,10,1]]},"abstract":"<jats:p>Filters trade off accuracy for space and occasionally return false positive matches with a bounded error. Numerous systems use filters in fast memory to avoid performing expensive I\/Os to slow storage. A fundamental limitation in traditional filters is that they do not change their representation upon seeing a false positive match. Therefore, the maximum false positive rate is only guaranteed for a single query, not for an arbitrary set of queries. We can improve the filter's performance on a stream of queries, especially on a skewed distribution, if we can adapt after encountering false positives. Adaptive filters, such as telescoping quotient filters and adaptive cuckoo filters, update their representation upon detecting a false positive to avoid repeating the same error in the future. Adaptive filters require an auxiliary structure, typically much larger than the main filter and often residing on slow storage, to facilitate adaptation. However, existing adaptive filters are not practical and have not been adopted in real-world systems for two main reasons. First, they offer weak adaptivity guarantees, meaning that fixing a new false positive can cause a previously fixed false positive to come back. Secondly, the sub-optimal design of the auxiliary structure results in adaptivity overheads so substantial that they can actually diminish overall system performance compared to a traditional filter. In this paper, we design and implement the \\sysname, the first practical adaptive filter with minimal adaptivity overhead and strong adaptivity guarantees, which means that the performance and false-positive guarantees continue to hold even for adversarial workloads. The \\sysname is based on the state-of-the-art quotient filter design and preserves all the critical features of the quotient filter such as cache efficiency and mergeability. Furthermore, we employ a new auxiliary structure design which results in considerably low adaptivity overhead and makes the \\sysname practical in real systems. We evaluate the \\sysname by using it to filter queries to an on-disk B-tree database and find no negative impact on insert or query performance compared to traditional filters. Against adversarial workloads, the \\sysname preserves system performance, whereas traditional filters incur 2\u00d7 slowdown from adversaries representing as low as 1% of the workload. Finally, we show that on skewed query workloads, the \\sysname can reduce the false-positive rate 100\u00d7 using negligible (1\/1000th of a bit per item) space overhead.<\/jats:p>","DOI":"10.1145\/3677128","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T17:41:44Z","timestamp":1727718104000},"page":"1-28","source":"Crossref","is-referenced-by-count":4,"title":["Adaptive Quotient Filters"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1770-4829","authenticated-orcid":false,"given":"Richard","family":"Wen","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4233-9796","authenticated-orcid":false,"given":"Hunter","family":"McCoy","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7542-9800","authenticated-orcid":false,"given":"David","family":"Tench","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Labs, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8493-1395","authenticated-orcid":false,"given":"Guido","family":"Tagliavini","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7639-530X","authenticated-orcid":false,"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4890-7413","authenticated-orcid":false,"given":"Alex","family":"Conway","sequence":"additional","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-7788","authenticated-orcid":false,"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"New York University, New York, NJ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0784-7410","authenticated-orcid":false,"given":"Rob","family":"Johnson","sequence":"additional","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5576-0320","authenticated-orcid":false,"given":"Prashant","family":"Pandey","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1224252.1224501"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732958"},{"key":"e_1_2_1_3_1","unstructured":"Apache. [n. d.]. Cassandra. http:\/\/cassandra.apache.org."},{"key":"e_1_2_1_4_1","unstructured":"Austin Appleby. 2016. SMHasher source code in C. https:\/\/github.com\/aappleby\/smhasher"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.2"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00026"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_2_1_13_1","volume-title":"Eduardo PC Rocha, Gil McVean, and Zamin Iqbal.","author":"Bradley Phelim","year":"2019","unstructured":"Phelim Bradley, Henk C Den Bakker, Eduardo PC Rocha, Gil McVean, and Zamin Iqbal. 2019. Ultrafast search of all deposited bacterial and viral genomic data. Nature biotechnology 37, 2 (2019), 152--159."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 546--554","author":"Brodal Gerth St\u00f8lting","year":"2003","unstructured":"Gerth St\u00f8lting Brodal and Rolf Fagerberg. 2003. Lower Bounds for External Memory Dictionaries. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 546--554."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_2_1_17_1","volume-title":"Anonymized Internet Traces","author":"CAIDA.","year":"2016","unstructured":"CAIDA. 2016. Anonymized Internet Traces 2016. https:\/\/www.caida.org\/catalog\/datasets\/passive_dataset\/"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the InternationalWorkshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures (ADMS). 1--8.","author":"Canim Mustafa","year":"2010","unstructured":"Mustafa Canim, George A Mihaila, Bishwaranjan Bhattacharjee, Christian A Lang, and Kenneth A Ross. 2010. Buffered Bloom Filters on Solid State Storage.. In Proceedings of the InternationalWorkshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures (ADMS). 1--8."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804332"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.48"},{"key":"e_1_2_1_21_1","volume-title":"Bigtable: A Distributed Storage System for Structured Data. In 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI). 205--218","author":"Chang Fay","unstructured":"Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A.Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber. 2006. Bigtable: A Distributed Storage System for Structured Data. In 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI). 205--218."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 30--39","author":"Chazelle Bernard","year":"2004","unstructured":"Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. 2004. The Bloomier filter: an efficient data structure for static support lookup tables. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 30--39."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1942776.1942778"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661888"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-8-22"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-8-22"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu558"},{"key":"e_1_2_1_28_1","volume-title":"Cosma Rohilla Shalizi, and Mark EJ Newman","author":"Clauset Aaron","year":"2009","unstructured":"Aaron Clauset, Cosma Rohilla Shalizi, and Mark EJ Newman. 2009. Power-law distributions in empirical data. SIAM review 51, 4 (2009), 661--703."},{"key":"e_1_2_1_29_1","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Conway Alexander","year":"2020","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard Spillane, Amy Tai, and Rob Johnson. 2020. {SplinterDB}: Closing the Bandwidth Gap for {NVMe} {Key-Value} Stores. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 49--63."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.011102"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.44"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC).","author":"Debnath Biplob K","year":"2010","unstructured":"Biplob K Debnath, Sudipta Sengupta, and Jin Li. 2010. ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory.. In Proceedings of the USENIX Annual Technical Conference (ATC)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436919"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642-02652--2_6"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723709"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833449"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2007.05.011"},{"key":"e_1_2_1_40_1","volume-title":"Proc. 4th USENIXWorkshop on Hot Topics in Storage (HotStorage)","author":"Esmet John","unstructured":"John Esmet, Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2012. The TokuFS Streaming File System. In Proc. 4th USENIXWorkshop on Hot Topics in Storage (HotStorage). Boston, MA, USA."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597040"},{"key":"e_1_2_1_45_1","volume-title":"Last Accessed","author":"Inc.","year":"2015","unstructured":"Google, Inc. 2015. LevelDB: A fast and lightweight key\/value database library by Google. http:\/\/github.com\/leveldb\/, Last Accessed May 16, 2015."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10424-4_7"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Russell Housley Warwick Ford William Polk and David Solo. 1999. Internet X. 509 public key infrastructure certificate and CRL profile. Technical Report.","DOI":"10.17487\/rfc2459"},{"key":"e_1_2_1_49_1","unstructured":"InternetLiveStats.com. 2022. Google search statistics. https:\/\/www.internetlivestats.com\/google-search-statistics\/"},{"key":"e_1_2_1_50_1","volume-title":"Golnaz Jahesh, Hamza Khan, Lauren Coombe, Rene LWarren, et al.","author":"Jackman Shaun D","year":"2017","unstructured":"Shaun D Jackman, Benjamin P Vandervalk, Hamid Mohamadi, Justin Chu, Sarah Yeo, S Austin Hammond, Golnaz Jahesh, Hamza Khan, Lauren Coombe, Rene LWarren, et al. 2017. ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter. Genome research 27, 5 (2017), 768--777."},{"key":"e_1_2_1_51_1","volume-title":"Proc. 13th USENIX Conference on File and Storage Technologies (FAST)","author":"Jannen William","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2015. BetrFS: A Right-OptimizedWrite-Optimized File System. In Proc. 13th USENIX Conference on File and Storage Technologies (FAST) (Santa Clara, CA, USA), Jiri Schindler and Erez Zadok (Eds.). 301--315."},{"key":"e_1_2_1_52_1","volume-title":"Porter","author":"Jannen William","year":"2015","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2015. BetrFS:Write-Optimization in a Kernel File System. Transactions on Storage?Special Issue on USENIX FAST 2015 11, 4 (2015), 18:1--18:29."},{"key":"e_1_2_1_53_1","unstructured":"Shalla Secure Services KG. [n. d.]. Shalla's Blacklists. http:\/\/www.shallalist.de\/index.html"},{"key":"e_1_2_1_54_1","volume-title":"Support optimality and adaptive cuckoo filters. InWorkshop on Algorithms and Data Structures","author":"Kopelowitz Tsvi","unstructured":"Tsvi Kopelowitz, Samuel McCauley, and Ely Porat. 2021. Support optimality and adaptive cuckoo filters. InWorkshop on Algorithms and Data Structures. Springer, 556--570."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.17"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.60"},{"key":"e_1_2_1_57_1","unstructured":"Allen Leng. 2022. 1 in 2 visitors abandon a website that takes more than 6 seconds to load. https:\/\/digital.com\/1-in- 2-visitors-abandon-a-website-that-takes-more-than-6-seconds-to-load\/"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170042"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511996"},{"key":"e_1_2_1_60_1","unstructured":"Steve Lohr. [n. d.]. For Impatient Web Users an Eye Blink Is Just Too Long to Wait. The New York Times ([n. d.]). https:\/\/www.nytimes.com\/2012\/03\/01\/technology\/impatient-web-users-flee-slow-loading-sites.html"},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the 27th Symposium on Mass Storage Systems and Technologies (MSST). 1--6.","author":"Lu Guanlin","year":"2011","unstructured":"Guanlin Lu, Biplob Debnath, and David HC Du. 2011. A Forest-structured Bloom Filter with flash memory. In Proceedings of the 27th Symposium on Mass Storage Systems and Technologies (MSST). 1--6."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3339504"},{"key":"e_1_2_1_63_1","unstructured":"MongoDB. [n. d.]. WiredTiger. https:\/\/github.com\/wiredtiger\/wiredtiger."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2018.09.015"},{"key":"e_1_2_1_65_1","volume-title":"Pareto distributions and Zipf's law. Contemporary physics 46, 5","author":"Newman Mark EJ","year":"2005","unstructured":"Mark EJ Newman. 2005. Power laws, Pareto distributions and Zipf's law. Contemporary physics 46, 5 (2005), 323--351."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070548"},{"key":"e_1_2_1_69_1","volume-title":"Mantis: A fast, small, and exact large-scale sequence-search index. Cell systems 7, 2","author":"Pandey Prashant","year":"2018","unstructured":"Prashant Pandey, Fatemeh Almodaresi, Michael A Bender, Michael Ferdman, Rob Johnson, and Rob Patro. 2018. Mantis: A fast, small, and exact large-scale sequence-search index. Cell systems 7, 2 (2018), 201--207."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx261"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx636"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452841"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380598"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1121464109"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_9"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.46"},{"key":"e_1_2_1_78_1","volume-title":"Weightless: Lossy weight encoding for deep neural network compression. arXiv preprint arXiv:1711.04686","author":"Reagen Brandon","year":"2017","unstructured":"Brandon Reagen, Udit Gupta, RobertAdolf, MichaelMMitzenmacher, AlexanderMRush, Gu-YeonWei, and David Brooks. 2017. Weightless: Lossy weight encoding for deep neural network compression. arXiv preprint arXiv:1711.04686 (2017)."},{"key":"e_1_2_1_79_1","volume-title":"Dillinger","author":"Reviriego Pedro","year":"2021","unstructured":"Pedro Reviriego, Alfonso S\u00e1nchez-Maci\u00e1n, StefanWalzer, and Peter C. Dillinger. 2021. Approximate Membership Query Filters with a False Positive Free Set."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2111.06856"},{"key":"e_1_2_1_81_1","volume-title":"Last Accessed","author":"DB","year":"2022","unstructured":"RocksDB [n. d.]. RocksDB. https:\/\/rocksdb.org\/, Last Accessed Oct. 15, 2022."},{"key":"e_1_2_1_82_1","volume-title":"Fast lossless compression via cascading Bloom filters. BMC Bioinformatics 15","author":"Rozov Roye","year":"2014","unstructured":"Roye Rozov, Ron Shamir, and Eran Halperin. 2014. Fast lossless compression via cascading Bloom filters. BMC Bioinformatics 15 (2014)."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-9-2"},{"key":"e_1_2_1_84_1","unstructured":"ScyllaDB. [n. d.]. ScyllaDB. https:\/\/www.scylladb.com\/."},{"key":"e_1_2_1_85_1","unstructured":"Securelist.com. 2022. . https:\/\/securelist.com\/kaspersky-security-bulletin-2021-statistics\/105205\/"},{"key":"e_1_2_1_86_1","volume-title":"Fast search of thousands of short-read sequencing experiments. Nature biotechnology 34, 3","author":"Solomon Brad","year":"2016","unstructured":"Brad Solomon and Carl Kingsford. 2016. Fast search of thousands of short-read sequencing experiments. Nature biotechnology 34, 3 (2016), 300."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq230"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2015ICP0027"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542207.1542232"},{"key":"e_1_2_1_90_1","unstructured":"DavidWajc. 2017. Negative Association - Definition Properties and Applications."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2405.10253"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3032969"},{"key":"e_1_2_1_94_1","volume-title":"Proc. 14th USENIX Conference on File and Storage Technologies (FAST).","author":"Yuan Jun","unstructured":"Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, LeifWalsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2016. Optimizing Every Operation in aWrite-Optimized File System. In Proc. 14th USENIX Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3006446"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.5555\/1364813.1364831"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:11:10Z","timestamp":1774977070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":96,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10,1]]}},"alternative-id":["10.1145\/3677128"],"URL":"https:\/\/doi.org\/10.1145\/3677128","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]}}}