Name
Abstract | ||
|---|---|---|
In spatial query processing, the popular index R-tree may incur large storage consumption and high IO cost. Inspired by the recent learned index [17] that replaces B-tree with machine learning models, we study an analogy problem for spatial data. We propose a novel Learned Index structure for Spatial dAta (LISA for short). Its core idea is to use machine learning models, through several steps, to generate searchable data layout in disk pages for an arbitrary spatial dataset. In particular, LISA consists of a mapping function that maps spatial keys (points) into 1-dimensional mapped values, a learned shard prediction function that partitions the mapped space into shards, and a series of local models that organize shards into pages. Based on LISA, a range query algorithm is designed, followed by a lattice regression model that enables us to convert a KNN query to range queries. Algorithms are also designed for LISA to handle data updates. Extensive experiments demonstrate that LISA clearly outperforms R-tree and other alternatives in terms of storage consumption and IO cost for queries. Moreover, LISA can handle data insertions and deletions efficiently.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3318464.3389703 | SIGMOD/PODS '20: International Conference on Management of Data
Portland
OR
USA
June, 2020 |
Keywords | DocType | ISBN |
Database, Spatial index, Learned Index | Conference | 978-1-4503-6735-6 |
Citations | PageRank | References |
3 | 0.36 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pengfei Li | 1 | 3 | 1.71 |
| Hua Lu | 2 | 1380 | 83.74 |
| Qian Zheng | 3 | 44 | 13.91 |
| Long Yang | 4 | 3 | 1.04 |
| Gang Pan | 5 | 1501 | 123.57 |