An Experimental Evaluation and Investigation of Waves of Misery in R-trees
Lu Xing, Eric Lee, Tong An, Bo-Cheng Chu, Ahmed Mahmood, Ahmed M. Aly, Jianguo Wang, Walid G. Aref
Abstract
Waves of misery is a phenomenon where spikes of many node splits occur over short periods of time in tree indexes. Waves of misery negatively affect the performance of tree indexes in insertion-heavy workloads. Waves of misery have been first observed in the context of the B-tree, where these waves cause unpredictable index performance. In particular, the performance of search and index-update operations deteriorate when a wave of misery takes place, but is more predictable between the waves. This paper investigates the presence or lack of waves of misery in several R-tree variants, and studies the extent of which these waves impact the performance of each variant. Interestingly, although having poorer query performance, the Linear and Quadratic R-trees are found to be more resilient to waves of misery than both the Hilbert and R*-trees. This paper presents several techniques to reduce the impact in performance of the waves of misery for the Hilbert and R*-trees. One way to eliminate waves of misery is to force node splits to take place at regular times before nodes become full to achieve deterministic performance. The other way is that upon splitting a node, do not split it evenly but rather at different node utilization factors. This allows leaf nodes not to fill at the same pace. We study the impact of two new techniques to mitigate waves of misery after the tree index has been constructed, namely Regular Elective Splits (RES, for short) and Unequal Random Splits (URS, for short). Our experimental investigation highlights the trade-offs in performance of the introduced techniques and the pros and cons of each technique.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
2 top-tier papers have cited it since. Know what they found before your reviewers do.
Lune can draw on
the full paper · the top-tier papers that cite it · related work
Free to start. No credit card required.
Lineage
Cited by top-tier papers2
Related papers
- Adaptive Indexing of Objects with Spatial ExtentFatemeh Zardbani, Nikos Mamoulis, Stratos Idreos, Panagiotis KarrasVLDB 2023 · 15 citations
- Hybrid DRAM-NVM R-Trees with Consistency GuaranteeKaiqi Zhang, Chengyou Shen, Siyuan Zhang, Shengfei Shi et al.ICDE 2025 · 2 citations
- The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial DataTu Gu, Kaiyu Feng, Gao Cong, Cheng Long et al.SIGMOD 2023 · 62 citations
- PLATON: Top-down R-tree Packing with Learned Partition PolicyJingyi Yang, Gao CongSIGMOD 2024 · 12 citations
- Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDsDiego Didona, Nikolas Ioannou, Radu Stoica, Kornilios KourtisVLDB 2021 · 16 citations
