Indexing time series using signatures

Authors:
H. Andre-Josson;D. Z. Badal
Affiliations:
Department of Computer Science and Information Technology at Linkoing University, S-581 83 Linkoing, Sweden E-mail: henan@ida.liu.se;Department of Computer Science at University of Colorado at Colorado Springs, Colorado Springs, CO 80919, USA E-mail: badal@redcloud.uccs.edu
Venue:
Intelligent Data Analysis
Year:
2000

Citing 15
Cited 0

Balanced multidimensional extendible hash tree

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Description and performance analysis of signature file methods for office filing

ACM Transactions on Information Systems (TOIS)
Multikey access methods based on superimposed coding techniques

ACM Transactions on Database Systems (TODS)
Partitioned signature files: design issues and performance evaluation

ACM Transactions on Information Systems (TOIS)
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Dynamic partitioning of signature files

ACM Transactions on Information Systems (TOIS)
Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
S-tree: a dynamic balanced signature index for office retrieval

Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Signature files: an access method for documents and its analytical performance evaluation

ACM Transactions on Information Systems (TOIS)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Approximate Queries and Representations for Large Data Sequences

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
HierarchyScan: A Hierarchical Similarity Search Algorithm for Databases of Long Sequences

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Querying Continuous Time Sequences

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Querying Shapes of Histories

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new approach to indexing time series. Indexing time series is more problematic than indexing text since in extreme we need to find all possible subsequences in the time series sequence. We propose to use signature files to index the time series and we also propose a new method to index the signature files to speed up the search of large time series. We propose a novel index structure, the signature tree, for time series indexing. We implemented the signature tree and we discuss its performance.