Efficient Similarity Search in Streaming Time Sequences.pdfVIP

Efficient Similarity Search in Streaming Time Sequences M. Kontaki and A.N. Papadopoulos Data Engineering Lab. Department of Informatics Aristotle University 54124 Thessaloniki, GREECE kontaki,apostol@delab.csd.auth.gr Abstract thoroughly in database literature is the similarity query. Given a query object the similarity query Query processing in data streams is a very impor- asks for all objects that are similar to to a suffi- tant research direction. The challenge in a database cient degree. Similarity queries have been studied for of data streams is to provide efficient algorithms and multidimensional objects, images, video, time series access methods for query processing, taking into con- and other non-traditional data types. In data streams sideration the fact that the database changes continu- the problem is more challenging since the query ob- ously as new data arrive. Traditional access methods ject, the data or both may change over time. The that continuously update the data are considered in- similar