{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:12Z","timestamp":1750220832984,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"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":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400237","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"571-573","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Concurrent Range Queries in B+-trees using RCU-HTM"],"prefix":"10.1145","author":[{"given":"Dimitrios","family":"Siakavaras","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Billis","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Nikas","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Goumas","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611471"},{"key":"e_1_3_2_1_2_1","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Arbel-Raviv Maya","year":"2018","unstructured":"Maya Arbel-Raviv , Trevor Brown , and Adam Morrison . 2018 . Getting to the Root of Concurrent Binary Search Tree Performance . In 2018 USENIX Annual Technical Conference (USENIX ATC 18) . USENIX Association, Boston, MA, 295--306. https:\/\/www.usenix.org\/conference\/atc18\/presentation\/arbel-raviv Maya Arbel-Raviv, Trevor Brown, and Adam Morrison. 2018. Getting to the Root of Concurrent Binary Search Tree Performance. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). USENIX Association, Boston, MA, 295--306. https:\/\/www.usenix.org\/conference\/atc18\/presentation\/arbel-raviv"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087834"},{"key":"e_1_3_2_1_4_1","volume-title":"16th International Conference, OPODIS 2012, Rome, Italy, December 18--20, 2012. Proceedings. 31--45","author":"Brown Trevor","year":"2012","unstructured":"Trevor Brown and Hillel Avni . 2012 . Range Queries in Non-blocking k-ary Search Trees. In Principles of Distributed Systems , 16th International Conference, OPODIS 2012, Rome, Italy, December 18--20, 2012. Proceedings. 31--45 . https:\/\/doi.org\/10.1007\/978--3--642--35476--2_3 10.1007\/978--3--642--35476--2_3 Trevor Brown and Hillel Avni. 2012. Range Queries in Non-blocking k-ary Search Trees. In Principles of Distributed Systems, 16th International Conference, OPODIS 2012, Rome, Italy, December 18--20, 2012. Proceedings. 31--45. https:\/\/doi.org\/10.1007\/978--3--642--35476--2_3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","key":"e_1_3_2_1_6_1","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The Art of Multiprocessor Programming . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"volume-title":"Languages and Compilers for Parallel Computing","author":"Sagonas Konstantinos","key":"e_1_3_2_1_7_1","unstructured":"Konstantinos Sagonas and Kjell Winblad . 2016. Efficient Support for Range Queries and Range Updates Using Contention Adapting Search Trees . In Languages and Compilers for Parallel Computing , Xipeng Shen, Frank Mueller, and James Tuck (Eds.). Springer International Publishing , Cham , 37--53. Konstantinos Sagonas and Kjell Winblad. 2016. Efficient Support for Range Queries and Range Updates Using Contention Adapting Search Trees. In Languages and Compilers for Parallel Computing, Xipeng Shen, Frank Mueller, and James Tuck (Eds.). Springer International Publishing, Cham, 37--53."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.17"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":8,"alternative-id":["10.1145\/3350755.3400237","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400237","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}