PLATON: top-down R-tree packing with learned partition policy
The exponential growth of spatial data poses new challenges to the performance of spatial databases. Spatial indexes like R-tree greatly accelerate the query performance and can be effectively constructed through packing, i.e., loading all data into the index at once. However, existing R-tree packin...
Saved in:
Main Authors: | Yang, Jingyi, Cong, Gao |
---|---|
Other Authors: | Interdisciplinary Graduate School (IGS) |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/174800 https://dl.acm.org/toc/pacmmod/2023/1/4 https://2023.sigmod.org/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The RLR-tree: a reinforcement learning based R-tree for spatial data
by: Gu, Tu, et al.
Published: (2023) -
When learned indexes meet LSM-tree based systems: an empirical evaluation
by: Chen, Mengshi
Published: (2024) -
Top-down SLCA computation based on list partition
by: Zhou, J., et al.
Published: (2013) -
Top-down control : a unified principle of cortical learning
by: Makino, Hiroshi
Published: (2020) -
Exploring duality in visual question-driven top-down saliency
by: HE, Shengfeng, et al.
Published: (2020)