Database Paper Browser

Back to papers

Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees

Summary: Fast, scalable top-k time-series motif mining with probabilistic guarantees via LSH and self-tuning. Correctness proofs and cost bounds; optimizations prune distance computations; CPU-scale experiments show billion-point data processed with speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12896
Venue
VLDB
Year
2022
Pagerank
5.6067361e-05
Overall Rank
5,245 | 63.52%
DOI
10.14778/3565838.3565840

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers