Work

Dictionary matching in a stream

Year: 2015

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1504.06242

Authors: Clifford, Raphael, Fontaine, Allyx, Porat, Ely, Sach, Benjamin, Starikovskaya, Tatiana

Institutions: University of Bristol, Bar-Ilan University

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2952966579

Cites: 17

Cited by: 6

Related to: 20