A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories

05/28/2020
by   Joachim Gudmundsson, et al.
0

We present a scalable approach for range and k nearest neighbor queries under computationally expensive metrics, like the continuous Fréchet distance on trajectory data. Based on clustering for metric indexes, we obtain a dynamic tree structure whose size is linear in the number of trajectories, regardless of the trajectory's individual sizes or the spatial dimension, which allows one to exploit low `intrinsic dimensionality' of data sets for effective search space pruning. Since the distance computation is expensive, generic metric indexing methods are rendered impractical. We present strategies that (i) improve on known upper and lower bound computations, (ii) build cluster trees without any or very few distance calls, and (iii) search using bounds for metric pruning, interval orderings for reduction, and randomized pivoting for reporting the final results. We analyze the efficiency and effectiveness of our methods with extensive experiments on diverse synthetic and real-world data sets. The results show improvement over state-of-the-art methods for exact queries, and even further speed-ups are achieved for queries that may return approximate results. Surprisingly, the majority of exact nearest-neighbor queries on real data sets are answered without any distance computations.

READ FULL TEXT

page 4

page 22

page 23

page 25

page 27

research
11/24/2020

Efficient Approximate Nearest Neighbor Search for Multiple Weighted l_p≤2 Distance Functions

Nearest neighbor search is fundamental to a wide range of applications. ...
research
09/03/2022

Classifying Spatial Trajectories

We provide the first comprehensive study on how to classify trajectories...
research
03/09/2018

TRAJEDI: Trajectory Dissimilarity

The vast increase in our ability to obtain and store trajectory data nec...
research
03/19/2022

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance

We study the problem of sub-trajectory nearest-neighbor queries on polyg...
research
08/18/2022

Learned Indexing in Proteins: Extended Work on Substituting Complex Distance Calculations with Embedding and Clustering Techniques

Despite the constant evolution of similarity searching research, it cont...
research
02/21/2023

Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search

Finding the nearest neighbor to a hyperplane (or Point-to-Hyperplane Nea...
research
01/12/2018

Toward Metric Indexes for Incremental Insertion and Querying

In this work we explore the use of metric index structures, which accele...

Please sign up or login with your details

Forgot password? Click here to reset