PIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory
Open Access
- 28 January 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 480-495
Abstract
No abstract availableFunding Information
- NSF (National Science Foundation) (CCF-2119352, CCF-2339310, CCF-2403235, CNS-2211882, CNS-2317194)
This publication has 84 references indexed in Scilit:
- An Experimental Exploration of In-Memory Computing for Multi-Layer PerceptronsJournal of Signal Processing Systems, 2025
- PIM-tree: A Skew-resistant Index for Processing-in-MemoryThe VLDB Journal, 2025
- QuadSampling: A Novel Sampling Method for Remote Implicit Neural 3D Reconstruction Based on Quad-Tree2024
- An HBM3 Processing-In-Memory Architecture for Security and Data Integrity: Case Study2023
- Cloud service selection based on weighted KD tree nearest neighbor searchApplied Soft Computing, 2022
- Rapid citrus harvesting motion planning with pre-harvesting point and quad-treeComputers and Electronics in Agriculture, 2022
- Automatic mesoscopic fracture modelling of concrete based on enriched SBFEM space and quad-tree meshConstruction and Building Materials, 2022
- A Modern Primer on Processing in Memory2022
- Fast neighbor search by using revised k-d treeInformation Sciences, 2019
- Parallel kd-Tree Construction on the GPU with an Adaptive Split and Sort StrategyInternational Journal of Parallel Programming, 2018