Skip to Main content Skip to Navigation
Conference papers

Data Series Progressive Similarity Search with Probabilistic Quality Guarantees

Abstract : Existing systems dealing with the increasing volume of data series cannot guarantee interactive response times, even for fundamental tasks such as similarity search. Therefore, it is necessary to develop analytic approaches that support exploration and decision making by providing progressive results, before the final and exact ones have been computed. Prior works lack both efficiency and accuracy when applied to large-scale data series collections. We present and experimentally evaluate a new probabilistic learning-based method that provides quality guarantees for progressive Nearest Neighbor (NN) query answering. We provide both initial and progressive estimates of the final answer that are getting better during the similarity search, as well suitable stopping criteria for the progressive queries. Experiments with synthetic and diverse real datasets demonstrate that our prediction methods constitute the first practical solution to the problem, significantly outperforming competing approaches.
Complete list of metadatas

Cited literature [94 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02560760
Contributor : Theophanis Tsandilas <>
Submitted on : Saturday, May 2, 2020 - 3:18:47 PM
Last modification on : Wednesday, June 24, 2020 - 10:40:06 AM

File

progressive-sigmod.pdf
Files produced by the author(s)

Identifiers

Citation

Anna Gogolou, Theophanis Tsandilas, Karima Echihabi, Anastasia Bezerianos, Themis Palpanas. Data Series Progressive Similarity Search with Probabilistic Quality Guarantees. ACM SIGMOD International Conference on Management of Data, Jun 2020, Portland, United States. pp.1857-1873, ⟨10.1145/3318464.3389751⟩. ⟨hal-02560760⟩

Share

Metrics

Record views

72

Files downloads

278