By Topic

M-tree as an index structure for time series data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Viet, Huynh Huu ; University of Information Technology Vietnamese National University of Ho Chi Minh City ; Anh, Duong Tuan

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.

Published in:

Computing, Management and Telecommunications (ComManTel), 2013 International Conference on

Date of Conference:

21-24 Jan. 2013