{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:15:24Z","timestamp":1755839724420,"version":"3.44.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 34962"],"award-info":[{"award-number":["P 34962"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,5,29]]},"abstract":"<jats:p>Memory disaggregation separates compute (CPU) and main memory resources into disjoint physical units to enable elastic and independent scaling. Connected via high-speed RDMA-enabled networks, compute nodes can directly access remote memory. This setting often requires complex protocols with many network roundtrips as memory nodes have near-zero compute power.<\/jats:p>\n          <jats:p>In this paper, we design a scalable distributed inverted list index for disaggregated memory architectures. An inverted list index maps a set of terms to lists of documents that contain this term. Current solutions either partition the index horizontally or vertically with severe limitations in the disaggregated memory setting due to data and access skew, high network latency, or out-of-memory errors. Our method partitions lists into fixed-size blocks and spreads them across the memory nodes to balance skewed accesses. Block-based list processing keeps the memory footprint of compute nodes low and masks latency by interleaving remote accesses with expensive list operations. In addition, we propose efficient updates with optimistic concurrency control and read-write conflict detection. Our experiments confirm the efficiency and scalability of our method.<\/jats:p>","DOI":"10.1145\/3654974","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T09:44:53Z","timestamp":1717062293000},"page":"1-27","source":"Crossref","is-referenced-by-count":4,"title":["Scalable Distributed Inverted List Indexes in Disaggregated Memory"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0239-1474","authenticated-orcid":false,"given":"Manuel","family":"Widmoser","sequence":"first","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3742-5555","authenticated-orcid":false,"given":"Daniel","family":"Kocher","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3036-6201","authenticated-orcid":false,"given":"Nikolaus","family":"Augsten","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3317550.3321433"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.948"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2001.989733"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367846"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904485"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646158"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809948.2809952"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871595"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/333135.333136"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446713"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914808"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11902140_75"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516633.2516637"},{"key":"e_1_2_2_16_1","volume-title":"Fabr'i cio Benevenuto, and P. Krishna Gummadi","author":"Cha Meeyoung","year":"2010","unstructured":"Meeyoung Cha, Hamed Haddadi, Fabr'i cio Benevenuto, and P. Krishna Gummadi. 2010. Measuring User Influence in Twitter: The Million Follower Fallacy. In Proceedings of the Fourth International Conference on Weblogs and Social Media, ICWSM 2010, Washington, DC, USA, May 23--26, 2010, , William W. Cohen and Samuel Gosling (Eds.). The AAAI Press. http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/ICWSM10\/paper\/view\/1538"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536239"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1998.679488"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2014","author":"Dragojevic Aleksandar","year":"2014","unstructured":"Aleksandar Dragojevic, Dushyanth Narayanan, Miguel Castro, and Orion Hodson. 2014. FaRM: Fast Remote Memory. In Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2014, Seattle, WA, USA, April 2--4, 2014, Ratul Mahajan and Ion Stoica (Eds.). USENIX Association, 401--414. https:\/\/www.usenix.org\/conference\/nsdi14\/technical-sessions\/dragojevi%C4%87"},{"key":"e_1_2_2_21_1","volume-title":"Network Requirements for Resource Disaggregation. In 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016","author":"Gao Peter Xiang","year":"2016","unstructured":"Peter Xiang Gao, Akshay Narayan, Sagar Karandikar, Jo a o Carreira, Sangjin Han, Rachit Agarwal, Sylvia Ratnasamy, and Scott Shenker. 2016. Network Requirements for Resource Disaggregation. In 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016, Savannah, GA, USA, November 2--4, 2016, Kimberly Keeton and Timothy Roscoe (Eds.). USENIX Association, 249--264. https:\/\/www.usenix.org\/conference\/osdi16\/technical-sessions\/presentation\/gao"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934908"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326285.3329074"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--26850--7_1"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694384"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306--4573(91)90062-Q"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.342125"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378496"},{"key":"e_1_2_2_30_1","volume-title":"Farview: Disaggregated Memory with Operator Off-loading for Database Engines. In 12th Conference on Innovative Data Systems Research, CIDR 2022","author":"Korolija Dario","year":"2022","unstructured":"Dario Korolija, Dimitrios Koutsoukos, Kimberly Keeton, Konstantin Taranov, Dejan S. Milojicic, and Gustavo Alonso. 2022. Farview: Disaggregated Memory with Operator Off-loading for Database Engines. In 12th Conference on Innovative Data Systems Research, CIDR 2022, Chaminade, CA, USA, January 9--12, 2022. www.cidrdb.org. https:\/\/www.cidrdb.org\/cidr2022\/papers\/p11-korolija.pdf"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr133"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483561"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.09.005"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469--8.50048--6"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555789"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376682"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3629561"},{"key":"e_1_2_2_38_1","volume-title":"SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory. In 17th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2023","author":"Luo Xuchuan","year":"2023","unstructured":"Xuchuan Luo, Pengfei Zuo, Jiacheng Shen, Jiazhen Gu, Xin Wang, Michael R. Lyu, and Yangfan Zhou. 2023. SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory. In 17th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2023, Boston, MA, USA, July 10--12, 2023, Roxana Geambasu and Ed Nightingale (Eds.). USENIX Association, 553--571. https:\/\/www.usenix.org\/conference\/osdi23\/presentation\/luo"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.01.028"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878197"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412762"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947620"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2010.02.001"},{"key":"e_1_2_2_45_1","volume-title":"Waldspurger","author":"Maruf Hasan Al","year":"2021","unstructured":"Hasan Al Maruf, Yuhong Zhong, Hongyi Wang, Mosharaf Chowdhury, Asaf Cidon, and Carl A. Waldspurger. 2021. Memtrade: A Disaggregated-Memory Marketplace for Public Clouds. CoRR , Vol. abs\/2108.06893 (2021). showeprint[arXiv]2108.06893 https:\/\/arxiv.org\/abs\/2108.06893"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006--9014--4"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS51746.2020.00036"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--10424--4_17"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247566"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276695"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312663"},{"key":"e_1_2_2_52_1","volume-title":"Tailwind: Fast and Atomic RDMA-based Replication. In 2018 USENIX Annual Technical Conference, USENIX ATC 2018","author":"Taleb Yacine","year":"2018","unstructured":"Yacine Taleb, Ryan Stutsman, Gabriel Antoniu, and Toni Cortes. 2018. Tailwind: Fast and Atomic RDMA-based Replication. In 2018 USENIX Annual Technical Conference, USENIX ATC 2018, Boston, MA, USA, July 11--13, 2019, , Haryadi S. Gunawi and Benjamin C. Reed (Eds.). USENIX Association, 851--863. https:\/\/www.usenix.org\/conference\/atc18\/presentation\/taleb"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132762"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3090163.3090164"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911515"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517824"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00217"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767708"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367550"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397249"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-020-00355--7"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589276"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300081"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"e_1_2_2_65_1","volume-title":"One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory. In 2021 USENIX Annual Technical Conference, USENIX ATC 2021","author":"Zuo Pengfei","year":"2021","unstructured":"Pengfei Zuo, Jiazhao Sun, Liu Yang, Shuangwu Zhang, and Yu Hua. 2021. One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory. In 2021 USENIX Annual Technical Conference, USENIX ATC 2021, July 14--16, 2021, , Irina Calciu and Geoff Kuenning (Eds.). USENIX Association, 15--29. https:\/\/www.usenix.org\/conference\/atc21\/presentation\/zuo"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654974","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:37:58Z","timestamp":1755787078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,29]]}},"alternative-id":["10.1145\/3654974"],"URL":"https:\/\/doi.org\/10.1145\/3654974","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2024,5,29]]}}}