Date of Original Version



Conference Proceeding

Rights Management

© ACM, 1994. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.

Abstract or Description

We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequences into a small set of multidimensional rectangles in feature space. Then, these rectangles can be readily indexed using traditional spatial access methods, like the R*-tree [9]. In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space. We propose an efficient and effective algorithm to divide such trails into sub-trails, which are subsequently represented by their Minimum Bounding Rectangles (MBRs). We also examine queries of varying lengths, and we show how to handle each case efficiently. We implemented our method and carried out experiments on synthetic and real data (stock price movements). We compared the method to sequential scanning, which is the only obvious competitor. The results were excellent: our method accelerated the search time from 3 times up to 100 times.





Published In

Proceedings of the 1994 ACM SIGMOD international Conference on Management of Data. R. T. Snodgrass and M. Winslett, Eds., 419-429.