Spatiotemporal Load Balancing for Near-Memory Accelerated Databases by Partial Resharding
This paper proposes an extension of query density-driven partitioning to support dynamically changing workloads and achieves significantly higher throughput than PIM-tree, a skew-resistant state-of-the-art data structure, during periods without workload changes.