{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:02:50Z","timestamp":1775638970394,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1452595"],"award-info":[{"award-number":["IIS-1452595"]}],"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":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319903","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"449-466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["The Log-Structured Merge-Bush & the Wacky Continuum"],"prefix":"10.1145","author":[{"given":"Niv","family":"Dayan","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Stratos","family":"Idreos","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Design Tradeoffs for SSD Performance. ATC","author":"Agrawal N.","year":"2008","unstructured":"Agrawal , N. , Prabhakaran , V. , Wobber , T. , Davis , J. D. , Manasse , M. , and Panigrahy , R . Design Tradeoffs for SSD Performance. ATC ( 2008 ). Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J. D., Manasse, M., and Panigrahy, R. Design Tradeoffs for SSD Performance. ATC (2008)."},{"key":"e_1_3_2_1_2_1","volume-title":"Cheap and Large CAMs for High Performance Data-Intensive Networked Systems. NSDI","author":"Anand A.","year":"2010","unstructured":"Anand , A. , Muthukrishnan , C. , Kappes , S. , Akella , A. , and Nath , S . Cheap and Large CAMs for High Performance Data-Intensive Networked Systems. NSDI ( 2010 ). Anand, A., Muthukrishnan, C., Kappes, S., Akella, A., and Nath, S. Cheap and Large CAMs for High Performance Data-Intensive Networked Systems. NSDI (2010)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629577"},{"key":"e_1_3_2_1_4_1","unstructured":"Apache. Accumulo. https:\/\/accumulo.apache.org\/.  Apache. Accumulo. https:\/\/accumulo.apache.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"Apache. Cassandra. http:\/\/cassandra.apache.org.  Apache. Cassandra. http:\/\/cassandra.apache.org."},{"key":"e_1_3_2_1_6_1","unstructured":"Apache. HBase. http:\/\/hbase.apache.org\/.  Apache. HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_3_2_1_7_1","first-page":"1","volume":"37","author":"Arge","year":"2003","unstructured":"Arge , L. The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37 , 1 ( 2003 ), 1--24. Arge, L. The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37, 1 (2003), 1--24.","journal-title":"The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699484"},{"key":"e_1_3_2_1_10_1","volume-title":"Designing Access Methods: The RUM Conjecture. EDBT","author":"Athanassoulis M.","year":"2016","unstructured":"Athanassoulis , M. , Kester , M. S. , Maas , L. M. , Stoica , R. , Idreos , S. , Ailamaki , A. , and Callaghan , M . Designing Access Methods: The RUM Conjecture. EDBT ( 2016 ). Athanassoulis, M., Kester, M. S., Maas, L. M., Stoica, R., Idreos, S., Ailamaki, A., and Callaghan, M. Designing Access Methods: The RUM Conjecture. EDBT (2016)."},{"key":"e_1_3_2_1_11_1","volume-title":"TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. ATC","author":"Balmau O.","year":"2017","unstructured":"Balmau , O. , Didona , D. , Guerraoui , R. , Zwaenepoel , W. , Yuan , H. , Arora , A. , Gupta , K. , and Konka , P . TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. ATC ( 2017 ). Balmau, O., Didona, D., Guerraoui, R., Zwaenepoel, W., Yuan, H., Arora, A., Gupta, K., and Konka, P. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. ATC (2017)."},{"key":"e_1_3_2_1_12_1","volume-title":"Cache-Oblivious Streaming B-trees. SPAA","author":"Bender M. A.","year":"2007","unstructured":"Bender , M. A. , Farach-Colton , M. , Fineman , J. T. , Fogel , Y. R. , Kuszmaul , B. C. , and Nelson , J . Cache-Oblivious Streaming B-trees. SPAA ( 2007 ). Bender, M. A., Farach-Colton, M., Fineman, J. T., Fogel, Y. R., Kuszmaul, B. C., and Nelson, J. Cache-Oblivious Streaming B-trees. SPAA (2007)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"key":"e_1_3_2_1_14_1","volume-title":"Lower Bounds for External Memory Dictionaries. SODA","author":"Brodal G. S.","year":"2003","unstructured":"Brodal , G. S. , and Fagerberg , R . Lower Bounds for External Memory Dictionaries. SODA ( 2003 ). Brodal, G. S., and Fagerberg, R. Lower Bounds for External Memory Dictionaries. SODA (2003)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735477"},{"key":"e_1_3_2_1_16_1","volume-title":"On External Memory Graph Traversal. SODA","author":"Buchsbaum A. L.","year":"2000","unstructured":"Buchsbaum , A. L. , Goldwasser , M. H. , Venkatasubramanian , S. , and Westbrook , J . On External Memory Graph Traversal. SODA ( 2000 ). Buchsbaum, A. L., Goldwasser, M. H., Venkatasubramanian, S., and Westbrook, J. On External Memory Graph Traversal. SODA (2000)."},{"key":"e_1_3_2_1_17_1","volume-title":"HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC","author":"Chan H. H. W.","year":"2018","unstructured":"Chan , H. H. W. , Li , Y. , Lee , P. P. C. , and Xu , Y . HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC ( 2018 ). Chan, H. H. W., Li, Y., Lee, P. P. C., and Xu, Y. HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC (2018)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_3_2_1_19_1","volume-title":"Bigtable: A Distributed Storage System for Structured Data. OSDI","author":"Chang F.","year":"2006","unstructured":"Chang , F. , Dean , J. , Ghemawat , S. , Hsieh , W. C. , Wallach , D. A. , Burrows , M. , Chandra , T. , Fikes , A. , and Gruber , R. E . Bigtable: A Distributed Storage System for Structured Data. OSDI ( 2006 ). Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., and Gruber, R. E. Bigtable: A Distributed Storage System for Structured Data. OSDI (2006)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_1_21_1","volume-title":"Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS (to appear","author":"Dayan N.","year":"2018","unstructured":"Dayan , N. , Athanassoulis , M. , and Idreos , S . Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS (to appear ( 2018 ). Dayan, N., Athanassoulis, M., and Idreos, S. Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS (to appear (2018)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915219"},{"key":"e_1_3_2_1_23_1","volume-title":"Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD","author":"Dayan N.","year":"2018","unstructured":"Dayan , N. , and Idreos , S . Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD ( 2018 ). Dayan, N., and Idreos, S. Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD (2018)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989327"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_3_2_1_27_1","volume-title":"Optimizing Space Amplification in RocksDB. CIDR","author":"Dong S.","year":"2017","unstructured":"Dong , S. , Callaghan , M. , Galanis , L. , Borthakur , D. , Savor , T. , and Strum , M . Optimizing Space Amplification in RocksDB. CIDR ( 2017 ). Dong, S., Callaghan, M., Galanis, L., Borthakur, D., Savor, T., and Strum, M. Optimizing Space Amplification in RocksDB. CIDR (2017)."},{"key":"e_1_3_2_1_28_1","unstructured":"Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb.  Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb."},{"key":"e_1_3_2_1_29_1","unstructured":"Google. LevelDB. https:\/\/github.com\/google\/leveldb\/.  Google. LevelDB. https:\/\/github.com\/google\/leveldb\/."},{"key":"e_1_3_2_1_30_1","volume-title":"BIRTE","author":"Idreos S.","year":"2016","unstructured":"Idreos , S. , Athanassoulis , Dayan, N., Guo , D. , Kester , M. S. , Maas , L. , and Zoumpatianos , K . Past and future steps for adaptive storage data systems: From shallow to deep adaptivity . In BIRTE ( 2016 ). Idreos, S., Athanassoulis, Dayan, N., Guo, D., Kester, M. S., Maas, L., and Zoumpatianos, K. Past and future steps for adaptive storage data systems: From shallow to deep adaptivity. In BIRTE (2016)."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Dayan , N. , Qin , W. , Akmanalp , M. , Hilgard , S. , Ross , A. , Lennon , J. , Jain , V. , Gupta , H. , Li , D. , and Zhu , Z . Design continuums and the path toward self-designing key-value stores that know and learn . In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) ( 2019 ). Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A., Lennon, J., Jain, V., Gupta, H., Li, D., and Zhu, Z. Design continuums and the path toward self-designing key-value stores that know and learn. In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) (2019)."},{"key":"e_1_3_2_1_32_1","volume-title":"Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Dayan , N. , Qin , W. , Akmanalp , M. , Hilgard , S. , Ross , A. , Lennon , J. , Jain , V. , Gupta , H. , Li , D. , and Zhu , Z . Design continuums and the path toward self-designing key-value stores that know and learn . In Biennial Conference on Innovative Data Systems Research (CIDR) ( 2019 ). Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A., Lennon, J., Jain, V., Gupta, H., Li, D., and Zhu, Z. Design continuums and the path toward self-designing key-value stores that know and learn. In Biennial Conference on Innovative Data Systems Research (CIDR) (2019)."},{"key":"e_1_3_2_1_33_1","first-page":"3","volume":"41","author":"Idreos S.","year":"2018","unstructured":"Idreos , S. , Zoumpatianos , K. , Athanassoulis , M. , Dayan , N. , Hentschel , B. , Kester , M. S. , Guo , D. , Maas , L. M. , Qin , W. , Wasay , A. , and Sun , Y. The Periodic Table of Data Structures. IEEE DEBULL 41 , 3 ( 2018 ), 64--75. Idreos, S., Zoumpatianos, K., Athanassoulis, M., Dayan, N., Hentschel, B., Kester, M. S., Guo, D., Maas, L. M., Qin, W., Wasay, A., and Sun, Y. The Periodic Table of Data Structures. IEEE DEBULL 41, 3 (2018), 64--75.","journal-title":"The Periodic Table of Data Structures. IEEE DEBULL"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3199671"},{"key":"e_1_3_2_1_35_1","volume-title":"Incremental Organization for Data Recording and Warehousing. VLDB","author":"Jagadish H. V.","year":"1997","unstructured":"Jagadish , H. V. , Narayan , P. P. S. , Seshadri , S. , Sudarshan , S. , and Kanneganti , R . Incremental Organization for Data Recording and Warehousing. VLDB ( 1997 ). Jagadish, H. V., Narayan, P. P. S., Seshadri, S., Sudarshan, S., and Kanneganti, R. Incremental Organization for Data Recording and Warehousing. VLDB (1997)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3199517.3199519"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920990"},{"key":"e_1_3_2_1_40_1","volume-title":"High-Performance Key-Value Store. SOSP","author":"Lim H.","year":"2011","unstructured":"Lim , H. , Fan , B. , Andersen , D. G. , and Kaminsky , M . SILT: A Memory-Efficient , High-Performance Key-Value Store. SOSP ( 2011 ). Lim, H., Fan, B., Andersen, D. G., and Kaminsky, M. SILT: A Memory-Efficient, High-Performance Key-Value Store. SOSP (2011)."},{"key":"e_1_3_2_1_41_1","unstructured":"LinkedIn. Voldemort. http:\/\/www.project-voldemort.com.  LinkedIn. Voldemort. http:\/\/www.project-voldemort.com."},{"key":"e_1_3_2_1_42_1","volume-title":"WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST","author":"Lu L.","year":"2016","unstructured":"Lu , L. , Pillai , T. S. , Arpaci-Dusseau , A. C. , and Arpaci-Dusseau , R. H. WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST ( 2016 ). Lu, L., Pillai, T. S., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST (2016)."},{"key":"e_1_3_2_1_43_1","unstructured":"Memcached. Reference. http:\/\/memcached.org\/.  Memcached. Reference. http:\/\/memcached.org\/."},{"key":"e_1_3_2_1_44_1","unstructured":"MongoDB. Online reference. http:\/\/www.mongodb.com\/.  MongoDB. Online reference. http:\/\/www.mongodb.com\/."},{"key":"e_1_3_2_1_45_1","volume-title":"Berkeley DB. ATC","author":"Olson M. A.","year":"1999","unstructured":"Olson , M. A. , Bostic , K. , and Seltzer , M. I . Berkeley DB. ATC ( 1999 ). Olson, M. A., Bostic, K., and Seltzer, M. I. Berkeley DB. ATC (1999)."},{"key":"e_1_3_2_1_46_1","first-page":"4","volume":"33","author":"O'Neil P. E.","year":"1996","unstructured":"O'Neil , P. E. , Cheng , E. , Gawlick , D. , and O'Neil , E. J. The log-structured merge-tree (LSM-tree). Acta Informatica 33 , 4 ( 1996 ), 351--385. O'Neil, P. E., Cheng, E., Gawlick, D., and O'Neil, E. J. The log-structured merge-tree (LSM-tree). Acta Informatica 33, 4 (1996), 351--385.","journal-title":"Acta Informatica"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137659"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_1_49_1","volume-title":"Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage)","author":"Raju P.","year":"2018","unstructured":"Raju , P. , Ponnapalli , S. , Kaminsky , E. , Oved , G. , Keener , Z. , Chidambaram , V. , and Abraham , I . mlsm: Making authenticated storage faster in ethereum . In Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage) ( 2018 ). Raju, P., Ponnapalli, S., Kaminsky, E., Oved, G., Keener, Z., Chidambaram, V., and Abraham, I. mlsm: Making authenticated storage faster in ethereum. In Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage) (2018)."},{"key":"e_1_3_2_1_50_1","unstructured":"Redis. Online reference. http:\/\/redis.io\/.  Redis. Online reference. http:\/\/redis.io\/."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056102"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_2_1_54_1","volume-title":"Bitcask: A Log-Structured Hash Table for Fast Key\/Value Data. Basho White Paper","author":"Sheehy J.","year":"2010","unstructured":"Sheehy , J. , and Smith , D . Bitcask: A Log-Structured Hash Table for Fast Key\/Value Data. Basho White Paper ( 2010 ). Sheehy, J., and Smith, D. Bitcask: A Log-Structured Hash Table for Fast Key\/Value Data. Basho White Paper (2010)."},{"key":"e_1_3_2_1_55_1","volume-title":"Building Workload-Independent Storage with VT-trees. FAST","author":"Shetty P.","year":"2013","unstructured":"Shetty , P. , Spillane , R. P. , Malpani , R. , Andrews , B. , Seyster , J. , and Zadok , E . Building Workload-Independent Storage with VT-trees. FAST ( 2013 ). Shetty, P., Spillane, R. P., Malpani, R., Andrews, B., Seyster, J., and Zadok, E. Building Workload-Independent Storage with VT-trees. FAST (2013)."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_3_2_1_57_1","volume-title":"On Log-Structured Merge for Solid-State Drives. ICDE","author":"Thonangi R.","year":"2017","unstructured":"Thonangi , R. , and Yang , J . On Log-Structured Merge for Solid-State Drives. ICDE ( 2017 ). Thonangi, R., and Yang, J. On Log-Structured Merge for Solid-State Drives. ICDE (2017)."},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of EG-ICE","author":"Vo A.-V.","year":"2019","unstructured":"Vo , A.-V. , Konda , N. , Chauhan , N. , Aljumaily , H. , and Laefer , D. F . Lessons learned with laser scanning point cloud management in hadoop hbase . In Proceedings of EG-ICE ( 2019 ). Vo, A.-V., Konda, N., Chauhan, N., Aljumaily, H., and Laefer, D. F. Lessons learned with laser scanning point cloud management in hadoop hbase. In Proceedings of EG-ICE (2019)."},{"key":"e_1_3_2_1_59_1","unstructured":"WiredTiger. Source Code. https:\/\/github.com\/wiredtiger\/wiredtiger.  WiredTiger. Source Code. https:\/\/github.com\/wiredtiger\/wiredtiger."},{"key":"e_1_3_2_1_60_1","volume-title":"LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. ATC","author":"Wu X.","year":"2015","unstructured":"Wu , X. , Xu , Y. , Shao , Z. , and Jiang , S . LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. ATC ( 2015 ). Wu, X., Xu, Y., Shao, Z., and Jiang, S. LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. ATC (2015)."}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319903","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319903","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.3319903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":60,"alternative-id":["10.1145\/3299869.3319903","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319903","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"}}]}}