PIM-tree: A Skew-resistant Index for Processing-in-Memory
Summary: PIM-tree is the first implemented ordered index for real PIM hardware, combining shadow subtrees and chunked skip lists for scalable point queries, updates, and scans. Its push-pull search adapts CPU/PIM work to skew, guaranteeing low communication and balanced load. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hongbo Kang (Tsinghua University)
- 2. Yiwei Zhao (Carnegie Mellon University)
- 3. Guy E. Blelloch (Carnegie Mellon University)
- 4. Laxman Dhulipala (University of Maryland)
- 5. Yan Gu (University of California Riverside)
- 6. Charles McGuffey (Reed College)
- 7. Phillip B. Gibbons (Carnegie Mellon University)
BibTeX Citation
@article{kang_vldb23,
title = {{PIM-tree: A Skew-resistant Index for Processing-in-Memory}},
author = {Kang, Hongbo and Zhao, Yiwei and Blelloch, Guy E. and Dhulipala, Laxman and Gu, Yan and McGuffey, Charles and Gibbons, Phillip B.},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {4},
pages = {946--958},
doi = {10.14778/3574245.3574275},
url = {https://doi.org/10.14778/3574245.3574275},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,742 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 5.7862414e-05 |
| 7,067 | PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware | 2024 | SIGMOD | 5.7120928e-05 |
| 8,475 | Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees | 2025 | SIGMOD | 5.4171036e-05 |
| 10,971 | No Cap, This Memory Slaps: Breaking Through the Memory Wall of Transactional Database Systems with Processing-in-Memory | 2025 | VLDB | 5.093636e-05 |
| 11,080 | Analyzing Near-Network Hardware Acceleration with Co-Processing on DPUs | 2025 | VLDB | 5.093636e-05 |
| 11,204 | SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,342 | Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks | 2019 | SIGMOD | 0.00011098147 |
| 1,822 | PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors | 2011 | VLDB | 9.6765747e-05 |
| 2,426 | Active Storage For Large-Scale Data Mining and Multimedia | 1998 | VLDB | 8.5987569e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 2 | 477 | The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds | 2020 | VLDB |
| 3 | 3,378 | A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms | 2016 | SIGMOD |
| 4 | 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB |
| 5 | 2,707 | Evaluating Persistent Memory Range Indexes | 2020 | VLDB |
| 6 | 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD |
| 7 | 8,625 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR |
| 8 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 9 | 278 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD |
| 10 | 1,813 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |