Abstract
Constraints are a natural mechanism for the specification of similarity queries on time-series data. However, to realize the expressive power of constraint programming in this context, one must provide the matching implementation technology for efficient indexing of very large data sets. In this paper, we formalize the intuitive notions of exact and approximate similarity between time-series patterns and data. Our definition of similarity extends the distance metric used in [2, 7] with invariance under a group of transformations. Our main observation is that the resulting, more expressive, set of constraint queries can be supported by a new indexing technique, which preserves all the desirable properties of the indexing scheme proposed in [2, 7].
Research supported by ONR Contract N00014-94-1-1153.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.
R. Agrawal, C. Faloutsos, A. Swami. Efficient Similarity Search in Sequence Databases. FODO Conf., Evanston, Ill., Oct. 1993
M. Baudinet, M. Niezette, P. Wolper. On the Representation of Infinite Temporal Data and Queries. Proc. 10th ACM PODS, 280–290, 1991.
A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Constraint Databases. Proc. 19th VLDB, 322–331, 1993.
A. Colmerauer. An Introduction to Prolog III. CACM, 33:7:69–90, 1990.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, Tokyo Japan, 1988.
C. Faloutsos, M. Ranganathan, Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases. Proc. ACM SIGMOD Conf., pp. 419–429, May 1994
H.V. Jagadish. A Retrieval Technique for Similar Shapes. Proc. ACM SIGMOD Conf., pp. 208–217, May 1991
H. V. Jagadish, A. O. Mendelzon, T. Milo. Similarity-Based Queries. to appear in Proc. 14th ACM PODS, 1995
J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111–119, 1987.
F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM PODS, 392–403, 1990.
P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, 299–313, 1990. Full version available as Brown Univ. Tech. Rep. CS-92-50. To appear in JCSS.
P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, J. S. Vitter. Indexing for Data Models with Constraints and Classes. Proc. 12th ACM PODS, 233–243, 1993.
R. M. Karp and M. O. Rabin. Efficient Randomized Pattern-Matching Algorithms. IBM J. Res. Develop., 31(2), 1987
Modenov and Pakhomenko. Geometric Transformations, Academic Press, 1965
A.V. Oppenheim and R.W. Schafer. Digital Signal Processing, Prentice Hall, 1975
H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading MA, 1990.
P. Sheshadri, M. Livny, R. Ramakrishnan. Sequence Query Processing Proc. ACM SIGMOD Conf., pp. 430–441, May 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldin, D.Q., Kanellakis, P.C. (1995). On similarity queries for time-series data: Constraint specification and implementation. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-60299-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60299-6
Online ISBN: 978-3-540-44788-7
eBook Packages: Springer Book Archive