A two-dimensional Scaling Plane model and DIAGONALSCALE algorithm enable diagonal scaling paths that reduce p95 latency by up to 40%, cost-per-query by up to 37%, and rebalancing by 2-5 times versus horizontal-only or vertical-only autoscaling in distributed databases.
Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Diagonal Scaling: A Multi-Dimensional Resource Model and Optimization Framework for Distributed Databases
A two-dimensional Scaling Plane model and DIAGONALSCALE algorithm enable diagonal scaling paths that reduce p95 latency by up to 40%, cost-per-query by up to 37%, and rebalancing by 2-5 times versus horizontal-only or vertical-only autoscaling in distributed databases.