ChainLink: Indexing Big Time Series Data For Long Subsequence Matching
Noura Alghamdi, Liang Zhang, Huayi Zhang, Elke A. Rundensteiner, Mohamed Y. Eltabakh
Abstract
Scalable subsequence matching is critical for supporting analytics on big time series from mining, prediction to hypothesis testing. However, state-of-the-art subsequence matching techniques do not scale well to TB-scale datasets. Not only does index construction become prohibitively expensive, but also the query response time deteriorates quickly as the length of the query subsequence exceeds several 100s of data points. Although Locality Sensitive Hashing (LSH) has emerged as a promising solution for indexing long time series, it relies on expensive hash functions that perform multiple passes over the data and thus is impractical for big time series. In this work, we propose a lightweight distributed indexing framework, called ChainLink, that supports approximate kNN queries over TB-scale time series data. As a foundation of ChainLink, we design a novel hashing technique, called Single Pass Signature (SPS), that successfully tackles the above problem. In particular, we prove theoretically and demonstrate experimentally that the similarity proximity of the indexed subsequences is preserved by our proposed single-pass SPS scheme. Leveraging this SPS innovation, Chainlink then adopts a three-step approach for scalable index building: (1) in-place data re-organization within each partition to enable efficient record-level random access to all subsequences, (2) parallel building of hash-based local indices on top of the re-organized data using our SPS scheme for efficient search within each partition, and (3) efficient aggregation of the local indices to construct a centralized yet highly compact global index for effective pruning of irrelevant partitions during query processing. ChainLink achieves the above three steps in one single map-reduce process. Our experimental evaluation shows that ChainLink indices are compact at less than 2% of dataset size while state-of-the-art index sizes tend to be almost the same size as the dataset. Better still, ChainLink is up to 2 orders of magnitude faster in its index construction time compared to state-of-the-art techniques, while improving both the final query response time by up to 10 fold and the result accuracy by 15%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching ProblemZemin Chao, Hong Gao, Yinan An, Jianzhong LiVLDB 2022 · 3 citations
- CLIMBER: Pivot-Based Approximate Similarity Search Over Big Data SeriesLiang Zhang, Mohamed Y. Eltabakh, Elke A. Rundensteiner, Khalid AlnuaimICDE 2024 · 1 citation
- DeXOR: Enabling XOR in Decimal Space for Streaming Lossless Compression of Floating-point DataChuanyi Lv, Huan Li, Dingyu Yang, Zhonele Xie et al.VLDB 2026
Related papers
- CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time SeriesHaoran Xiong, Hang Zhang, Zeyu Wang, Zhenying He et al.VLDB 2024 · 4 citations
- Fast and Scalable Mining of Time Series Motifs with Probabilistic GuaranteesMatteo Ceccarello, Johann GamperVLDB 2022 · 9 citations
- PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN SearchBolong Zheng, Xi Zhao, Lianggui Weng, Nguyen Quoc Viet Hung et al.VLDB 2020 · 64 citations
- Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series DatabasesHokeun Cha, Xiangpeng Hao, Tianzheng Wang, Huanchen Zhang et al.VLDB 2023 · 15 citations
- MESSI: In-Memory Data Series IndexingBotao Peng, Panagiota Fatourou, Themis PalpanasICDE 2020 · 38 citations
