Sciweavers

Share
DASFAA
2006
IEEE

DAPSS: Exact Subsequence Matching for Data Streams

9 years 1 months ago
DAPSS: Exact Subsequence Matching for Data Streams
There is much interest in the processing of data streams for applications in the fields such as financial analysis, network monitoring, mobile services, and sensor network management. The key characteristic of stream data, that it continues to arrive, demands a new approach. This paper focuses on the problem of detecting, exactly, similar pairs of subsequences of arbitrary length in streaming fashion. We propose DAPSS (DAta stream Processing for Store and Search), an efficient and effective method to detect the similar pairs, which keeps (1) the feature data of each sequence in the memory space and (2) the compressed data of the original sequences in the disk space. Experiments on synthetic and real data sets show that DAPSS is significantly (up to 35 times) faster than the naive method while it guarantees the correctness of query results.
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu
Added 10 Jun 2010
Updated 10 Jun 2010
Type Conference
Year 2006
Where DASFAA
Authors Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamuro
Comments (0)
books