1999 · 101 citations · 15 references
ComputingInformation SystemsInformation TechnologyData MiningInformation RetrievalTime Series AnalysisQuery ManagementQuery ProcessingTemporal Data MiningTime Series AnalyticsTime Series ComputationDynamic QueryingKnowledge Discovery ProcessesTemporal Query ProcessingTime Series Similarity SearchTime-series Data Management
Traditional query process for time-series data transforms data from the time domain into the frequency domain. It is less controllable by the end users, therefore isn't well suited for queries that find patterns with many dynamically specified user constraints. For these queries we present a method to search timeseries data which first transforms time sequences into symbol strings using change ratio between contiguous data points in time series. Next, a suffix tree is built to index all suffixes of the symbol strings. The focus of this paper is to demonstrate how this method can adapt to the processing of the dynamically constrained time-series queries.
15
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Fast subsequence matching in time-series databases
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos · 1994 · 1.7K citations · Full text
A Space-Economical Suffix Tree Construction Algorithm
Edward M. McCreight · Journal of the ACM · 1976 · 1.5K citations · Full text