DBScholar

Back to papers

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)

Paper ID
h3ba5e48e9fc814ed
Venue
VLDB
Year
2024
Pagerank
4.9793485e-05
Overall Rank
11,569 | 22.22%
DOI
10.14778/3665844.3665845

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
4,598 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.5086378e-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.

Rank Cited Paper Year Venue Pagerank
42 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00045773967
478 Fast Time Sequence Indexing for Arbitrary Lp Norms 2000 VLDB 0.00017631293
915 Querying and Mining of Time Series Data: Experimental Comparison of Representations and Distance Measures 2008 VLDB 0.00013099703
1,070 Warping Indexes with Envelope Transforms for Query by Humming 2003 SIGMOD 0.00012174775
1,095 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012050625
2,970 A Decade of Progress in Indexing and Mining Large Time Series Databases 2006 VLDB 7.7982307e-05
3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.2438813e-05
4,601 Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series 2018 SIGMOD 6.5076083e-05
4,680 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4722037e-05
4,703 Debunking Four Long-Standing Misconceptions of Time-Series Distance Measures 2020 SIGMOD 6.4621968e-05
4,983 Indexing Large Human-Motion Databases 2004 VLDB 6.3269506e-05
5,587 ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines 2020 SIGMOD 6.0754379e-05
6,609 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7354155e-05
8,875 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 5.2577831e-05
9,755 Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System 2012 VLDB 5.1349531e-05
9,758 A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application 2011 VLDB 5.1349531e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 11,327 FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping 2025 VLDB
2 3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB
3 6,320 Subsequence Matching on Structured Time Series Data 2005 SIGMOD
4 6,903 Discovering Longest-lasting Correlation in Sequence Databases 2013 VLDB
5 3,507 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD
6 5,722 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB
7 5,270 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD
8 7,006 A Generic Framework for Efficient and Effective Subsequence Retrieval 2012 VLDB
9 8,875 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB
10 42 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD