Abstract
In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence contains values equal to the query value. The presented method is based on [7] in order to represent each time sequence with a few ranges of values, which are in fact one dimensional minimum bounding rectangles. We compare the proposed method with the IP-index which has been presented in [8] as an indexing mechanism for answering inverse queries. As it is shown, the proposed method outperforms the IP-index for very large time sequences.
Work supported by the European Union's TMR program (”Chorochronos” project, contract number ERBFMRX-CT96-0056 (DG 12 — BDCN)).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, C. Faloutsos, and A. Swami. “Efficient Similarity Search in Sequence Databases”. Proc. of the Fourth International Conference on Foundations of Data Organization and Algorithms”, Chicago, USA, October 1993.
R. Agrawal, K. Lin, H. Sawhney, and K. Shim. “Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases”. Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.
R. Agrawal, and R. Srikant. ”Mining Sequential Patterns”. Proc. of the 11th Int'l Conference on Data Engineering, Taipei, Taiwan, March 1995.
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. ”The R*-tree: An Efficient and Robust Access Method for Points and Rectangles”. Proc. of the A CM SIGMOD Conference on Management of Data, Atlantic City, USA, May, 1990.
R. Elmasri, G. Wuu, and Y. Kim. ”The Time Index: An access structure for temporal data”. Proc. of the 16th VLDB Conference, Brisbane, Australia, 1990.
C. Faloutsos and H. Jagadish. ”On B-tree Indices for Skewed Distributions”. Proc. of the 18th VLDB Conference, Vancouver, Canada, 1992.
C. Faloutsos, M. Raganathan, and Y. Manolopoulos. ”Fast Subsequence Matching in Time-Series Databases”. Proc. of the ACM SIGMOD Conference on Management of Data, Minnesota, USA, May 1994.
L. Lin, T. Risch, M. Skold, and D. Badal. ”Indexing Values of Time Sequences”. Proc. of the Int'l Conference on Information and Knowledge Management (CIKM), Rockville, USA, 1996.
M. Schroeder. ”Fractal, Chaos, Power Laws: Minutes from an Infinite Paradise”. W.H. Freeman and Company. New York, USA, 1991.
R. Stam and R. Snodgrass. ”A bibliography on temporal databases”. IEEE Bulletin on Data Engineering, 11(4), December 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nanopoulos, A., Manolopoulos, Y. (1998). Indexing time-series databases for inverse queries. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054513
Download citation
DOI: https://doi.org/10.1007/BFb0054513
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64950-2
Online ISBN: 978-3-540-68060-4
eBook Packages: Springer Book Archive