Fast Time-Series Searching with Scaling and Shifting

Summary: Defines time-series similarity under per-sequence scaling and shifting and gives a geometric formulation to determine optimal scale and offset. Leverages that formulation to build a tree-based index for fast, amplitude- and offset-invariant similarity search; validated on stock-price traces. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1178
Venue: PODS
Year: 1999
Pagerank: 7.1987694e-05
Overall Rank: 3,340 | 76.79%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Kelvin Kam Wing Chu
2. Man Hon Wong

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
243	Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases	2001	SIGMOD	0.00031052437
3,418	General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows	2002	SIGMOD	7.1129681e-05
4,210	Continually Evaluating Similarity-Based Pattern Queries on a Streaming Time Series	2002	SIGMOD	6.3509527e-05
4,792	YADING: Fast Clustering of Large-Scale Time Series Data	2015	VLDB	5.9132429e-05
4,854	Debunking Four Long-Standing Misconceptions of Time-Series Distance Measures	2020	SIGMOD	5.8707943e-05
7,353	GAMPS: Compressing Multi Sensor Data by Grouping and Amplitude Scaling	2009	SIGMOD	4.7484027e-05
10,476	A Structured Study of Multivariate Time-Series Distance Measures	2025	SIGMOD	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032118946
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016113151
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083300888
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00061977022
129	The X-tree: An Index Structure for High-Dimensional Data	1996	VLDB	0.00044255276
301	The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries	1997	SIGMOD	0.00028396714
362	Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases	1995	VLDB	0.00025758421
821	Dimensionality Reduction for Similarity Searching in Dynamic Databases	1998	SIGMOD	0.00016232579
999	Similarity-Based Queries for Time Series Data	1997	SIGMOD	0.00014726031
4,065	Similarity-Based Queries	1995	PODS	6.4759059e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
243	Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases	2001	SIGMOD	0.00031052437
537	Fast Time Sequence Indexing for Arbitrary L_p Norms	2000	VLDB	0.00020650291
8,775	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	4.4500701e-05
8,140	Anticipatory DTW for Efficient Similarity Search in Time Series Databases	2009	VLDB	4.5726407e-05
7,210	Set-based Similarity Search for Time Series	2016	SIGMOD	4.7949775e-05
1,157	A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series	2013	VLDB	0.00013600695
5,314	Online Event-driven Subsequence Matching over Financial Data Streams	2004	SIGMOD	5.5702825e-05
999	Similarity-Based Queries for Time Series Data	1997	SIGMOD	0.00014726031
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00061977022
362	Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases	1995	VLDB	0.00025758421