DBScholar

Back to papers

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
1177
Venue
PODS
Year
1999
Pagerank
7.5951443e-05
Overall Rank
3,252 | 77.69%
DOI
10.1145/303976.304000

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chu_pods99,
        address = {New York, NY, USA},
        series = {{PODS} '99},
        title = {{Fast Time-Series Searching with Scaling and Shifting}},
        url = {https://dl.acm.org/doi/10.1145/303976.304000},
        doi = {10.1145/303976.304000},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chu, Kelvin Kam Wing and Wong, Man Hon},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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