Dictionary matching in a stream
Data Structures and Algorithms
2015-04-24 v1
Abstract
We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(log log(k + m)) time per arriving character and uses O(k log m) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary.
Cite
@article{arxiv.1504.06242,
title = {Dictionary matching in a stream},
author = {Raphael Clifford and Allyx Fontaine and Ely Porat and Benjamin Sach and Tatiana Starikovskaya},
journal= {arXiv preprint arXiv:1504.06242},
year = {2015}
}