{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T18:34:49Z","timestamp":1758652489498,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,12]]},"DOI":"10.1145\/3673038.3673082","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T18:29:01Z","timestamp":1723141741000},"page":"252-261","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Kanva: A Lock-free Learned Search Data Structure"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2342-3933","authenticated-orcid":false,"given":"Gaurav","family":"Bhardwaj","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Hyderabad., India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2742-4028","authenticated-orcid":false,"given":"Bapi","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3565-3242","authenticated-orcid":false,"given":"Abhinav","family":"Sharma","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-7929","authenticated-orcid":false,"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4071-1022","authenticated-orcid":false,"given":"Siddharth","family":"Nayak","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"18th August 2022. Amazon sales rank data for print and kindle books.https:\/\/www.kaggle.com\/datasets\/ucffool\/amazon-sales-rank-data-for-print-and-kindle-books\/."},{"key":"e_1_3_2_1_2_1","unstructured":"18th August 2022. Wikimedia. https:\/\/dumps.wikimedia.org\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178489"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Arbel-Raviv T. Brown and A. Morrison. 2018. Getting to the root of concurrent binary search tree performance. In USENIX. 295\u2013306."},{"volume-title":"24th annual ACM SPAA. 58\u201367.","author":"Braginsky Anastasia","key":"e_1_3_2_1_5_1","unstructured":"Anastasia Braginsky and Erez Petrank. 2012. A lock-free B+ tree. In 24th annual ACM SPAA. 58\u201367."},{"key":"e_1_3_2_1_6_1","volume-title":"Techniques for Constructing Efficient Lock-free Data Structures. CoRR abs\/1712.05406","author":"Brown Trevor","year":"2017","unstructured":"Trevor Brown. 2017. Techniques for Constructing Efficient Lock-free Data Structures. CoRR abs\/1712.05406 (2017). arXiv:1712.05406http:\/\/arxiv.org\/abs\/1712.05406"},{"volume-title":"19th ACM SIGPLAN PPOPP. 329\u2013342.","author":"Brown Trevor","key":"e_1_3_2_1_7_1","unstructured":"Trevor Brown, Faith Ellen, and Eric Ruppert. 2014. A general technique for non-blocking trees. In 19th ACM SIGPLAN PPOPP. 329\u2013342."},{"volume-title":"Non-blocking k-ary search trees","author":"Brown Trevor","key":"e_1_3_2_1_8_1","unstructured":"Trevor Brown and Joanna Helga. 2011. Non-blocking k-ary search trees. In OPODIS. Springer, 207\u2013221."},{"volume-title":"25th ACM PPOPP. 276\u2013291.","author":"Brown Trevor","key":"e_1_3_2_1_9_1","unstructured":"Trevor Brown, Aleksandar Prokopec, and Dan Alistarh. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. In 25th ACM PPOPP. 276\u2013291."},{"volume-title":"27th ACM SIGPLAN PPOPP. 385\u2013399.","author":"Brown Trevor","key":"e_1_3_2_1_10_1","unstructured":"Trevor Brown, William Sigouin, and Dan Alistarh. 2022. PathCAS: an efficient middle ground for concurrent search data structures. In 27th ACM SIGPLAN PPOPP. 385\u2013399."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Trevor\u00a0Alexander Brown. 2015. Reclaiming memory for lock-free data structures: There has to be a better way. In PODC. 261\u2013270.","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Bapi Chatterjee Nhan Nguyen and Philippas Tsigas. 2014. Efficient lock-free binary search trees. In 2014 ACM PODC. 322\u2013331.","DOI":"10.1145\/2611462.2611500"},{"volume-title":"1st ACM SOCC. 143\u2013154.","author":"Cooper F","key":"e_1_3_2_1_14_1","unstructured":"Brian\u00a0F Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. 2010. Benchmarking cloud serving systems with YCSB. In 1st ACM SOCC. 143\u2013154."},{"key":"e_1_3_2_1_15_1","unstructured":"Andrew Crotty. 2021. Hist-Tree: Those Who Ignore It Are Doomed to Learn.. In CIDR."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Jialin Ding Umar\u00a0Farooq Minhas Jia Yu Chi Wang Jaeyoung Do Yinan Li Hantian Zhang Badrish Chandramouli Johannes Gehrke Donald Kossmann 2020. ALEX: an updatable adaptive learned index. In 2020 ACM SIGMOD. 969\u2013984.","DOI":"10.1145\/3318464.3389711"},{"volume-title":"29th ACM SIGACT-SIGOPS. 131\u2013140.","author":"Ellen F.","key":"e_1_3_2_1_17_1","unstructured":"F. Ellen, P. Fatourou, E. Ruppert, and F. van Breugel. 2010. Non-blocking binary search trees. In 29th ACM SIGACT-SIGOPS. 131\u2013140."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_2_1_21_1","unstructured":"M. Herlihy Y. Lev V. Luchangco and N. Shavit. 2006. A provably correct scalable concurrent skip list. In OPODIS. 103."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S.\u00a0V. Howley and J. Jones. 2012. A non-blocking internal binary search tree. In 24th annual ACM SPAA. 161\u2013171.","DOI":"10.1145\/2312005.2312036"},{"key":"e_1_3_2_1_24_1","volume-title":"SOSD: A benchmark for learned indexes. arXiv preprint arXiv:1911.13014","author":"Kipf A.","year":"2019","unstructured":"A. Kipf, R. Marcus, A. van Renen, M. Stoian, A. Kemper, T. Kraska, and T. Neumann. 2019. SOSD: A benchmark for learned indexes. arXiv preprint arXiv:1911.13014 (2019)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"A. Kipf R. Marcus A. van Renen M. Stoian A. Kemper T. Kraska and T. Neumann. 2020. RadixSpline: a single-pass learned index. In In 3rd aiDM. 1\u20135.","DOI":"10.1145\/3401071.3401659"},{"volume-title":"27th ACM PPOPP. 400\u2013415.","author":"Kobus Tadeusz","key":"e_1_3_2_1_26_1","unstructured":"Tadeusz Kobus, Maciej Kokoci\u0144ski, and Pawe\u0142\u00a0T Wojciechowski. 2022. Jiffy: a lock-free skip list with batch updates and snapshots. In 27th ACM PPOPP. 400\u2013415."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Tim Kraska Alex Beutel Ed\u00a0H Chi Jeffrey Dean and Neoklis Polyzotis. 2018. The case for learned index structures. In ACM SIGMOD. 489\u2013504.","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489512"},{"volume-title":"19th ACM SIGPLAN PPOPP. 317\u2013328.","author":"Natarajan Aravind","key":"e_1_3_2_1_29_1","unstructured":"Aravind Natarajan and Neeraj Mittal. 2014. Fast concurrent lock-free binary search trees. In 19th ACM SIGPLAN PPOPP. 317\u2013328."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391438"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441614"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_33_1","volume-title":"How good are modern spatial analytics systems?Proceedings of the VLDB Endowment 11, 11","author":"Pandey Varun","year":"2018","unstructured":"Varun Pandey, Andreas Kipf, Thomas Neumann, and Alfons Kemper. 2018. How good are modern spatial analytics systems?Proceedings of the VLDB Endowment 11, 11 (2018), 1661\u20131673."},{"key":"e_1_3_2_1_34_1","volume-title":"A lock-free approach to parallelizing stochastic gradient descent. NIPS 24","author":"Recht Benjamin","year":"2011","unstructured":"Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu. 2011. Hogwild!: A lock-free approach to parallelizing stochastic gradient descent. NIPS 24 (2011)."},{"key":"e_1_3_2_1_35_1","volume-title":"EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. In 26th OPODIS.","author":"Sheffi Gali","year":"2023","unstructured":"Gali Sheffi, Pedro Ramalhete, and Erez Petrank. 2023. EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. In 26th OPODIS."},{"volume-title":"27th ACM PPOPP. 416\u2013430.","author":"Srivastava Anubhav","key":"e_1_3_2_1_36_1","unstructured":"Anubhav Srivastava and Trevor Brown. 2022. Elimination (a, b)-trees with fast, durable updates. In 27th ACM PPOPP. 416\u2013430."},{"key":"e_1_3_2_1_37_1","volume-title":"PLEX: Towards Practical Learned Indexing. arXiv preprint arXiv:2108.05117","author":"Stoian Mihail","year":"2021","unstructured":"Mihail Stoian, Andreas Kipf, Ryan Marcus, and Tim Kraska. 2021. PLEX: Towards Practical Learned Indexing. arXiv preprint arXiv:2108.05117 (2021)."},{"volume-title":"25th PPOPP. 308\u2013320.","author":"Tang Chuzhe","key":"e_1_3_2_1_38_1","unstructured":"Chuzhe Tang, Youyun Wang, Zhiyuan Dong, Gansen Hu, Zhaoguo Wang, Minjie Wang, and Haibo Chen. 2020. XIndex: a scalable learned index for multicore data storage. In 25th PPOPP. 308\u2013320."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Peter Van\u00a0Sandt Yannis Chronis and Jignesh\u00a0M Patel. 2019. Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?. In 2019 SIGMOD. 36\u201353.","DOI":"10.1145\/3299869.3300075"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Z. Wang A. Pavlo H. Lim V. Leis H. Zhang M. Kaminsky and D.\u00a0G. Andersen. 2018. Building a bw-tree takes more than just buzz words. In ACM SIGMOD. 473\u2013488.","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Yuanhao Wei Naama Ben-David Guy\u00a0E Blelloch Panagiota Fatourou Eric Ruppert and Yihan Sun. 2021. Constant-time snapshots with applications to concurrent data structures. In PPoPP. 31\u201346.","DOI":"10.1145\/3437801.3441602"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457393"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0355-0"}],"event":{"name":"ICPP '24: the 53rd International Conference on Parallel Processing","acronym":"ICPP '24","location":"Gotland Sweden"},"container-title":["Proceedings of the 53rd International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673038.3673082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3673038.3673082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T17:29:00Z","timestamp":1758648540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673038.3673082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":43,"alternative-id":["10.1145\/3673038.3673082","10.1145\/3673038"],"URL":"https:\/\/doi.org\/10.1145\/3673038.3673082","relation":{},"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"2024-08-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}