% by Mirella M. Moro; version: September/23/2011 @ 05:01pm
% -- 09/03/2010: bib file with names for proceedings and journals; cls with shrinked {received}
% -- 08/27/2010: appendix, table example, more explanation within comments, editors' data

\documentclass[jidm,a4paper]{jidm} % NOTE: JIDM is published on A4 paper
\usepackage{graphicx,url}  % for using figures and url format
\usepackage[T1]{fontenc}   % avoids warnings such as "LaTeX Font Warning: Font shape 'OMS/cmtt/m/n' undefined"
\usepackage{enumerate}
\usepackage{subfigure}
\usepackage{amsmath}
\usepackage{graphicx,url}
%\usepackage[utf8x]{inputenc}
\usepackage{color}
\usepackage{subfigure}
\usepackage{amsmath}
\usepackage[english,portuguese]{babel}
%\usepackage[portugues,algoruled,longend]{algorithm2e}

%\usepackage{cite} % NOTE: do **not** include this package because it conflicts with jidm.bst

% Standard definitions
\newtheorem{theorem}{Theorem}[section]
\newtheorem{conjecture}[theorem]{Conjecture}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newdef{definition}[theorem]{Definition}
\newdef{remark}[theorem]{Remark}
\newenvironment{latexcode}
{\vspace{0.1in}\setlength{\parindent}{18pt}}
{\vspace{0.1in}}


% ALL FIELDS DOWN TO BEGIN{document} ARE MANDATORY

% The following data (volume, number and page) are given by the editors prior to publishing your article
\jidmVolume{2}
\jidmNumber{1}
\jidmYear{12}
\jidmMonth{February}
%\setcounter{page}{1}


% Includes headers with simplified name of the authors and article title
\markboth{Chino D. Y. T. et al.}{Time Series Indexing Taking Advantage of the Generalized Suffix Tree}   
%  -> \markboth{}{}
%         takes 2 arguments
%         ex: \markboth{M. M. Moro}{Any article title}


% Title of the article
\title{Time Series Indexing Taking Advantage of the\\ Generalized Suffix Tree}
%\title{JIDM - Journal of Information \\ and Data Management}


% List of authors
%IF THERE ARE TWO or more institutions, please use:
%\author{Name of Author1\inst{1}, Name of Author2\inst{2}, Name of Author3\inst{2}}
\author{Daniel Yoshinobu Takada Chino, Felipe Alves da Louza, Agma Juci Machado Traina, \mbox{Cristina Dutra de Aguiar Ciferri}, Caetano Traina Júnior}


%Affiliation and email        
\institute{Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo\\
\email{\{chinodyt, louza, agma, cdac, caetano\}@icmc.usp.br}
}

%Affiliation and email
%\institute{Universidade Federal de Minas Gerais, Brazil \\ \email{\{laender, mirella\}@dcc.ufmg.br}
% IF THERE IS ANOTHER INSTITUTION:
%\and Name_of_the_second_institution \\
%\email{address@whatever.com}
%}


% Article abstract - it should be from 100 to 300 words
\begin{abstract}
A time series is a collection of observations made sequentially over time. 
Time series appear in several application areas such as finance, marketing, agriculture, weather, industrial and scientific data gathering. 
Similarity searching on time series databases is an important tool to extract knowledge from them. 
In this article, we propose Telesto, a novel indexing approach aimed at performing similarity search over time series, which is based on discretized time series and generalized suffix trees. 
Initially, Telesto discretizes time series and represents them as strings, using as a basis the Symbolic Aggregate Approximation (SAX) technique. 
Thereafter, these strings are indexed using a generalized suffix tree. 
To provide both range and nearest neighbor query operations among discretized time series, Telesto extends the suffix tree substring search algorithm by calculating distances between the discretized time series. 
%Performance tests showed that Telesto was very efficient in similarity queries over large real-world time series databases.
Performance tests showed that Telesto is scalable in response to increasing sizes of databases and queries, in addition to be very efficient in similarity queries over large real-world time series databases.
\end{abstract}


% ACM Computing Classification System categories
\category{Core Database Foundations and Technology}{Access methods and indexing}{Databases}
%\category{H. Information Systems}{H.2 Database Management}{Miscellaneous}
% Categories and Descriptors are available at the 1998 ACM Computing Classification System
% http://www.acm.org/about/class/1998/
%  -> \category{}{}{}
%         takes 3 arguments for the Computing Reviews Classification Scheme.
%         ex: \category{D.3.3}{Programming Languages}{Language Constructs and Features}
%                   [data types and structures]
%                   the last argument, in square brackets, is optional.

% Article keywords
\keywords{generalized suffix tree, indexing, similarity search, time series}
%\keywords{JIDM, template}
%  -> \keywords{} (in alphabetical order \keywords{document processing, sequences,
%                      string searching, subsequences, substrings})


% THE ARTICLE BEGINS
\begin{document}

\begin{bottomstuff}
% Este trabalho foi realizado com o apoio das seguintes agências de fomento: FAPESP, Microsoft Research, CNPq  e CAPES. Os autores agradecem também ao CEPAGRI-UNICAMP pelo conjunto de imagens AVHRR/NOAA.
This work was supported by the following foment agencies: FAPESP, Microsoft Research, CNPq and CAPES. The authors also thank the CEPAGRI-UNICAMP for the set of images AVHRR / NOAA.\\
\end{bottomstuff}

\maketitle


\input{1.introduction}
\input{2.related}
\input{3.background}
\input{3.gst}
\input{4.telesto}
\input{5.tests}%\newpage
\input{6.conclusion}


\bibliographystyle{jidm}
\bibliography{References}

\end{document}
