An improved query time for succinct dynamic dictionary matching

Guy Feigenblat, Ely Porat, Ariel Shiftan

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

8 Scopus citations

Abstract

In this work, we focus on building an efficient succinct dynamic dictionary that significantly improves the query time of the current best known results. The algorithm that we propose suffers from only a O((loglogn)2) multiplicative slowdown in its query time and a slowdown for insertion and deletion operations, where n is the sum of all of the patterns' lengths, the size of the alphabet is polylog(n) and ε∈ (0,1). For general alphabet the query time is O((log log n) log σ), where σ is the size of the alphabet. A byproduct of this paper is an Aho-Corasick automaton that can be constructed with only a compact working space, which is the first of its type to the best of our knowledge.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings
PublisherSpringer Verlag
Pages120-129
Number of pages10
ISBN (Print)9783319075655
DOIs
StatePublished - 2014
Event25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 - Moscow, Russian Federation
Duration: 16 Jun 201418 Jun 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8486 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014
Country/TerritoryRussian Federation
CityMoscow
Period16/06/1418/06/14

Fingerprint

Dive into the research topics of 'An improved query time for succinct dynamic dictionary matching'. Together they form a unique fingerprint.

Cite this