Affiliation:
1. School of Computer Science, University of Sydney, Australia
2. SPORTLOGiQ Inc., Canada
Abstract
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 datasets 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 datasets. The results show improvement over state-of-the-art methods for exact queries, and even further speedups are achieved for queries that may return approximate results. Surprisingly, the majority of exact nearest-neighbor queries on real datasets are answered
without any
distance computations.
Funder
Australian Research Council Discovery Projects ARC
Publisher
Association for Computing Machinery (ACM)
Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Computer Science Applications,Modeling and Simulation,Information Systems,Signal Processing
Reference72 articles.
1. ACM. 2017.ACM SIGSPATIAL Cup 2017—Range queries in very large databases of trajectories.Retrieved from: http://sigspatial2017.sigspatial.org/giscup2017/. ACM. 2017.ACM SIGSPATIAL Cup 2017—Range queries in very large databases of trajectories.Retrieved from: http://sigspatial2017.sigspatial.org/giscup2017/.
2. Computing the discrete Fréchet distance in subquadratic time;Agarwal Pankaj K.;SIAM J. Comput.,2014
3. Near-linear time approximation algorithms for curve simplification;Agarwal Pankaj K.;Algorithmica,2005
4. The input/output complexity of sorting and related problems.Commun;Aggarwal Alok;ACM,1988
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献