The "AI+R"-tree: An Instance-optimized R-tree

07/01/2022
by   Abdullah-Al Mamun, et al.
3

The emerging class of instance-optimized systems has shown potential to achieve high performance by specializing to a specific data and query workloads. Particularly, Machine Learning (ML) techniques have been applied successfully to build various instance-optimized components (e.g., learned indexes). This paper investigates to leverage ML techniques to enhance the performance of spatial indexes, particularly the R-tree, for a given data and query workloads. As the areas covered by the R-tree index nodes overlap in space, upon searching for a specific point in space, multiple paths from root to leaf may potentially be explored. In the worst case, the entire R-tree could be searched. In this paper, we define and use the overlap ratio to quantify the degree of extraneous leaf node accesses required by a range query. The goal is to enhance the query performance of a traditional R-tree for high-overlap range queries as they tend to incur long running-times. We introduce a new AI-tree that transforms the search operation of an R-tree into a multi-label classification task to exclude the extraneous leaf node accesses. Then, we augment a traditional R-tree to the AI-tree to form a hybrid "AI+R"-tree. The "AI+R"-tree can automatically differentiate between the high- and low-overlap queries using a learned model. Thus, the "AI+R"-tree processes high-overlap queries using the AI-tree, and the low-overlap queries using the R-tree. Experiments on real datasets demonstrate that the "AI+R"-tree can enhance the query performance over a traditional R-tree by up to 500

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2022

External-memory dictionaries with worst-case update cost

The B^ϵ-tree [Brodal and Fagerberg 2003] is a simple I/O-efficient exter...
research
12/22/2021

Recognising the overlap graphs of subtrees of restricted trees is hard

The overlap graphs of subtrees in a tree (SOGs) generalise many other gr...
research
03/08/2021

The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data

Learned indices have been proposed to replace classic index structures l...
research
07/15/2022

GLIN: A Lightweight Learned Indexing Mechanism for Complex Geometries

Although spatial index structures shorten the query response time, they ...
research
09/04/2020

Access-Adaptive Priority Search Tree

In this paper we show that the priority search tree of McCreight, which ...
research
03/02/2020

Bridging the Gap Between Theory and Practice on Insertion-Intensive Database

With the prevalence of online platforms, today, data is being generated ...
research
11/18/2022

PIM-tree: A Skew-resistant Index for Processing-in-Memory

The performance of today's in-memory indexes is bottlenecked by the memo...

Please sign up or login with your details

Forgot password? Click here to reset