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. Doc 75 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy et al. Doc 56 Handling Infinite Temporal Data - Kabanza, Stevenne et al. Doc 37 the Representation of Infinite Temporal Data and Queries - Baudinet, Niezette et al.