Download:
|
by Tamer Kahveci, Ambuj Singh
In ICDE
http://www.cs.ucsb.edu/~tamer/papers/icde2001.ps
Add To MetaCart
Abstract:
Finding similar patterns in a time sequence is a wellstudied problem. Most of the current techniques work well for queries of a prespecified length, but not for variable length queries. We propose a new indexing technique that works well for variable length queries. The central idea is to store index structures at different resolutions for a given dataset. The resolutions are based on wavelets. For a given query, a number of subqueries at different resolutions are generated. The ranges of the subqueries are progressively refined based on results from previous subqueries. Our experiments show that the total cost for our method is 4 to 20 times less than the current techniques including Linear Scan. Because of the need to store information at multiple resolution levels, the storage requirement of our method could potentially be large. In the second part of the paper, we show how the index information can be compressed with minimal information loss. According to our experimental results, even after compressing the size of the index to one fifth, the total cost of our method is 3 to 15 times less than the current techniques. 1
Citations
|
1650
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
706
|
The r*-tree: An efficient and robust access method for points and rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
346
|
Nearest Neighbor Queries
– Roussopoulos, Kelley, et al.
- 1995
|
|
336
|
Wavlets and Subband Coding
– Vetterli, Kovacević
- 1995
|
|
310
|
Efcient similarity search in sequence databases
– Agrawal, Faloutsos, et al.
- 1993
|
|
308
|
et al., Fast subsequence matching in timeseries databases
– Faloutsos
- 1994
|
|
168
|
Fast similarity search in the presence of noise, scaling, and translation in time-series databases
– Agrawal, Lin, et al.
- 1995
|
|
150
|
H.: Ranking in Spatial Databases
– Hjaltason, Samet
- 1995
|
|
127
|
Efficient time-series matching by wavelets
– Chan, Fu
- 1999
|
|
117
|
Efficient retrieval of similar time sequences under time warping
– Yi, Jagadish, et al.
- 1998
|
|
109
|
On similarity-based queries for time-series data
– Rafiei
- 1999
|
|
92
|
Principles of Multimedia Database Systems
– Subrahmanian
- 1998
|
|
78
|
An Introduction to Wavelets
– Graps
- 1995
|
|
58
|
Landmarks: a new model for similarity-based pattern querying in time series databases
– Perng, Wang, et al.
- 2000
|
|
50
|
Manolopoulos: Fast Subsequence Matching in Time-Series Databases
– Faloutsos, Ranganathan
- 1994
|
|
38
|
Efficient retrieval of similar time sequences using DFT
– Rafiei, Mendelzon
- 1998
|
|
33
|
Fast time-series searching with scaling and shifting
– Chu, Wong
- 1999
|
|
31
|
Similarity search for multidimensional data sequences
– Lee, Chun, et al.
- 2000
|
|
31
|
Wavelet Transforms: Introduction to Theory and Applications
– Rao, Bopardikar
- 1998
|
|
27
|
TSA-tree: A wavelet-based approach to improve the efficieny of multi-level surprise and trend queries
– Shahabi, Tian, et al.
- 2000
|
|
19
|
An analysis of schedules for performing multi-page requests
– Seeger
- 1996
|
|
7
|
Dimensionalityreduction for similarity searching in dynamic databases
– Kanth, Agrawal, et al.
- 1998
|
|
4
|
An indexing scheme for similarity search in large time series databases
– Keogh, Pazzani
- 1999
|
|
3
|
Reading a set of disk pages
– Bernhard, Per-ke, et al.
- 1993
|
|
2
|
Fast retrieval of similar subsequences of different lengths in sequence databases
– Park, Chu, et al.
- 2000
|
|
1
|
Wing Chu and Man Hon Wong. Fast time-series searching with scaling and shifting
– Kam
- 1999
|
|
1
|
Ravi Kanth. Dimensionality-reduction for similarity searching in dynamic databases
– Singh, Agrawal, et al.
- 1998
|
