{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:29Z","timestamp":1759134329782,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319896","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1711-1728","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["FishStore"],"prefix":"10.1145","author":[{"given":"Dong","family":"Xie","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}]},{"given":"Badrish","family":"Chandramouli","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Yinan","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452377"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213864"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190664"},{"key":"e_1_3_2_1_4_1","volume-title":"TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In USENIX ATC. 363--375.","author":"Balmau Oana","year":"2017","unstructured":"Oana Balmau , Diego Didona , Rachid Guerraoui , Willy Zwaenepoel , Huapeng Yuan , Aashray Arora , Karan Gupta , and Pavan Konka . 2017 . TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In USENIX ATC. 363--375. Oana Balmau, Diego Didona, Rachid Guerraoui, Willy Zwaenepoel, Huapeng Yuan, Aashray Arora, Karan Gupta, and Pavan Konka. 2017. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In USENIX ATC. 363--375."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612185"},{"key":"e_1_3_2_1_6_1","first-page":"12","article-title":"FAD.Js","volume":"10","author":"Bonetta Daniele","year":"2017","unstructured":"Daniele Bonetta and Matthias Brantner . 2017 . FAD.Js : Fast JSON Data Access Using JIT-based Speculative Optimizations. PVLDB , Vol. 10 , 12 (Aug. 2017), 1778--1789. Daniele Bonetta and Matthias Brantner. 2017. FAD.Js: Fast JSON Data Access Using JIT-based Speculative Optimizations. PVLDB, Vol. 10, 12 (Aug. 2017), 1778--1789.","journal-title":"Fast JSON Data Access Using JIT-based Speculative Optimizations. PVLDB"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0507-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536260"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593673"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_3_2_1_14_1","unstructured":"Apache Software Foundation. 2018. Apache Cassandra. http:\/\/cassandra.apache.org\/. (2018).  Apache Software Foundation. 2018. Apache Cassandra. http:\/\/cassandra.apache.org\/. (2018)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807326"},{"key":"e_1_3_2_1_16_1","unstructured":"Google. 2018. Google Cloud Dataflow. https:\/\/cloud.google.com\/dataflow\/. (2018).  Google. 2018. Google Cloud Dataflow. https:\/\/cloud.google.com\/dataflow\/. (2018)."},{"key":"e_1_3_2_1_17_1","unstructured":"Stratos Idreos Ioannis Alagiannis Ryan Johnson and Anastasia Ailamaki. 2011. Here are my Data Files. Here are my Queries. Where are my Results?. In CIDR.  Stratos Idreos Ioannis Alagiannis Ryan Johnson and Anastasia Ailamaki. 2011. Here are my Data Files. Here are my Queries. Where are my Results?. In CIDR."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402799"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064049"},{"volume-title":"The Bw-Tree: A B-tree for New Hardware Platforms","author":"Levandoski Justin J.","key":"e_1_3_2_1_20_1","unstructured":"Justin J. Levandoski , David B. Lomet , and Sudipta Sengupta . 2013. The Bw-Tree: A B-tree for New Hardware Platforms . In ICDE. IEEE Computer Society , Washington, DC, USA , 302--313. Justin J. Levandoski, David B. Lomet, and Sudipta Sengupta. 2013. The Bw-Tree: A B-tree for New Hardware Platforms. In ICDE. IEEE Computer Society, Washington, DC, USA, 302--313."},{"key":"e_1_3_2_1_21_1","first-page":"1118","article-title":"Mison","volume":"10","author":"Li Yinan","year":"2017","unstructured":"Yinan Li , Nikos R. Katsipoulakis , Badrish Chandramouli , Jonathan Goldstein , and Donald Kossmann . 2017 . Mison : A Fast JSON Parser for Data Analytics. PVLDB , Vol. 10 , 10 (2017), 1118 -- 1129 . Yinan Li, Nikos R. Katsipoulakis, Badrish Chandramouli, Jonathan Goldstein, and Donald Kossmann. 2017. Mison: A Fast JSON Parser for Data Analytics. PVLDB, Vol. 10, 10 (2017), 1118--1129.","journal-title":"A Fast JSON Parser for Data Analytics. PVLDB"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516398"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452435"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556555"},{"key":"e_1_3_2_1_26_1","first-page":"4","article-title":"The Log-structured Merge-tree (LSM-tree)","volume":"33","author":"O'Neil Patrick","year":"1996","unstructured":"Patrick O'Neil , Edward Cheng , Dieter Gawlick , and Elizabeth O'Neil . 1996 . The Log-structured Merge-tree (LSM-tree) . Acta Inf. , Vol. 33 , 4 (June 1996), 351--385. Patrick O'Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O'Neil. 1996. The Log-structured Merge-tree (LSM-tree). Acta Inf., Vol. 33, 4 (June 1996), 351--385.","journal-title":"Acta Inf."},{"key":"e_1_3_2_1_27_1","first-page":"1576","article-title":"Filter Before You Parse","volume":"11","author":"Palkar Shoumik","year":"2018","unstructured":"Shoumik Palkar , Firas Abuzaid , Peter Bailis , and Matei Zaharia . 2018 . Filter Before You Parse : Faster Analytics on Raw Data with Sparser. PVLDB , Vol. 11 , 11 (2018), 1576 -- 1589 . Shoumik Palkar, Firas Abuzaid, Peter Bailis, and Matei Zaharia. 2018. Filter Before You Parse: Faster Analytics on Raw Data with Sparser. PVLDB, Vol. 11, 11 (2018), 1576--1589.","journal-title":"Faster Analytics on Raw Data with Sparser. PVLDB"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137659"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Pandian Raju Rohan Kadekodi Vijay Chidambaram and Ittai Abraham. 2017. PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees. In SOSP . 497--514.  Pandian Raju Rohan Kadekodi Vijay Chidambaram and Ittai Abraham. 2017. PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees. In SOSP . 497--514.","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_2_1_31_1","unstructured":"Kenneth A. Ross. 2007. Efficient Hash Probes on Modern Processors. In ICDE. 1297--1301.  Kenneth A. Ross. 2007. Efficient Hash Probes on Modern Processors. In ICDE. 1297--1301."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824065"},{"key":"e_1_3_2_1_33_1","unstructured":"Facebook Open Source. 2018. RocksDB. http:\/\/rocksdb.org\/. (2018).  Facebook Open Source. 2018. RocksDB. http:\/\/rocksdb.org\/. (2018)."},{"volume-title":"SOSP","author":"Tu Stephen","key":"e_1_3_2_1_34_1","unstructured":"Stephen Tu , Wenting Zheng , Eddie Kohler , Barbara Liskov , and Samuel Madden . 2013. Speedy Transactions in Multicore In-memory Databases . In SOSP . ACM , New York, NY, USA , 18--32. Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, and Samuel Madden. 2013. Speedy Transactions in Multicore In-memory Databases. In SOSP. ACM, New York, NY, USA, 18--32."},{"key":"e_1_3_2_1_35_1","unstructured":"Matei Zaharia Mosharaf Chowdhury Tathagata Das Ankur Dave Justin Ma Murphy McCauly Michael J. Franklin Scott Shenker and Ion Stoica. 2012. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In NSDI.   Matei Zaharia Mosharaf Chowdhury Tathagata Das Ankur Dave Justin Ma Murphy McCauly Michael J. Franklin Scott Shenker and Ion Stoica. 2012. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In NSDI."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_1_37_1","unstructured":"Jingren Zhou John Cieslewicz Kenneth A. Ross and Mihir Shah. 2005. Improving Database Performance on Simultaneous Multithreading Processors. In VLDB . 49--60.   Jingren Zhou John Cieslewicz Kenneth A. Ross and Mihir Shah. 2005. Improving Database Performance on Simultaneous Multithreading Processors. In VLDB . 49--60."}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319896","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:22Z","timestamp":1750207402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319896"}},"subtitle":["Faster Ingestion with Subset Hashing"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":37,"alternative-id":["10.1145\/3299869.3319896","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319896","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}