Query density-driven partitioning balances query and data loads across PIM processors, enabling B+-Forest to support range-aggregate queries while matching PIM-tree on point gets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Query Density-Driven Partitioning for Spatiotemporal Load Balancing on Processing-in-Memory Systems
Query density-driven partitioning balances query and data loads across PIM processors, enabling B+-Forest to support range-aggregate queries while matching PIM-tree on point gets.