{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T03:55:50Z","timestamp":1769658950744,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":100,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2119352, CCF-2339310, CCF-2403235, CNS-2211882, CNS-2317194"],"award-info":[{"award-number":["CCF-2119352, CCF-2339310, CCF-2403235, CNS-2211882, CNS-2317194"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,28]]},"DOI":"10.1145\/3774934.3786411","type":"proceedings-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T15:25:57Z","timestamp":1769613957000},"page":"480-495","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["PIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2586-8311","authenticated-orcid":false,"given":"Yiwei","family":"Zhao","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9672-6490","authenticated-orcid":false,"given":"Hongbo","family":"Kang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7290-690X","authenticated-orcid":false,"given":"Ziyang","family":"Men","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4392-4022","authenticated-orcid":false,"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0224-9187","authenticated-orcid":false,"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-064X","authenticated-orcid":false,"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6281-4435","authenticated-orcid":false,"given":"Charles","family":"McGuffey","sequence":"additional","affiliation":[{"name":"Reed College, Portland, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6967-2735","authenticated-orcid":false,"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]}],"member":"320","published-online":{"date-parts":[[2026,1,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SOCG.2015.436"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178540"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386263.3411365"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.memori.2022.100022"},{"key":"e_1_3_2_1_7_1","volume-title":"Morton encoding\/decoding through bit interleaving: Implementations. https:\/\/www.forceflow.be\/2013\/10\/07\/morton-encodingdecoding-through-bit-interleaving-implementations\/ Accessed","author":"Baert Jeroen","year":"2025","unstructured":"Jeroen Baert. 2013. Morton encoding\/decoding through bit interleaving: Implementations. https:\/\/www.forceflow.be\/2013\/10\/07\/morton-encodingdecoding-through-bit-interleaving-implementations\/ Accessed December 2025"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592980.3595312"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109780"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977042.16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400227"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS62058.2024.00010"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-025-01974-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.02.008"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC67600.2025.11196211"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2025.3558075"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2024.3355038"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.6b01222"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3712285.3759777"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.012"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538591"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323191"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12241"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM62325.2024.10821790"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638483"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Dina Fakhry Mohamed Abdelsalam M. Watheq El-Kharashi and Mona Safar. 2023. An HBM3 Processing-In-Memory Architecture for Security and Data Integrity: Case Study. In Green Sustainability: Towards Innovative Digital Transformation Dalia Magdi Ahmed Abou El-Fetouh Mohamed Mamdouh and Amit Joshi (Eds.). 281\u2013293. isbn:978-981-99-4764-5 https:\/\/doi.org\/10.1007\/978-981-99-4764-5_18 10.1007\/978-981-99-4764-5_18","DOI":"10.1007\/978-981-99-4764-5_18"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO63174.2024.10715253"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3083897"},{"key":"e_1_3_2_1_33_1","unstructured":"Sahar Ghoflsaz Ghinani Jingyao Zhang and Elaheh Sadredini. 2025. Enabling Low-Cost Secure Computing on Untrusted In-Memory Architectures. arxiv:2501.17292. arxiv:2501.17292"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3558706"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755597"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC59245.2023.00030"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3174101"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2008.80"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-9666-7_21"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853659"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA57654.2024.00029"},{"key":"e_1_3_2_1_42_1","volume-title":"Intel In-Memory Analytics Accelerator (Intel IAA). https:\/\/www.intel.com\/content\/www\/us\/en\/products\/docs\/accelerator-engines\/in-memory-analytics-accelerator.html Accessed","year":"2025","unstructured":"Intel. 2025. Intel In-Memory Analytics Accelerator (Intel IAA). https:\/\/www.intel.com\/content\/www\/us\/en\/products\/docs\/accelerator-engines\/in-memory-analytics-accelerator.html Accessed December 2025"},{"key":"e_1_3_2_1_43_1","unstructured":"J. JaJa. 1992. Introduction to Parallel Algorithms."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSIT.2012.6242474"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.conbuildmat.2022.128890"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSIA.2017.8339084"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461816"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574275"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591070"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-025-00937-5"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2011.06.003"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463667"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3749646.3749690"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO61859.2024.00053"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00099"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC63849.2025.11132577"},{"key":"e_1_3_2_1_59_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). 1595\u20131598","author":"Liu Xingyu","year":"2015","unstructured":"Xingyu Liu, Yangdong Deng, Yufei Ni, and Zonghui Li. 2015. FastTree: A hardware KD-tree construction acceleration engine for real-time ray tracing. In 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE). 1595\u20131598."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087582"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743339"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3774934.3786412"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709712"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673094"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","unstructured":"Onur Mutlu Saugata Ghose Juan G\u00f3mez-Luna and Rachata Ausavarungnirun. 2023. A Modern Primer on Processing in\u00a0Memory. 171\u2013243. isbn:978-981-16-7487-7 https:\/\/doi.org\/10.1007\/978-981-16-7487-7_7 10.1007\/978-981-16-7487-7_7","DOI":"10.1007\/978-981-16-7487-7_7"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.3390\/math12132115"},{"key":"e_1_3_2_1_68_1","unstructured":"Mohammed Otair. 2013. Approximate k-nearest neighbour based spatial clustering using k-d tree. arxiv:1303.1951. arxiv:1303.1951"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.3390\/s22051701"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00024"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-68085-4"},{"key":"e_1_3_2_1_72_1","volume-title":"UPMEM Technology. https:\/\/www.upmem.com\/technology\/ Accessed","year":"2025","unstructured":"Qualcomm. 2025. UPMEM Technology. https:\/\/www.upmem.com\/technology\/ Accessed August 2025"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330875"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1051\/0004-6361\/201322593"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"e_1_3_2_1_76_1","volume-title":"Samsung PIM Technology. https:\/\/semiconductor.samsung.com\/technologies\/memory\/pim\/ Accessed","year":"2025","unstructured":"Samsung. 2025. Samsung PIM Technology. https:\/\/semiconductor.samsung.com\/technologies\/memory\/pim\/ Accessed December 2025"},{"key":"e_1_3_2_1_77_1","volume-title":"On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM).","author":"Sanders Peter","year":"1996","unstructured":"Peter Sanders. 1996. On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM)."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1086\/516585"},{"key":"e_1_3_2_1_79_1","unstructured":"Luc Segoufin and Alexandre Vigny. 2017. Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. In ICDT. Venise Italy. https:\/\/inria.hal.science\/hal-01589303"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3190958"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD63220.2024.00018"},{"key":"e_1_3_2_1_82_1","volume-title":"Morton Order - Introduction. https:\/\/johnsietsma.com\/2019\/12\/05\/morton-order-introduction\/ Accessed","author":"Sietsma John","year":"2025","unstructured":"John Sietsma. 2019. Morton Order - Introduction. https:\/\/johnsietsma.com\/2019\/12\/05\/morton-order-introduction\/ Accessed December 2025"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3016078.2851147"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132167"},{"key":"e_1_3_2_1_85_1","first-page":"044","article-title":"Method and system for latent dirichlet allocation2 computation using approximate counters","volume":"10","author":"Steele Guy L","year":"2018","unstructured":"Guy L Steele Jr and Jean-Baptiste Tristan. 2018. Method and system for latent dirichlet allocation2 computation using approximate counters. US Patent 10,147,044","journal-title":"US Patent"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1970.5008902"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3652892.3700782"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582026"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2023922879"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2022.107348"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-018-0571-0"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS51385.2021.00041"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3094854"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658617.3697627"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743318"},{"key":"e_1_3_2_1_97_1","volume-title":"Syed Shakib Sarwar, Kleber Hugo Stangherlin, Yi-Lun Lu, Jorge Tomas Gomez, Jae-Sun Seo, Phillip B. Gibbons, Barbara De Salvo, and Chiao Liu.","author":"Zhao Yiwei","year":"2024","unstructured":"Yiwei Zhao, Ziyun Li, Win-San Khwa, Xiaoyu Sun, Sai Qian Zhang, Syed Shakib Sarwar, Kleber Hugo Stangherlin, Yi-Lun Lu, Jorge Tomas Gomez, Jae-Sun Seo, Phillip B. Gibbons, Barbara De Salvo, and Chiao Liu. 2024. Neural Architecture Search of Hybrid Models for NPU-CIM Heterogeneous AR\/VR Devices. arxiv:2410.08326."},{"key":"e_1_3_2_1_98_1","volume-title":"Gibbons","author":"Zhao Yiwei","year":"2025","unstructured":"Yiwei Zhao, Qiushi Lin, Hongbo Kang, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, and Phillip B. Gibbons. 2025. TD-Orch: Scalable Load-Balancing for Distributed Systems with Applications to Graph Processing. arxiv:2511.11843."},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3114865"},{"key":"e_1_3_2_1_100_1","volume-title":"Human behavior and the principle of least effort: An introduction to human ecology","author":"Zipf George Kingsley","unstructured":"George Kingsley Zipf. 2016. Human behavior and the principle of least effort: An introduction to human ecology. Ravenio Books."}],"event":{"name":"PPoPP '26: 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","location":"Sydney NSW Australia","acronym":"PPoPP '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774934.3786411","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774934.3786411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T15:26:29Z","timestamp":1769613989000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774934.3786411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,28]]},"references-count":100,"alternative-id":["10.1145\/3774934.3786411","10.1145\/3774934"],"URL":"https:\/\/doi.org\/10.1145\/3774934.3786411","relation":{},"subject":[],"published":{"date-parts":[[2026,1,28]]},"assertion":[{"value":"2026-01-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}