PIM-tree: A Skew-resistant Index for Processing-in-Memory
Summary: PIM-tree: a skew-resistant ordered PIM index that splits work between CPU and PIM nodes and uses push-pull search to push queries or pull keys to adapt to skew. On UPMEM, with shadow subtrees and chunked skip lists, it yields low communication, balanced load, and up to 69.7x throughput vs prior PIM indexes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hongbo Kang
- 2. Yiwei Zhao
- 3. Guy E. Blelloch
- 4. Laxman Dhulipala
- 5. Yan Gu
- 6. Charles McGuffey
- 7. Phillip B. Gibbons
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,154 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 4.815267e-05 |
| 9,267 | PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware | 2024 | SIGMOD | 4.3663649e-05 |
| 9,529 | Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees | 2025 | SIGMOD | 4.32934e-05 |
| 10,730 | No Cap, This Memory Slaps: Breaking Through the Memory Wall of Transactional Database Systems with Processing-in-Memory | 2025 | VLDB | 4.1945683e-05 |
| 10,856 | Analyzing Near-Network Hardware Acceleration with Co-Processing on DPUs | 2025 | VLDB | 4.1945683e-05 |
| 10,993 | SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs | 2024 | SIGMOD | 4.1945683e-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,852 | Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks | 2019 | SIGMOD | 0.00010322492 |
| 2,006 | PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors | 2011 | VLDB | 9.8101551e-05 |
| 2,089 | Active Storage For Large-Scale Data Mining and Multimedia | 1998 | VLDB | 9.5657612e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,562 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1945683e-05 |
| 857 | The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds | 2020 | VLDB | 0.00015882892 |
| 3,777 | A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms | 2016 | SIGMOD | 6.7750901e-05 |
| 2,992 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB | 7.7693475e-05 |
| 3,470 | Evaluating Persistent Memory Range Indexes | 2020 | VLDB | 7.0655357e-05 |
| 531 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00020790058 |
| 8,347 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR | 4.5410746e-05 |
| 6,229 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD | 5.1463389e-05 |
| 381 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD | 0.00024873637 |
| 1,809 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 0.00010483957 |