Real-time indexing over fixed finite alphabets

Amihood Amir, Igor Nor

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

12 Scopus citations

Abstract

The quest for a real-time indexing algorithm is over three decades old. To date there is no convincing understandable solution to this problem. This paper provides a real-time indexing algorithm over a constantsized alphabet. Assuming the text is arriving at a constant rate, the algorithm spends O(1) time on every text symbol. Whenever a length m pattern is given, the algorithm decides in time O(m) whether there is an occurrence of the pattern in the text thus far.

Original languageEnglish
Title of host publicationProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages1086-1095
Number of pages10
StatePublished - 2008
Event19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, United States
Duration: 20 Jan 200822 Jan 2008

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference19th Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CitySan Francisco, CA
Period20/01/0822/01/08

Keywords

  • Pattern matching
  • Quasi real time
  • Real time
  • Suffix tree

Fingerprint

Dive into the research topics of 'Real-time indexing over fixed finite alphabets'. Together they form a unique fingerprint.

Cite this