{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:18Z","timestamp":1750309458526,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3703693","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"430-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent and Learned Data Structures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2742-4028","authenticated-orcid":false,"given":"Bapi","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, IIIT Delhi, Delhi, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-7929","authenticated-orcid":false,"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Hyderabad, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"M. Arbel-Raviv and T. Brown. 2018. Harnessing epoch-based reclamation for efficient range queries. ACM SIGPLAN Notices 53 1 (2018) 14\u201327.","DOI":"10.1145\/3200691.3178489"},{"key":"e_1_3_3_1_3_2","first-page":"295","volume-title":"USENIX","author":"Arbel-Raviv M.","year":"2018","unstructured":"M. Arbel-Raviv, T. Brown, and A. Morrison. 2018. Getting to the root of concurrent binary search tree performance. In USENIX. 295\u2013306."},{"key":"e_1_3_3_1_4_2","first-page":"271","volume-title":"SODA","author":"Arya Sunil","year":"1993","unstructured":"Sunil Arya and David\u00a0M Mount. 1993. Approximate nearest neighbor queries in fixed dimensions.. In SODA , Vol.\u00a093. Citeseer, 271\u2013280."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673082"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312016"},{"key":"e_1_3_3_1_7_2","unstructured":"Trevor Brown. 2017. Techniques for Constructing Efficient Lock-free Data Structures. CoRR abs\/1712.05406 (2017). arXiv:https:\/\/arXiv.org\/abs\/1712.05406http:\/\/arxiv.org\/abs\/1712.05406"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_15"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374542"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508410"},{"key":"e_1_3_3_1_12_2","volume-title":"Lock-free Concurrent Search","author":"Chatterjee Bapi","year":"2017","unstructured":"Bapi Chatterjee. 2017. Lock-free Concurrent Search. Chalmers Tekniska Hogskola (Sweden)."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611500"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2016.48"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154307"},{"key":"e_1_3_3_1_16_2","volume-title":"CIDR","author":"Crotty Andrew","year":"2021","unstructured":"Andrew Crotty. 2021. Hist-Tree: Those Who Ignore It Are Doomed to Learn.. In CIDR."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Paolo Ferragina and Giorgio Vinciguerra. 2020. The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proceedings of the VLDB Endowment 13 8 (2020) 1162\u20131175.","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"M.\u00a0P. Herlihy and J.\u00a0M. Wing. 1990. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS 12 3 (1990) 463\u2013492.","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312036"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3401071.3401659"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508437"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Hai Lan Zhifeng Bao J\u00a0Shane Culpepper and Renata Borovica-Gajic. 2023. Updatable learned indexes meet disk-resident DBMS-from evaluations to design choices. Proceedings of the ACM on Management of Data 1 2 (2023) 1\u201322.","DOI":"10.1145\/3589284"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Pengfei Li Yu Hua Jingnan Jia and Pengfei Zuo. 2021. FINEdex: a fine-grained learned index scheme for scalable and concurrent memory systems. Proceedings of the VLDB Endowment 15 2 (2021) 321\u2013334.","DOI":"10.14778\/3489496.3489512"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452838"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Aravind Natarajan Arunmoezhi Ramachandran and Neeraj Mittal. 2020. FEAST: a lightweight lock-free concurrent binary search tree. ACM TOPC 7 2 (2020) 1\u201364.","DOI":"10.1145\/3391438"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441614"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Patrick O\u2019Neil Edward Cheng Dieter Gawlick and Elizabeth O\u2019Neil. 1996. The log-structured merge-tree (LSM-tree). Acta Informatica 33 4 (1996) 351\u2013385.","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Yongxin Peng. 2024. LK-Index: A Learned Index for KNN Queries. IEEE Access (2024).","DOI":"10.1109\/ACCESS.2024.3433524"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"crossref","unstructured":"Nir Shavit and Gadi Taubenfeld. 2016. The computability of relaxed data structures: queues and stacks as examples. Distributed Computing 29 (2016) 395\u2013407.","DOI":"10.1007\/s00446-016-0272-0"},{"key":"e_1_3_3_1_35_2","unstructured":"Gali Sheffi Pedro Ramalhete and Erez Petrank. 2022. EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2210.17086 (2022)."},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508441"},{"key":"e_1_3_3_1_37_2","unstructured":"Mihail Stoian Andreas Kipf Ryan Marcus and Tim Kraska. 2021. PLEX: Towards Practical Learned Indexing. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2108.05117 (2021)."},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374547"},{"key":"e_1_3_3_1_39_2","unstructured":"Yifan Wang Haodi Ma and Daisy\u00a0Zhe Wang. 2022. Lider: An efficient high-dimensional learned index for large-scale dense passage retrieval. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2205.00970 (2022)."},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441602"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"crossref","unstructured":"Chaichon Wongkham Baotong Lu Chris Liu Zhicong Zhong Eric Lo and Tianzheng Wang. 2022. Are updatable learned indexes ready? Proceedings of the VLDB Endowment 15 11 (2022) 3004\u20133017.","DOI":"10.14778\/3551793.3551848"},{"key":"e_1_3_3_1_43_2","unstructured":"Jiacheng Wu Yong Zhang Shimin Chen Jin Wang Yu Chen and Chunxiao Xing. 2021. Updatable learned index with precise positions. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2104.05520 (2021)."}],"event":{"name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2025","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3703693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3703693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3703693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":42,"alternative-id":["10.1145\/3700838.3703693","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3703693","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}