{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T07:55:07Z","timestamp":1778313307145,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3754598.3754655","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"218-227","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Bridging Cache-Friendliness and Concurrency: A Locality-Optimized In-Memory B-Skiplist"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1060-3246","authenticated-orcid":false,"given":"Yicong","family":"Luo","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1554-2440","authenticated-orcid":false,"given":"Senhe","family":"Hao","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2018-4577","authenticated-orcid":false,"given":"Brian","family":"Wheatman","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5576-0320","authenticated-orcid":false,"given":"Prashant","family":"Pandey","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2232-3305","authenticated-orcid":false,"given":"Helen","family":"Xu","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"[n. d.]. folly. https:\/\/github.com\/facebook\/folly. Last accessed 2\/26\/25."},{"key":"e_1_3_3_2_3_2","unstructured":"[n. d.]. ParallelTools. https:\/\/github.com\/wheatman\/ParallelTools. Last accessed 1\/16\/25."},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Alok Aggarwal and Jeffrey\u00a0S. Vitter. 1988. The input\/output complexity of sorting and related problems. Commun. ACM 31 9 (Sept. 1988) 1116\u20131127.","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Rudolf Bayer and Edward\u00a0M. McCreight. 1972. Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1 3 (1972) 173\u2013189.","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902276"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056117"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Pierre-Jacques Courtois Frans Heymans and David\u00a0Lorge Parnas. 1971. Concurrent control with \u201creaders\u201d and \u201cwriters\u201d. Commun. ACM 14 10 (1971) 667\u2013668.","DOI":"10.1145\/362759.362813"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.42"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011776"},{"key":"e_1_3_3_2_12_2","volume-title":"Practical lock-freedom","author":"Fraser Keir","year":"2004","unstructured":"Keir Fraser. 2004. Practical lock-freedom. Technical Report. University of Cambridge, Computer Laboratory."},{"key":"e_1_3_3_2_13_2","unstructured":"Daniel Golovin. 2010. The B-skip-list: A simpler uniquely represented alternative to B-trees. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1005.0662 (2010)."},{"key":"e_1_3_3_2_14_2","unstructured":"HBase. [n. d.]. https:\/\/hbase.apache.org\/. Last accessed 10\/20\/2022."},{"key":"e_1_3_3_2_15_2","volume-title":"OPODIS","author":"Herlihy Maurice","year":"2006","unstructured":"Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. 2006. A provably correct scalable concurrent skip list. In OPODIS, Vol.\u00a0103."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.5555\/1760631.1760646"},{"key":"e_1_3_3_2_17_2","volume-title":"The art of multiprocessor programming","author":"Herlihy Maurice","year":"2020","unstructured":"Maurice Herlihy, Nir Shavit, Victor Luchangco, and Michael Spear. 2020. The art of multiprocessor programming. Newnes."},{"key":"e_1_3_3_2_18_2","unstructured":"Java. [n. d.]. https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/ConcurrentSkipListSet.html. Last accessed 1\/3\/2025."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"H.T. Kung and John\u00a0T. Robinson. 1981. On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS) 6 2 (1981) 213\u2013226.","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359635"},{"key":"e_1_3_3_2_21_2","unstructured":"LevelDB. [n. d.]. https:\/\/github.com\/google\/leveldb. Last accessed 10\/20\/2022."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Yedam Na Bonmoo Koo Taeyoon Park Jonghyeok Park and Wook-Hee Kim. 2023. ESL: A High-Performance Skiplist with Express Lane. Applied Sciences 13 17 (2023) 9925.","DOI":"10.3390\/app13179925"},{"key":"e_1_3_3_2_25_2","volume-title":"Pthreads programming: A POSIX standard for better multiprocessing","author":"Nichols Bradford","year":"1996","unstructured":"Bradford Nichols, Dick Buttlar, Jacqueline Farrell, and Jackie Farrell. 1996. Pthreads programming: A POSIX standard for better multiprocessing. \" O\u2019Reilly Media, Inc.\"."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00157"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.5555\/93717"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"William Pugh. 1990. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33 6 (1990) 668\u2013676.","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_3_2_29_2","unstructured":"RocksDB. [n. d.]. http:\/\/rocksdb.org\/. Last accessed 10\/20\/2022."},{"key":"e_1_3_3_2_30_2","first-page":"1","volume-title":"Data Management on New Hardware","author":"Sprenger Stefan","year":"2016","unstructured":"Stefan Sprenger, Steffen Zeuch, and Ulf Leser. 2016. Cache-sensitive skip list: Efficient range queries on modern CPUs. In Data Management on New Hardware. Springer, 1\u201317."},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.54"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Helen Xu Amanda Li Brian Wheatman Manoj Marneni and Prashant Pandey. 2023. BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees. Proc. VLDB Endow. 16 11 (July 2023) 2976\u20132989. 10.14778\/3611479.3611502","DOI":"10.14778\/3611479.3611502"},{"key":"e_1_3_3_2_33_2","unstructured":"YCSB. [n. d.]. Core Workloads. https:\/\/github.com\/brianfrankcooper\/YCSB\/wiki\/Core-Workloads. Last accessed 2\/15\/2023."},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"crossref","unstructured":"Jingtian Zhang Sai Wu Zeyuan Tan Gang Chen Zhushi Cheng Wei Cao Yusong Gao and Xiaojie Feng. 2019. S3: a scalable in-memory skip-list index for key-value store. Proceedings of the VLDB Endowment 12 12 (2019) 2183\u20132194.","DOI":"10.14778\/3352063.3352134"}],"event":{"name":"ICPP '25: 54th International Conference on Parallel Processing","location":"San Diego CA USA","acronym":"ICPP '25"},"container-title":["Proceedings of the 54th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3754598.3754655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:35:44Z","timestamp":1766219744000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":33,"alternative-id":["10.1145\/3754598.3754655","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754655","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}