M-tree as an index structure for time series data

Huynh Huu Viet, Duong Tuan Anh

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

5 Citations (Scopus)

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 languageEnglish
Title of host publication2013 International Conference on Computing, Management and Telecommunications, ComManTel 2013
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages146-151
Number of pages6
ISBN (Print)9781467320870
DOIs
Publication statusPublished - 12 Apr 2013
Externally publishedYes
EventInternational Conference on IEEE Computing, Management and Telecommunications (IEEE ComManTel) 2013 - REX Hotel, Ho Chi Minh City, Vietnam
Duration: 21 Jan 201324 Jan 2013

Conference

ConferenceInternational Conference on IEEE Computing, Management and Telecommunications (IEEE ComManTel) 2013
Abbreviated titleComManTel 2013
CountryVietnam
CityHo Chi Minh City
Period21/01/1324/01/13

Keywords

  • dimensionality reduction
  • M-tree
  • multidimensional index structure
  • R-tree
  • subsequence matching
  • time series

Cite this