CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series
Summary: CIVET introduces UPAA, a lower-bounding representation that aligns features across variable-length time series. Its compact index groups adjacent and similar subsequences, enabling pruning and false-dismissal-free filtering for efficient, scalable variable-length matching. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Haoran Xiong (Fudan University)
- 2. Hang Zhang (Fudan University)
- 3. Zeyu Wang (Fudan University)
- 4. Zhenying He (Fudan University)
- 5. Peng Wang (Fudan University)
- 6. X. Sean Wang (Fudan University)
BibTeX Citation
@article{xiong_vldb24,
title = {{CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series}},
author = {Xiong, Haoran and Zhang, Hang and Wang, Zeyu and He, Zhenying and Wang, Peng and Wang, X. Sean},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {9},
pages = {2123--2135},
doi = {10.14778/3665844.3665845},
url = {https://doi.org/10.14778/3665844.3665845},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,148 | Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes | 2024 | VLDB | 5.9593368e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,938 | FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping | 2025 | VLDB |
| 2 | 3,486 | Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach | 2018 | VLDB |
| 3 | 6,189 | Subsequence Matching on Structured Time Series Data | 2005 | SIGMOD |
| 4 | 6,780 | Discovering Longest-lasting Correlation in Sequence Databases | 2013 | VLDB |
| 5 | 3,440 | Approximate Embedding-Based Subsequence Matching of Time Series | 2008 | SIGMOD |
| 6 | 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 7 | 5,162 | Online Event-driven Subsequence Matching over Financial Data Streams | 2004 | SIGMOD |
| 8 | 6,858 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB |
| 9 | 8,780 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB |
| 10 | 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD |