Abstract
A very effective method for fast retrieval in time series data is to map each data sequence into a small set of multidimensional rectangles in feature space, then these rectangles can be readily indexed using traditional multidimensional index trees, like R*-tree. This paper describes the use of another multidimensional index tree, M-tree, for fast retrieval in wavelet transformed time series and compares its performance to that of R*-tree as an index structure for this transformed time series representation.
Original language | English |
---|---|
Title of host publication | 2013 International Conference on Computing, Management and Telecommunications, ComManTel 2013 |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 146-151 |
Number of pages | 6 |
ISBN (Print) | 9781467320870 |
DOIs | |
Publication status | Published - 12 Apr 2013 |
Externally published | Yes |
Event | International Conference on IEEE Computing, Management and Telecommunications (IEEE ComManTel) 2013 - REX Hotel, Ho Chi Minh City, Vietnam Duration: 21 Jan 2013 → 24 Jan 2013 |
Conference
Conference | International Conference on IEEE Computing, Management and Telecommunications (IEEE ComManTel) 2013 |
---|---|
Abbreviated title | ComManTel 2013 |
Country/Territory | Vietnam |
City | Ho Chi Minh City |
Period | 21/01/13 → 24/01/13 |
Keywords
- dimensionality reduction
- M-tree
- multidimensional index structure
- R-tree
- subsequence matching
- time series