Abstract
For our purposes, an index is a data structure that allows fast retrieval of time series that are close to a query time series. In index terms, because a time series is represented as a point in some space, our searches are similarity point searches in a single or multidimensional space. Of course, indexes have been extremely well studied and your favorite database text should describe B-trees and at least some multidimensional structures in great depth. Our intent is to focus on those indexes that are most useful to time series analysis as well as how to use them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Dennis E. Shasha and Yunyue Zhu
About this chapter
Cite this chapter
Shasha, D., Zhu, Y. (2004). Indexing Methods. In: High Performance Discovery in Time Series. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4046-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4046-2_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1842-0
Online ISBN: 978-1-4757-4046-2
eBook Packages: Springer Book Archive