{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:21:15Z","timestamp":1759936875212,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2045976"],"award-info":[{"award-number":["CNS-2045976"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660266","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"69-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: LIT: Lookup Interlocked Table for Range Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1501-9631","authenticated-orcid":false,"given":"dePaul","family":"Miller","sequence":"first","affiliation":[{"name":"Lehigh University, Bethlehem, PA, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0232-305X","authenticated-orcid":false,"given":"Ahmed","family":"Hassan","sequence":"additional","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1530-4088","authenticated-orcid":false,"given":"Roberto","family":"Palmieri","sequence":"additional","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2600212.2600712"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3200691.3178489"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3293883.3295706"},{"volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques","author":"Awad Muhammad A.","unstructured":"Muhammad A. Awad, Serban D. Porumbescu, and John D. Owens. 2023. A GPU Multiversion B-Tree. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (Chicago, Illinois) (PACT '22). Association for Computing Machinery, New York, NY, USA, 481--493.","key":"e_1_3_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_6_1","volume-title":"NUMASK: High Performance Scalable Skip List for NUMA. In 32nd International Symposium on Distributed Computing, DISC 2018","volume":"19","author":"Daly Henry","year":"2018","unstructured":"Henry Daly, Ahmed Hassan, Michael F. Spear, and Roberto Palmieri. 2018. NUMASK: High Performance Scalable Skip List for NUMA. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15--19, 2018 (LIPIcs, Vol. 121), , Ulrich Schmid and Josef Widder (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 18:1--18:19."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3483840"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2342356.2342360"},{"unstructured":"Google. 2024. LevelDB. https:\/\/github.com\/google\/leveldb","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/2688500.2688501"},{"key":"e_1_3_2_1_11_1","volume-title":"15th International Conference, DISC 2001, Lisbon, Portugal, October 3--5, 2001, Proceedings (Lecture Notes in Computer Science","author":"Harris Timothy L.","year":"2001","unstructured":"Timothy L. Harris. 2001. A Pragmatic Implementation of Non-blocking Linked-Lists. In Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3--5, 2001, Proceedings (Lecture Notes in Computer Science, Vol. 2180), Jennifer L. Welch (Ed.). Springer, 300--314."},{"unstructured":"Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The art of multiprocessor programming. Newnes.","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/78969.78972"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/PACT.2017.45"},{"key":"e_1_3_2_1_15_1","volume-title":"2016 USENIX Annual Technical Conference, USENIX ATC 2016","author":"Kejriwal Ankita","year":"2016","unstructured":"Ankita Kejriwal, Arjun Gopalan, Ashish Gupta, Zhihao Jia, Stephen Yang, and John K. Ousterhout. 2016. SLIK: Scalable Low-Latency Indexes for a Key-Value Store. In 2016 USENIX Annual Technical Conference, USENIX ATC 2016, Denver, CO, USA, June 22--24, 2016, , Ajay Gulati and Hakim Weatherspoon (Eds.). USENIX Association, 57--70."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/564870.564881"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3503221.3508412"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.14778\/3137628.3137659"},{"unstructured":"Redis. 2023. Redis. https:\/\/redis.io\/docs\/","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/3350755.3400237"},{"unstructured":"Avi Silberschatz Henry F. Korth and S. Sudarshan. 2020. Database System Concepts Seventh Edition. McGraw-Hill Book Company. https:\/\/www.db-book.com\/","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3437801.3441602"},{"key":"e_1_3_2_1_23_1","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. $$REMIX$$: Efficient Range Query for $$LSM-trees$$. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 51--64. io"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"acronym":"SPAA '24","name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660266","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:24:23Z","timestamp":1755879863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":23,"alternative-id":["10.1145\/3626183.3660266","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660266","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}