An Improved Query Time for Succinct Dynamic Dictionary Matching

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 \(O(\frac{1}{\epsilon} \log n)\) 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 e ∈ (0,1). For general alphabet the query time is O((loglogn) logσ), where σ is the size of the alphabet.