{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:50:02Z","timestamp":1774950602140,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Intel Science and Technology Center for Visual Cloud Systems"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1535821"],"award-info":[{"award-number":["CCF-1535821"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196931","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"323-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":137,"title":["SuRF"],"prefix":"10.1145","author":[{"given":"Huanchen","family":"Zhang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Hyeontaek","family":"Lim","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Viktor","family":"Leis","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Intel Labs, Pittsburgh, PA, USA"}]},{"given":"Kimberly","family":"Keeton","sequence":"additional","affiliation":[{"name":"Hewlett Packard Enterprise, Palo Alto, CA, USA"}]},{"given":"Andrew","family":"Pavlo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2010. tx-trie 0.18 -- Succinct Trie Implementation. https:\/\/github.com\/hillbig\/ tx-trie. (2010).  2010. tx-trie 0.18 -- Succinct Trie Implementation. https:\/\/github.com\/hillbig\/ tx-trie. (2010)."},{"key":"e_1_3_2_1_2_1","unstructured":"2013. Squid Web Proxy Cache. http:\/\/www.squid-cache.org\/. (2013).  2013. Squid Web Proxy Cache. http:\/\/www.squid-cache.org\/. (2013)."},{"key":"e_1_3_2_1_3_1","unstructured":"2014. Google LevelDB. https:\/\/github.com\/google\/leveldb. (2014).  2014. Google LevelDB. https:\/\/github.com\/google\/leveldb. (2014)."},{"key":"e_1_3_2_1_4_1","unstructured":"2015. Apache HBase. https:\/\/hbase.apache.org\/. (2015).  2015. Apache HBase. https:\/\/hbase.apache.org\/. (2015)."},{"key":"e_1_3_2_1_5_1","unstructured":"2015. Facebook MyRocks. http:\/\/myrocks.io\/. (2015).  2015. Facebook MyRocks. http:\/\/myrocks.io\/. (2015)."},{"key":"e_1_3_2_1_6_1","unstructured":"2015. Facebook RocksDB. http:\/\/rocksdb.org\/. (2015).  2015. Facebook RocksDB. http:\/\/rocksdb.org\/. (2015)."},{"key":"e_1_3_2_1_7_1","unstructured":"2015. KairosDB. https:\/\/kairosdb.github.io\/. (2015).  2015. KairosDB. https:\/\/kairosdb.github.io\/. (2015)."},{"key":"e_1_3_2_1_8_1","unstructured":"2015. QuasarDB. https:\/\/en.wikipedia.org\/wiki\/Quasardb. (2015).  2015. QuasarDB. https:\/\/en.wikipedia.org\/wiki\/Quasardb. (2015)."},{"key":"e_1_3_2_1_9_1","unstructured":"2016. ARF Implementation. https:\/\/github.com\/carolinux\/adaptive_range_filters. (2016).  2016. ARF Implementation. https:\/\/github.com\/carolinux\/adaptive_range_filters. (2016)."},{"key":"e_1_3_2_1_10_1","unstructured":"2016. Succinct Data Structures. https:\/\/en.wikipedia.org\/wiki\/Succinct_data_ structure. (2016).  2016. Succinct Data Structures. https:\/\/en.wikipedia.org\/wiki\/Succinct_data_ structure. (2016)."},{"key":"e_1_3_2_1_11_1","unstructured":"2017. InfluxData InfluxDB. https:\/\/www.influxdata.com\/time-series-platform\/ influxdb\/. (2017).  2017. InfluxData InfluxDB. https:\/\/www.influxdata.com\/time-series-platform\/ influxdb\/. (2017)."},{"key":"e_1_3_2_1_12_1","unstructured":"2017. The InfluxDB Storage Engine and the Time-Structured Merge Tree (TSM). https:\/\/docs.influxdata.com\/influxdb\/v1.0\/concepts\/storage_engine\/. (2017).  2017. The InfluxDB Storage Engine and the Time-Structured Merge Tree (TSM). https:\/\/docs.influxdata.com\/influxdb\/v1.0\/concepts\/storage_engine\/. (2017)."},{"key":"e_1_3_2_1_13_1","volume-title":"NSDI '15 . 337--350","author":"Agarwal Rachit","year":"2015","unstructured":"Rachit Agarwal , Anurag Khandelwal , and Ion Stoica . 2015 . Succinct: Enabling queries on compressed data . In NSDI '15 . 337--350 . Rachit Agarwal, Anurag Khandelwal, and Ion Stoica. 2015. Succinct: Enabling queries on compressed data. In NSDI '15 . 337--350."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556556"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790231.2790240"},{"key":"e_1_3_2_1_16_1","first-page":"461","article-title":"Designing Access Methods: The RUM Conjecture","volume":"2016","author":"Athanassoulis Manos","year":"2016","unstructured":"Manos Athanassoulis , Michael S Kester , Lukas M Maas , Radu Stoica , Stratos Idreos , Anastasia Ailamaki , and Mark Callaghan . 2016 . Designing Access Methods: The RUM Conjecture . In EDBT , Vol. 2016. 461 -- 466 . Manos Athanassoulis, Michael S Kester, Lukas M Maas, Radu Stoica, Stratos Idreos, Anastasia Ailamaki, and Mark Callaghan. 2016. Designing Access Methods: The RUM Conjecture. In EDBT, Vol. 2016. 461--466.","journal-title":"EDBT"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118737.3118845"},{"key":"e_1_3_2_1_18_1","unstructured":"Timo Bingmann. 2008. STX B+ Tree C++ Template Classes. http:\/\/idlebox.net\/ 2007\/stx-btree\/. (2008).  Timo Bingmann. 2008. STX B+ Tree C++ Template Classes. http:\/\/idlebox.net\/ 2007\/stx-btree\/. (2008)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_3_2_1_24_1","unstructured":"Siying Dong. 2017. personal communication. (2017). 2017-08--28.  Siying Dong. 2017. personal communication. (2017). 2017-08--28."},{"key":"e_1_3_2_1_25_1","unstructured":"Siying Dong Mark Callaghan Leonidas Galanis Dhruba Borthakur Tony Savor and Michael Strum. 2017. Optimizing Space Amplification in RocksDB. In CIDR .  Siying Dong Mark Callaghan Leonidas Galanis Dhruba Borthakur Tony Savor and Michael Strum. 2017. Optimizing Space Amplification in RocksDB. In CIDR ."},{"key":"e_1_3_2_1_26_1","unstructured":"Facebook. 2015. RocksDB Tuning Guide. https:\/\/github.com\/facebook\/rocksdb\/ wiki\/RocksDB-Tuning-Guide. (2015).  Facebook. 2015. RocksDB Tuning Guide. https:\/\/github.com\/facebook\/rocksdb\/ wiki\/RocksDB-Tuning-Guide. (2015)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285287"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.09.014"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741973"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of WEA . 27--38","author":"Gonz\u00e1lez Rodrigo","year":"2005","unstructured":"Rodrigo Gonz\u00e1lez , Szymon Grabowski , Veli M\u00e4kinen , and Gonzalo Navarro . 2005 . Practical implementation of rank and select queries . In Proc. of WEA . 27--38 . Rodrigo Gonz\u00e1lez, Szymon Grabowski, Veli M\u00e4kinen, and Gonzalo Navarro. 2005. Practical implementation of rank and select queries. In Proc. of WEA . 27--38."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_3"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656332"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc of NSDI' 16 .","author":"Khandelwal Anurag","year":"2016","unstructured":"Anurag Khandelwal , Rachit Agarwal , and Ion Stoica . 2016 . Blowfish: Dynamic storage-performance tradeoff in data stores . In Proc of NSDI' 16 . Anurag Khandelwal, Rachit Agarwal, and Ion Stoica. 2016. Blowfish: Dynamic storage-performance tradeoff in data stores. In Proc of NSDI' 16 ."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367068"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.08.008"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1151"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"J Ian Munro and S Srinivasa Rao. 2004. Succinct representations of functions. In ICALP .  J Ian Munro and S Srinivasa Rao. 2004. Succinct representations of functions. In ICALP .","DOI":"10.1007\/978-3-540-27836-8_84"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_26"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Felix Putze Peter Sanders and Singler Johannes. 2007. Cache- Hash- and Space- Efficient Bloom Filters. In Experimental Algorithms . 108--121.   Felix Putze Peter Sanders and Singler Johannes. 2007. Cache- Hash- and Space- Efficient Bloom Filters. In Experimental Algorithms . 108--121.","DOI":"10.1007\/978-3-540-72845-0_9"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_12"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056102"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Kunihiko Sadakane and Gonzalo Navarro. 2010. Fully-functional succinct trees. In SODA .   Kunihiko Sadakane and Gonzalo Navarro. 2010. Fully-functional succinct trees. In SODA .","DOI":"10.1137\/1.9781611973075.13"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"e_1_3_2_1_52_1","unstructured":"The Apache Software Foundation. 2015. Apache Cassandra. https:\/\/cassandra. apache.org\/. (2015).  The Apache Software Foundation. 2015. Apache Cassandra. https:\/\/cassandra. apache.org\/. (2015)."},{"key":"e_1_3_2_1_53_1","volume-title":"Pro- ceedings of the 7th international conference on Experimental algorithms (WEA'08) . 154--168.","author":"Vigna Sebastiano","unstructured":"Sebastiano Vigna . 2008. Broadword implementation of rank\/select queries . In Pro- ceedings of the 7th international conference on Experimental algorithms (WEA'08) . 154--168. Sebastiano Vigna. 2008. Broadword implementation of rank\/select queries. In Pro- ceedings of the 7th international conference on Experimental algorithms (WEA'08) . 154--168."},{"key":"e_1_3_2_1_54_1","unstructured":"WiredTiger. 2014. WiredTiger. http:\/\/www.wiredtiger.com\/. (2014).  WiredTiger. 2014. WiredTiger. http:\/\/www.wiredtiger.com\/. (2014)."},{"key":"e_1_3_2_1_55_1","volume-title":"Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference . USENIX Association, 71--82","author":"Wu Xingbo","year":"2015","unstructured":"Xingbo Wu , Yuehai Xu , Zili Shao , and Song Jiang . 2015 . LSM-trie: an LSM-tree- based ultra-large key-value store for small data . In Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference . USENIX Association, 71--82 . Xingbo Wu, Yuehai Xu, Zili Shao, and Song Jiang. 2015. LSM-trie: an LSM-tree- based ultra-large key-value store for small data. In Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference . USENIX Association, 71--82."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"},{"key":"e_1_3_2_1_58_1","volume-title":"High-Performance Rank &Select Structures on Uncompressed Bit Sequences. In Symposium on Experimental Algorithms","author":"Zhou Dong","year":"2013","unstructured":"Dong Zhou , David G. Andersen , and Michael Kaminsky . 2013 . Space-Efficient , High-Performance Rank &Select Structures on Uncompressed Bit Sequences. In Symposium on Experimental Algorithms Dong Zhou, David G. Andersen, and Michael Kaminsky. 2013. Space-Efficient, High-Performance Rank &Select Structures on Uncompressed Bit Sequences. In Symposium on Experimental Algorithms"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196931","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196931"}},"subtitle":["Practical Range Query Filtering with Fast Succinct Tries"],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":58,"alternative-id":["10.1145\/3183713.3196931","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196931","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}