{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T09:18:58Z","timestamp":1773825538586,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["1763434"],"award-info":[{"award-number":["1763434"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3533737.3535091","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:12:09Z","timestamp":1655125929000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Performant Almost-Latch-Free Data Structures Using Epoch Protection"],"prefix":"10.1145","author":[{"given":"Tianyu","family":"Li","sequence":"first","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badrish","family":"Chandramouli","sequence":"additional","affiliation":[{"name":"DSG, Microsoft Research, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Madden","sequence":"additional","affiliation":[{"name":"CSAIL, MIT, US"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2021. Intel\u00ae oneAPI Threading Building Blocks (oneTBB) Documentation for concurrent_vector. https:\/\/www.intel.com\/content\/www\/us\/en\/develop\/documentation\/onetbb-do.  2021. Intel\u00ae oneAPI Threading Building Blocks (oneTBB) Documentation for concurrent_vector. https:\/\/www.intel.com\/content\/www\/us\/en\/develop\/documentation\/onetbb-do."},{"key":"e_1_3_2_1_2_1","unstructured":"2022. Epoch Protected Version Scheme (source code). https:\/\/aka.ms\/epvs.  2022. Epoch Protected Version Scheme (source code). https:\/\/aka.ms\/epvs."},{"key":"e_1_3_2_1_3_1","unstructured":"2022. Microsoft FASTER. https:\/\/github.com\/microsoft\/FASTER.  2022. Microsoft FASTER. https:\/\/github.com\/microsoft\/FASTER."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-1043-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516365"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457406"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436913"},{"key":"e_1_3_2_1_12_1","volume-title":"Asynchronous Prefix Recoverability for Fast Distributed Stores","author":"Li Tianyu","unstructured":"Tianyu Li , Badrish Chandramouli , Jose\u00a0 M. Faleiro , Samuel Madden , and Donald Kossmann . 2021. Asynchronous Prefix Recoverability for Fast Distributed Stores . Association for Computing Machinery , New York, NY, USA , 1090\u20131102. https:\/\/doi.org\/10.1145\/3448016.3458454 Tianyu Li, Badrish Chandramouli, Jose\u00a0M. Faleiro, Samuel Madden, and Donald Kossmann. 2021. Asynchronous Prefix Recoverability for Fast Distributed Stores. Association for Computing Machinery, New York, NY, USA, 1090\u20131102. https:\/\/doi.org\/10.1145\/3448016.3458454"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446098"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300090"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_3_2_1_17_1","unstructured":"Stephen Tu Wenting Zheng Eddie Kohler Barbara Liskov and Samuel Madden. 2013. Speedy transactions in multicore in-memory databases. In SOSP.  Stephen Tu Wenting Zheng Eddie Kohler Barbara Liskov and Samuel Madden. 2013. Speedy transactions in multicore in-memory databases. In SOSP."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_2_1_19_1","unstructured":"Ling Zhang Matthew Butrovich Tianyu Li Yash Nannapanei Andrew Pavlo John Rollinson Huanchen Zhang Ambarish Balakumar Daniel Biales Ziqi Dong Emmanuel Eppinger Jordi Gonz\u00e0lez Wan\u00a0Shen Lim Jianqiao Liu Prashanth Menon S.S. Mukherjee Tanuj Nayak Amadou Ngom Jeff Niu D. Patra P.\u00a0Govind Raj Stephanie Wang Wuwen Wang Yao-Tin Yu and William Zhang. 2021. Everything is a Transaction: Unifying Logical Concurrency Control and Physical Data Structure Maintenance in Database Management Systems. In CIDR.  Ling Zhang Matthew Butrovich Tianyu Li Yash Nannapanei Andrew Pavlo John Rollinson Huanchen Zhang Ambarish Balakumar Daniel Biales Ziqi Dong Emmanuel Eppinger Jordi Gonz\u00e0lez Wan\u00a0Shen Lim Jianqiao Liu Prashanth Menon S.S. Mukherjee Tanuj Nayak Amadou Ngom Jeff Niu D. Patra P.\u00a0Govind Raj Stephanie Wang Wuwen Wang Yao-Tin Yu and William Zhang. 2021. Everything is a Transaction: Unifying Logical Concurrency Control and Physical Data Structure Maintenance in Database Management Systems. In CIDR."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Data Management on New Hardware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533737.3535091","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3533737.3535091","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3533737.3535091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:40Z","timestamp":1750272220000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533737.3535091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":19,"alternative-id":["10.1145\/3533737.3535091","10.1145\/3533737"],"URL":"https:\/\/doi.org\/10.1145\/3533737.3535091","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}