Advertisement

An Improved Query Time for Succinct Dynamic Dictionary Matching

  • Guy Feigenblat
  • Ely Porat
  • Ariel Shiftan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8486)

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 \(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 ε ∈ (0,1). For general alphabet the query time is O((loglogn) 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.

Keywords

Query Time Alphabet Size Space Consumption Deletion Operation Dictionary Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic dictionary matching. J. Comput. Syst. Sci. 49(2), 208–222 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: FOCS, pp. 320–328. IEEE Computer Society (1996)Google Scholar
  3. 3.
    Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Amir, A., Farach, M., Idury, R.M., La Poutré, J.A., Schäffer, A.A.: Improved dynamic dictionary matching. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993, pp. 392–401. Society for Industrial and Applied Mathematics, Philadelphia (1993)Google Scholar
  5. 5.
    Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 397–406. ACM, New York (2000)CrossRefGoogle Scholar
  6. 6.
    Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552–581 (2005)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hon, W.-K., Lam, T.-W., Shah, R., Tam, S.-L., Vitter, J.S.: Succinct index for dynamic dictionary matching. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1034–1043. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Dynamic dictionary matching and compressed suffix trees. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 13–22. Society for Industrial and Applied Mathematics, Philadelphia (2005)Google Scholar
  9. 9.
    Karp, R.M., Miller, R.E., Rosenberg, A.L.: Rapid identification of repeated patterns in strings, trees and arrays. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, STOC 1972, pp. 125–136. ACM, New York (1972)CrossRefGoogle Scholar
  10. 10.
    McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262–272 (1976)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Hon, W.K., Lam, T.W., Shah, R., Tam, S.L., Vitter, J.S.: Compressed index for dictionary matching. In: Proceedings of the Data Compression Conference, DCC 2008, pp. 23–32. IEEE Computer Society, Washington, DC (2008)Google Scholar
  12. 12.
    Belazzougui, D.: Succinct dictionary matching with no slowdown. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 88–100. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Hon, W.-K., Ku, T.-H., Shah, R., Thankachan, S.V., Vitter, J.S.: Faster compressed dictionary matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 191–200. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Rytter, W.: On maximal suffices and constant-space linear-time versions of kmp algorithm. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 196–208. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 134–149. Society for Industrial and Applied Mathematics, Philadelphia (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Guy Feigenblat
    • 1
    • 2
  • Ely Porat
    • 1
  • Ariel Shiftan
    • 1
  1. 1.Department of Computer ScienceBar-Ilan UniversityRamat GanIsrael
  2. 2.IBM Haifa Research LabHaifa University CampusHaifaIsrael

Personalised recommendations