On similarity queries for time-series data: Constraint specification and implementation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 976, Issue , 1995, Pages 137-153

  Goldin, Dina Q ^a   Kanellakis, Paris C ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; INDEXING (OF INFORMATION); SPECIFICATIONS;

CONSTRAINT PROGRAMMING; CONSTRAINT SPECIFICATIONS; DISTANCE METRICS; EXPRESSIVE POWER; INDEXING TECHNIQUES; TIME SERIES PATTERNS; TIME-SERIES DATA; VERY LARGE DATUM;

TIME SERIES;

EID: 84958044742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60299-2_9     Document Type: Conference Paper

References (18)

1. A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.
2. R. Agrawal, C. Faloutsos, A. Swami. Efficient Similarity Search in Sequence Databases. FODO Conf., Evanston, Ill., Oct. 1993
3. M. Baudinet, M. Niezette, P. Wolper. On the Representation of Infinite Temporal Data and Queries. Proc. 10th ACM PODS, 280-290, 1991.
4. A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Constraint Databases. Proc. 19th VLDB, 322-331, 1993.
5. A. Colmerauer. An Introduction to Prolog III. CACM, 33:7:69-90, 1990.
6. 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.
7. C. Faloutsos, M. Ranganathan, Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases. Proc. ACM SIGMOD Conf., pp. 419-429, May 1994
8. H.V. Jagadish. A Retrieval Technique for Similar Shapes. Proc. ACM SIGMOD Conf., pp. 208-217, May 1991
9. H. V. Jagadish, A. O. Mendelzon, T. Milo. Similarity-Based Queries. to appear in Proc. 14th ACM PODS, 1995
10. J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111-119, 1987.
11. F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM PODS, 392-403, 1990.
12. 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.
13. 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.
14. R. M. Karp and M. O. Rabin. Efficient Randomized Pattern-Matching Algorithms. IBM J. Res. Develop., 31(2), 1987
15. Modenov and Pakhomenko. Geometric Transformations, Academic Press, 1965
16. A.V. Oppenheim and R.W. Schafer. Digital Signal Processing, Prentice Hall, 1975
17. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading MA, 1990.
18. P. Sheshadri, M. Livny, R. Ramakrishnan. Sequence Query Processing Proc. ACM SIGMOD Conf., pp. 430-441, May 1994