Effectively learning spatial indices
Machine learning, especially deep learning, is used increasingly to enable better solutions
for data management tasks previously solved by other means, including database indexing …
for data management tasks previously solved by other means, including database indexing …
HGST: A Hilbert-GeoSOT Spatio-Temporal Meshing and Coding Method for Efficient Spatio-Temporal Range Query on Massive Trajectory Data
H Liu, J Yan, J Wang, B Chen, M Chen… - … International Journal of …, 2023 - mdpi.com
In recent years, with the widespread use of location-aware handheld devices and the
development of wireless networks, trajectory data have shown a trend of rapid growth in …
development of wireless networks, trajectory data have shown a trend of rapid growth in …
The “AI+ R”-tree: An Instance-optimized R-tree
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 …
performance by specializing to a specific data and query workloads. Particularly, Machine …
SQUID: subtrajectory query in trillion-scale GPS database
Subtrajectory query has been a fundamental operator in mobility data management and
useful in the applications of trajectory clustering, co-movement pattern mining and contact …
useful in the applications of trajectory clustering, co-movement pattern mining and contact …
Rw-tree: A learned workload-aware framework for r-tree construction
R-tree is a popular index which supports efficient queries on multi-dimensional data. The
performance of R-tree mostly depends on how the tree structure is built if new data instances …
performance of R-tree mostly depends on how the tree structure is built if new data instances …
HCIndex: a Hilbert-Curve-based clustering index for efficient multi-dimensional queries for cloud storage systems
With the rapid development of the Internet of Things and cloud computing, HBase has
become a good choice for massive data storage, and is efficient in reading and writing data …
become a good choice for massive data storage, and is efficient in reading and writing data …
Waffle: A Workload-Aware and Query-Sensitive Framework for Disk-Based Spatial Indexing
Although several spatial indexes achieve fast query processing, they are ineffective for
highly dynamic data sets because of costly updates. On the other hand, simple structures …
highly dynamic data sets because of costly updates. On the other hand, simple structures …
Efficiently learning spatial indices
Learned indices can leverage the high prediction accuracy and efficiency of modern deep
learning techniques. They are capable of delivering better query performance than …
learning techniques. They are capable of delivering better query performance than …
LiteHST: a tree embedding based method for similarity search
Similarity search is getting increasingly useful in real applications. This paper focuses on the
in-memory similarity search, ie, the range query and k nearest neighbor (kNN) query, under …
in-memory similarity search, ie, the range query and k nearest neighbor (kNN) query, under …
How good are multi-dimensional learned indexes? An experimental survey
Efficient indexing is fundamental to managing and analyzing multi-dimensional data. A
growing trend is to directly learn the storage layout of multi-dimensional data using simple …
growing trend is to directly learn the storage layout of multi-dimensional data using simple …