Real-Time streaming multi-pattern search for constant alphabet

Shay Golan, Ely Porat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

In the streaming multi-pattern search problem, which is also known as the streaming dictionary matching problem, a set D = {P1, P2, . . . , Pd} of d patterns (strings over an alphabet ∑), called the dictionary, is given to be preprocessed. Then, a text T arrives one character at a time and the goal is to report, before the next character arrives, the longest pattern in the dictionary that is a current suffix of T. We prove that for a constant size alphabet, there exists a randomized Monte-Carlo algorithm for the streaming dictionary matching problem that takes constant time per character and uses O(d logm) words of space, where m is the length of the longest pattern in the dictionary. In the case where the alphabet size is not constant, we introduce two new randomized Monte-Carlo algorithms with the following complexities: O(log log |∑|) time per character in the worst case and O(d logm) words of space. O( 1/ ϵ ) time per character in the worst case and O(d|∑|ϵ log m/ϵ ) words of space for any 0 < ϵ≤1. These results improve upon the algorithm of Clifford et al. [12] which uses O(d logm) words of space and takes O(log log(m + d)) time per character.

Original languageEnglish
Title of host publication25th European Symposium on Algorithms, ESA 2017
EditorsChristian Sohler, Christian Sohler, Kirk Pruhs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770491
DOIs
StatePublished - 1 Sep 2017
Event25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria
Duration: 4 Sep 20176 Sep 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume87
ISSN (Print)1868-8969

Conference

Conference25th European Symposium on Algorithms, ESA 2017
Country/TerritoryAustria
CityVienna
Period4/09/176/09/17

Bibliographical note

Funding Information:
∗ This work is supported in part by ISF grant 1278/16, and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 683064).

Keywords

  • Dictionary
  • Fingerprints
  • Multi-pattern
  • Streaming pattern matching

Fingerprint

Dive into the research topics of 'Real-Time streaming multi-pattern search for constant alphabet'. Together they form a unique fingerprint.

Cite this