Efficient range-constrained similarity search on wavelet synopses over multiple streams

Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential ability of a Data Stream Management System (DSMS). In this paper, motivated by the fact that a user may be interested in an arbitrary range of the data streams, we investigate two important types of range-constrained queries in time series streaming environments: the distance queries (which aim at obtaining the Euclidean distance between two streams) and the kNN queries (which aim at discovering k nearest neighbors to a reference stream). To achieve high efficiency in processing these two types of queries, we propose procedure RED (standing for Range-constrained Euclidean Distance) and algorithm EKS (standing for Enhanced KNN Search). Compared to the existing methods in the prior research, the advantageous features of our approaches are in two folds. First, our approaches are capable of processing the queries dire...

• Type: Conference
• Year: 2006
• Where: CIKM
• Authors: Hao-Ping Hung, Ming-Syan Chen
• Keywords: CIKM 2006, Data Stream, Euclidean Distance, Information Management, Series Streaming Environments