{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T03:25:10Z","timestamp":1791343510089,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602996","type":"print"},{"value":"9783540447887","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:15:50Z","timestamp":1330280150000},"page":"137-153","source":"Crossref","is-referenced-by-count":127,"title":["On similarity queries for time-series data: Constraint specification and implementation"],"prefix":"10.1007","author":[{"given":"Dina Q.","family":"Goldin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paris C.","family":"Kanellakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos, A. Swami. Efficient Similarity Search in Sequence Databases. FODO Conf., Evanston, Ill., Oct. 1993","DOI":"10.1007\/3-540-57301-1_5"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"M. Baudinet, M. Niezette, P. Wolper. On the Representation of Infinite Temporal Data and Queries. Proc. 10th ACM PODS, 280\u2013290, 1991.","DOI":"10.1145\/113413.113439"},{"key":"9_CR4","unstructured":"A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Constraint Databases. Proc. 19th VLDB, 322\u2013331, 1993."},{"issue":"7","key":"9_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III. CACM, 33:7:69\u201390, 1990.","journal-title":"CACM"},{"key":"9_CR6","unstructured":"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."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases. Proc. ACM SIGMOD Conf., pp. 419\u2013429, May 1994","DOI":"10.1145\/191839.191925"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish. A Retrieval Technique for Similar Shapes. Proc. ACM SIGMOD Conf., pp. 208\u2013217, May 1991","DOI":"10.1145\/115790.115821"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"H. V. Jagadish, A. O. Mendelzon, T. Milo. Similarity-Based Queries. to appear in Proc. 14th ACM PODS, 1995","DOI":"10.1145\/212433.212444"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111\u2013119, 1987.","DOI":"10.1145\/41625.41635"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM PODS, 392\u2013403, 1990.","DOI":"10.1145\/298514.298590"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, 299\u2013313, 1990. Full version available as Brown Univ. Tech. Rep. CS-92-50. To appear in JCSS.","DOI":"10.1145\/298514.298582"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, J. S. Vitter. Indexing for Data Models with Constraints and Classes. Proc. 12th ACM PODS, 233\u2013243, 1993.","DOI":"10.1145\/153850.153884"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"R. M. Karp and M. O. Rabin. Efficient Randomized Pattern-Matching Algorithms. IBM J. Res. Develop., 31(2), 1987","DOI":"10.1147\/rd.312.0249"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Modenov and Pakhomenko. Geometric Transformations, Academic Press, 1965","DOI":"10.1016\/B978-1-4832-2801-3.50011-1"},{"key":"9_CR16","unstructured":"A.V. Oppenheim and R.W. Schafer. Digital Signal Processing, Prentice Hall, 1975"},{"key":"9_CR17","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading MA, 1990."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"P. Sheshadri, M. Livny, R. Ramakrishnan. Sequence Query Processing Proc. ACM SIGMOD Conf., pp. 430\u2013441, May 1994","DOI":"10.1145\/191843.191926"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:59:53Z","timestamp":1742597993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}