{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T10:00:30Z","timestamp":1777024830881,"version":"3.51.4"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:00:00Z","timestamp":1543536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["513954"],"award-info":[{"award-number":["513954"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Syst."],"published-print":{"date-parts":[[2018,11,30]]},"abstract":"<jats:p>Log-Structured Merge Key-Value stores (LSM KVs) are designed to offer good write performance, by capturing client writes in memory, and only later flushing them to storage. Writes are later compacted into a tree-like data structure on disk to improve read performance and to reduce storage space use. It has been widely documented that compactions severely hamper throughput. Various optimizations have successfully dealt with this problem. These techniques include, among others, rate-limiting flushes and compactions, selecting among compactions for maximum effect, and limiting compactions to the highest level by so-called fragmented LSMs.<\/jats:p>\n          <jats:p>In this article, we focus on latencies rather than throughput. We first document the fact that LSM KVs exhibit high tail latencies. The techniques that have been proposed for optimizing throughput do not address this issue, and, in fact, in some cases, exacerbate it. The root cause of these high tail latencies is interference between client writes, flushes, and compactions. Another major cause for tail latency is the heterogeneous nature of the workloads in terms of operation mix and item sizes whereby a few more computationally heavy requests slow down the vast majority of smaller requests.<\/jats:p>\n          <jats:p>We introduce the notion of an Input\/Output (I\/O) bandwidth scheduler for an LSM-based KV store to reduce tail latency caused by interference of flushing and compactions and by workload heterogeneity. We explore three techniques as part of this I\/O scheduler: (1) opportunistically allocating more bandwidth to internal operations during periods of low load, (2) prioritizing flushes and compactions at the lower levels of the tree, and (3) separating client requests by size and by data access path. SILK+ is a new open-source LSM KV that incorporates this notion of an I\/O scheduler.<\/jats:p>","DOI":"10.1145\/3380905","type":"journal-article","created":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T04:15:56Z","timestamp":1590898556000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["SILK+ Preventing Latency Spikes in Log-Structured Merge Key-Value Stores Running Heterogeneous Workloads"],"prefix":"10.1145","volume":"36","author":[{"given":"Oana","family":"Balmau","sequence":"first","affiliation":[{"name":"University of Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Dinu","sequence":"additional","affiliation":[{"name":"University of Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Zwaenepoel","sequence":"additional","affiliation":[{"name":"University of Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karan","family":"Gupta","sequence":"additional","affiliation":[{"name":"Nutanix Inc., CA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravishankar","family":"Chandhiramoorthi","sequence":"additional","affiliation":[{"name":"Nutanix Inc., CA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Didona","sequence":"additional","affiliation":[{"name":"IBM Research, Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757810"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2435779"},{"key":"e_1_2_1_3_1","volume-title":"Butt","author":"Anwar Ali","year":"2018","unstructured":"Ali Anwar , Yue Cheng , Hai Huang , Jingoo Han , Hyogi Sim , Dongyoon Lee , Fred Douglis , and Ali R . Butt . 2018 . BespoKV: Application tailored scale-out key-value stores. In Proceedings of SC 18. Ali Anwar, Yue Cheng, Hai Huang, Jingoo Han, Hyogi Sim, Dongyoon Lee, Fred Douglis, and Ali R. Butt. 2018. BespoKV: Application tailored scale-out key-value stores. In Proceedings of SC18."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of USENIX ATC.","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 Proceedings of USENIX ATC. 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 Proceedings of USENIX ATC."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of USENIX ATC.","author":"Balmau Oana","year":"2019","unstructured":"Oana Balmau , Florin Dinu , Willy Zwaenepoel , Karan Gupta , Ravishankar Chandhiramoorthi , and Diego Didona . 2019 . SILK: Preventing latency spikes in log-structured merge key-value stores . In Proceedings of USENIX ATC. Oana Balmau, Florin Dinu, Willy Zwaenepoel, Karan Gupta, Ravishankar Chandhiramoorthi, and Diego Didona. 2019. SILK: Preventing latency spikes in log-structured merge key-value stores. In Proceedings of USENIX ATC."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064193"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378792"},{"key":"e_1_2_1_9_1","volume-title":"An introduction to B-trees and Write-optimization. ;login: 40, 5","author":"Bender Michael A.","year":"2015","unstructured":"Michael A. Bender , Martin Farach-Colton , William Jannen , Rob Johnson , Bradley C. Kuszmaul , Donald E. Porter , Jun Yuan , and Yang Zhan . 2015. An introduction to B-trees and Write-optimization. ;login: 40, 5 ( 2015 ). Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, and Yang Zhan. 2015. An introduction to B-trees and Write-optimization. ;login: 40, 5 (2015)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of USENIX HotStorage.","author":"Blott Michaela","year":"2015","unstructured":"Michaela Blott , Ling Liu , Kimon Karras , and Kees Vissers . 2015 . Scaling out to a single-node 80 gbps memcached server with 40 terabytes of memory . In Proceedings of USENIX HotStorage. Michaela Blott, Ling Liu, Kimon Karras, and Kees Vissers. 2015. Scaling out to a single-node 80 gbps memcached server with 40 terabytes of memory. In Proceedings of USENIX HotStorage."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of SODA.","author":"Brodal Gerth Stolting","year":"2003","unstructured":"Gerth Stolting Brodal and Rolf Fagerberg . 2003 . Lower bounds for external memory dictionaries . In Proceedings of SODA. Gerth Stolting Brodal and Rolf Fagerberg. 2003. Lower bounds for external memory dictionaries. In Proceedings of SODA."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of USENIX ATC.","author":"Chan Helen H. W.","year":"2018","unstructured":"Helen H. W. Chan , Yongkun Li , Patrick P. C. Lee , and Yinlong Xu . 2018 . HashKV: Enabling efficient updates in KV storage via hashing . In Proceedings of USENIX ATC. Helen H. W. Chan, Yongkun Li, Patrick P. C. Lee, and Yinlong Xu. 2018. HashKV: Enabling efficient updates in KV storage via hashing. In Proceedings of USENIX ATC."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_2_1_18_1","volume-title":"Retrieved","author":"Dean Jeffrey","year":"2019","unstructured":"Jeffrey Dean and Sanjay Ghemawat . [n.d.]. Level DB. Retrieved January 2019 from https:\/\/github.com\/google\/leveldb. Jeffrey Dean and Sanjay Ghemawat. [n.d.]. LevelDB. Retrieved January 2019 from https:\/\/github.com\/google\/leveldb."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987550.2987563"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267838"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of USENIX ATC.","author":"Delgado Pamela","year":"2015","unstructured":"Pamela Delgado , Florin Dinu , Anne-Marie Kermarrec , and Willy Zwaenepoel . 2015 . Hawk: Hybrid datacenter scheduling . In Proceedings of USENIX ATC. Pamela Delgado, Florin Dinu, Anne-Marie Kermarrec, and Willy Zwaenepoel. 2015. Hawk: Hybrid datacenter scheduling. In Proceedings of USENIX ATC."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232559"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of NSDI.","author":"Didona Diego","year":"2019","unstructured":"Diego Didona and Willy Zwaenepoel . 2019 . Size-aware sharding for improving tail latencies in in-memory key-value stores . In Proceedings of NSDI. Diego Didona and Willy Zwaenepoel. 2019. Size-aware sharding for improving tail latencies in in-memory key-value stores. In Proceedings of NSDI."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of CIDR.","author":"Dong Siying","year":"2017","unstructured":"Siying Dong , Mark Callaghan , Leonidas Galanis , Dhruba Borthakur , Tony Savor , and Michael Strum . 2017 . Optimizing space amplification in rocksDB . In Proceedings of CIDR. Siying Dong, Mark Callaghan, Leonidas Galanis, Dhruba Borthakur, Tony Savor, and Michael Strum. 2017. Optimizing space amplification in rocksDB. In Proceedings of CIDR."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of NSDI.","author":"Eisenman Assaf","year":"2019","unstructured":"Assaf Eisenman , Asaf Cidon , Evgenya Pergament , Or Haimovich , Ryan Stutsman , Mohammad Alizadeh , and Sachin Katti . 2019 . Flashield: A hybrid key-value cache that controls flash write amplification . In Proceedings of NSDI. Assaf Eisenman, Asaf Cidon, Evgenya Pergament, Or Haimovich, Ryan Stutsman, Mohammad Alizadeh, and Sachin Katti. 2019. Flashield: A hybrid key-value cache that controls flash write amplification. In Proceedings of NSDI."},{"key":"e_1_2_1_26_1","volume-title":"RocksDB: A Persistent Key-value Store for Fast Storage Environments. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB: A Persistent Key-value Store for Fast Storage Environments. Retrieved January 2019 from https:\/\/rocksdb.org. Facebook. [n.d.]. RocksDB: A Persistent Key-value Store for Fast Storage Environments. Retrieved January 2019 from https:\/\/rocksdb.org."},{"key":"e_1_2_1_27_1","volume-title":"RocksDB Autotuned Rate Limiter. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB Autotuned Rate Limiter. Retrieved January 2019 from https:\/\/rocksdb.org\/blog\/2017\/12\/18\/17-auto-tuned-rate-limiter.html. Facebook. [n.d.]. RocksDB Autotuned Rate Limiter. Retrieved January 2019 from https:\/\/rocksdb.org\/blog\/2017\/12\/18\/17-auto-tuned-rate-limiter.html."},{"key":"e_1_2_1_28_1","volume-title":"RocksDB Benchmarking Tools. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB Benchmarking Tools. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Benchmarking-tools. Facebook. [n.d.]. RocksDB Benchmarking Tools. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Benchmarking-tools."},{"key":"e_1_2_1_29_1","volume-title":"RocksDB Level-based Compaction Changes. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB Level-based Compaction Changes. Retrieved January 2019 from https:\/\/rocksdb.org\/blog\/2017\/06\/26\/17-level-based-changes.html. Facebook. [n.d.]. RocksDB Level-based Compaction Changes. Retrieved January 2019 from https:\/\/rocksdb.org\/blog\/2017\/06\/26\/17-level-based-changes.html."},{"key":"e_1_2_1_30_1","volume-title":"RocksDB Rate Limiter. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB Rate Limiter. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Rate-Limiter. Facebook. [n.d.]. RocksDB Rate Limiter. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Rate-Limiter."},{"key":"e_1_2_1_31_1","volume-title":"RocksDB Tuing Guide. Retrieved","year":"2019","unstructured":"Facebook. [n.d.]. RocksDB Tuing Guide. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/RocksDB-Tuning-Guide. Facebook. [n.d.]. RocksDB Tuing Guide. Retrieved January 2019 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/RocksDB-Tuning-Guide."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741973"},{"key":"e_1_2_1_33_1","volume-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"Harchol-Balter Mor","unstructured":"Mor Harchol-Balter . 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action . Cambridge University Press . Mor Harchol-Balter. 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.108"},{"key":"e_1_2_1_35_1","volume-title":"Retrieved","author":"DB.","year":"2019","unstructured":"Hyperdex. [n.d.]. HyperLevel DB. Retrieved January 2019 from https:\/\/github.com\/rescrv\/HyperLevelDB. Hyperdex. [n.d.]. HyperLevelDB. Retrieved January 2019 from https:\/\/github.com\/rescrv\/HyperLevelDB."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2798729"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of NSDI.","author":"Kaffes Kostis","year":"2019","unstructured":"Kostis Kaffes , Timothy Chong , Jack Tigar Humphries , Adam Belay , David Mazieres , and Christos Kozyrakis . 2019 . Shinjuku: Preemptive scheduling for second-scale tail latency . In Proceedings of NSDI. Kostis Kaffes, Timothy Chong, Jack Tigar Humphries, Adam Belay, David Mazieres, and Christos Kozyrakis. 2019. Shinjuku: Preemptive scheduling for second-scale tail latency. In Proceedings of NSDI."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of USENIX ATC.","author":"Kannan Sudarsun","year":"2018","unstructured":"Sudarsun Kannan , Nitish Bhat , Ada Gavrilovska , Andrea Arpaci-Dusseau , and Remzi Arpaci-Dusseau . 2018 . Redesigning LSMs for nonvolatile memory with noveLSM . In Proceedings of USENIX ATC. Sudarsun Kannan, Nitish Bhat, Ada Gavrilovska, Andrea Arpaci-Dusseau, and Remzi Arpaci-Dusseau. 2018. Redesigning LSMs for nonvolatile memory with noveLSM. In Proceedings of USENIX ATC."},{"key":"e_1_2_1_39_1","volume-title":"Theory","author":"Kleinrock Leonard","year":"1975","unstructured":"Leonard Kleinrock . 1975. Theory , volume 1 , queueing systems. ( 1975 ). Leonard Kleinrock. 1975. Theory, volume 1, queueing systems. (1975)."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2015.7208288"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359628"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of FAST.","author":"Lim Hyeontaek","year":"2016","unstructured":"Hyeontaek Lim , David G. Andersen , and Michael Kaminsky . 2016 . Towards accurate and fast evaluation of multi-stage log-structured designs . In Proceedings of FAST. Hyeontaek Lim, David G. Andersen, and Michael Kaminsky. 2016. Towards accurate and fast evaluation of multi-stage log-structured designs. In Proceedings of FAST."},{"key":"e_1_2_1_44_1","volume-title":"Wenisch","author":"Lim Kevin","year":"2013","unstructured":"Kevin Lim , David Meisner , Ali G. Saidi , Parthasarathy Ranganathan , and Thomas F . Wenisch . 2013 . Thin servers with smart pipes: Designing SoC accelerators for memcached. In Proceedings of ACM SIGARCH. Kevin Lim, David Meisner, Ali G. Saidi, Parthasarathy Ranganathan, and Thomas F. Wenisch. 2013. Thin servers with smart pipes: Designing SoC accelerators for memcached. In Proceedings of ACM SIGARCH."},{"key":"e_1_2_1_45_1","volume-title":"Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau.","author":"Lu Lanyue","year":"2016","unstructured":"Lanyue Lu , Thanumalayan Sankaranarayana Pillai , Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016 . WiscKey: Separating keys from values in SSD-conscious storage. In Proceedings of FAST. Lanyue Lu, Thanumalayan Sankaranarayana Pillai, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016. WiscKey: Separating keys from values in SSD-conscious storage. In Proceedings of FAST."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267829"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3127486"},{"key":"e_1_2_1_48_1","volume-title":"memcached: Free 8 open source, high-performance, distributed memory object caching system. Retrieved","year":"2019","unstructured":"Memcached. [n.d.]. memcached: Free 8 open source, high-performance, distributed memory object caching system. Retrieved May 2019 from https:\/\/memcached.org\/. Memcached. [n.d.]. memcached: Free 8 open source, high-performance, distributed memory object caching system. Retrieved May 2019 from https:\/\/memcached.org\/."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164142"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/65762.65765"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of USENIX ATC.","author":"Papagiannis Anastasios","year":"2016","unstructured":"Anastasios Papagiannis , Giorgos Saloustros , Pilar Gonz\u00e1lez-F\u00e9rez , and Angelos Bilas . 2016 . Tucana: Design and implementation of a fast and efficient scale-up key-value store . In Proceedings of USENIX ATC. Anastasios Papagiannis, Giorgos Saloustros, Pilar Gonz\u00e1lez-F\u00e9rez, and Angelos Bilas. 2016. Tucana: Design and implementation of a fast and efficient scale-up key-value store. In Proceedings of USENIX ATC."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064209"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of USENIX ATC.","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 USENIX ATC. 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 USENIX ATC."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139922"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.38"}],"container-title":["ACM Transactions on Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3380905","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3380905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:46Z","timestamp":1750199566000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3380905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,30]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11,30]]}},"alternative-id":["10.1145\/3380905"],"URL":"https:\/\/doi.org\/10.1145\/3380905","relation":{},"ISSN":["0734-2071","1557-7333"],"issn-type":[{"value":"0734-2071","type":"print"},{"value":"1557-7333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,30]]},"assertion":[{"value":"2019-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}