Pattern Matching in Multiple Streams

Details Pattern Matching in Multiple Streams Pattern Matching in Multiple Streams

2012-02-15

arxiv.org/abs/1202.3470v2

Computer Science

Data Structures and Algorithms

13 pages, 1 figure

Scientific paper

We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-difference problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.

Affiliated with

Also associated with

No associations

Rating

Pattern Matching in Multiple Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Matching in Multiple Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Matching in Multiple Streams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124783