Dictionary matching in a stream - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Dictionary matching in a stream

Résumé

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.

Dates et versions

hal-01798784 , version 1 (23-05-2018)

Identifiants

Citer

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya. Dictionary matching in a stream. 23rd Annual European Symposium {ESA}, 2015, Patras, Greece. ⟨10.1007/978-3-662-48350-3_31⟩. ⟨hal-01798784⟩

Collections

ESPACE-DEV
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More