Dictionary Matching in a Stream

  • Raphaël Clifford
  • Allyx Fontaine
  • Ely Porat
  • Benjamin Sach
  • Tatiana Starikovskaya
Conference paper

DOI: 10.1007/978-3-662-48350-3_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9294)
Cite this paper as:
Clifford R., Fontaine A., Porat E., Sach B., Starikovskaya T. (2015) Dictionary Matching in a Stream. In: Bansal N., Finocchi I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science, vol 9294. Springer, Berlin, Heidelberg

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(loglog(k + m)) time per arriving character and uses O(k logm) 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Raphaël Clifford
    • 1
  • Allyx Fontaine
    • 1
  • Ely Porat
    • 2
  • Benjamin Sach
    • 1
  • Tatiana Starikovskaya
    • 1
  1. 1.Department of Computer ScienceUniversity of BristolBristolUK
  2. 2.Department of Computer ScienceBar-Ilan UniversityRamat GanIsrael

Personalised recommendations