Abstract
This paper describes our work on a new automatic indexing technique for large one-dimensional (ID) or time-series data. The principal idea of the proposed time-series data indexing method is to encode the shape of time-series into an alphabet of characters and then to treat them as text. As far as we know this is a novel approach to ID data indexing. In this paper we report our results in using the proposed indexing method for retrieval of real-life time-series data by its content.
Chapter PDF
References
Agrawal, R., et al., “Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases”, Proceedings of the 21st VLDB95 Conference, Zurich, 490–501.
Agrawal, R., et al., “Querying Shapes of Histories”, Proceedings of the 21st VLDB95 Conference, Zurich, 502–514.
Badal, D.Z. and Davis, M.L., “Investigation of Unstructured Text Indexing”, Proceedings DEXA95 Int Conf on Database and Expert Systems, London, Sept 4–8, 1995, 387–396.
Faloutsos, C., et al., “Fast Subsequence Matching in Time-Series Databases”', Proceedings of ACM SIGMOD94 Conference, Minneapolis, 419–429.
Faloutsos, C., et al., “FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Data”, Proceedings of ACM SIGMOD95 Conference, San Jose, 163–174.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
André-Jönsson, H., Badal, D.Z. (1997). Using signature files for querying time-series data. In: Komorowski, J., Zytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1997. Lecture Notes in Computer Science, vol 1263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63223-9_120
Download citation
DOI: https://doi.org/10.1007/3-540-63223-9_120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63223-8
Online ISBN: 978-3-540-69236-2
eBook Packages: Springer Book Archive