Dictionary matching in a stream

Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya

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

Dictionary matching in a stream

Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya

Department of Computer Science

University of Bristol

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 Scopus citations

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 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.

Original language	English
Title of host publication	Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings
Editors	Nikhil Bansal, Irene Finocchi
Publisher	Springer Verlag
Pages	361-372
Number of pages	12
ISBN (Print)	9783662483497
DOIs	https://doi.org/10.1007/978-3-662-48350-3_31
State	Published - 2015
Event	23rd European Symposium on Algorithms, ESA 2015 - Patras, Greece Duration: 14 Sep 2015 → 16 Sep 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9294
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd European Symposium on Algorithms, ESA 2015
Country/Territory	Greece
City	Patras
Period	14/09/15 → 16/09/15

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.

Funding

Funders	Funder number
Engineering and Physical Sciences Research Council	EP/J019283/1

Access to Document

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

Cite this

Clifford, R., Fontaine, A., Porat, E., Sach, B., & Starikovskaya, T. (2015). Dictionary matching in a stream. In N. Bansal, & I. Finocchi (Eds.), Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings (pp. 361-372). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9294). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_31

Clifford, Raphaël ; Fontaine, Allyx ; Porat, Ely et al. / Dictionary matching in a stream. Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. editor / Nikhil Bansal ; Irene Finocchi. Springer Verlag, 2015. pp. 361-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c3be84ac99e84c108f4f0fcbd6e95409,

title = "Dictionary matching in a stream",

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 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.",

author = "Rapha{\"e}l Clifford and Allyx Fontaine and Ely Porat and Benjamin Sach and Tatiana Starikovskaya",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 23rd European Symposium on Algorithms, ESA 2015 ; Conference date: 14-09-2015 Through 16-09-2015",

year = "2015",

doi = "10.1007/978-3-662-48350-3_31",

language = "אנגלית",

isbn = "9783662483497",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "361--372",

editor = "Nikhil Bansal and Irene Finocchi",

booktitle = "Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings",

address = "גרמניה",

}

Clifford, R, Fontaine, A, Porat, E, Sach, B & Starikovskaya, T 2015, Dictionary matching in a stream. in N Bansal & I Finocchi (eds), Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9294, Springer Verlag, pp. 361-372, 23rd European Symposium on Algorithms, ESA 2015, Patras, Greece, 14/09/15. https://doi.org/10.1007/978-3-662-48350-3_31

Dictionary matching in a stream. / Clifford, Raphaël; Fontaine, Allyx; Porat, Ely et al.
Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. ed. / Nikhil Bansal; Irene Finocchi. Springer Verlag, 2015. p. 361-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9294).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dictionary matching in a stream

AU - Clifford, Raphaël

AU - Fontaine, Allyx

AU - Porat, Ely

AU - Sach, Benjamin

AU - Starikovskaya, Tatiana

PY - 2015

Y1 - 2015

N2 - 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 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.

AB - 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 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.

UR - http://www.scopus.com/inward/record.url?scp=84945536003&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-48350-3_31

DO - 10.1007/978-3-662-48350-3_31

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84945536003

SN - 9783662483497

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 372

BT - Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings

A2 - Bansal, Nikhil

A2 - Finocchi, Irene

PB - Springer Verlag

T2 - 23rd European Symposium on Algorithms, ESA 2015

Y2 - 14 September 2015 through 16 September 2015

ER -

Clifford R, Fontaine A, Porat E, Sach B, Starikovskaya T. Dictionary matching in a stream. In Bansal N, Finocchi I, editors, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Springer Verlag. 2015. p. 361-372. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-48350-3_31

Dictionary matching in a stream

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this