Locality-sensitive hashing of curves

We study data structures for storing a set of polygonal curves in IR^d such that, given a query curve, we can efficiently retrieve similar curves from the set, where similarity is measured using the discrete Fréchet distance or the dynamic time warping distance. To this end we devise the first locality-sensitive hashing schemes for these distance measures. A major challenge is posed by the fact that these distance measures internally optimize the alignment between the curves. We give solutions for different types of alignments including constrained and unconstrained versions. For unconstrained alignments, we improve over a result by Indyk from 2002 [17] for short curves. Let n be the number of input curves and let m be the maximum complexity of a curve in the input. In the particular case where m ≤ α/4d log n, for some fixed α > 0, our solutions imply an approximate near-neighbor data structure for the discrete Fréchet distance that uses space in O(n^1+αlog n) and achieves query time in O(n^αlog² n) and constant approximation factor. Furthermore, our solutions provide a trade-off between approximation quality and computational performance: for any parameter k ∈ [m], we can give a data structure that uses space in O(2^2km^k-1n log n + nm), answers queries in O(2^2km^klog n) time and achieves approximation factor in O(m/k).