Compressed Cache-Oblivious String B-tree

  • Paolo Ferragina
  • Rossano Venturini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8125)

Abstract

In this paper we address few variants of the well-known prefix-search problem in a dictionary of strings, and provide solutions for the cache-oblivious model which improve the best known results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words, pp. 85–96 (1985)Google Scholar
  2. 2.
    Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Fast prefix search in little space, with applications. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 427–438. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string B-trees. In: PODS, pp. 233–242. ACM (2006)Google Scholar
  4. 4.
    Brodal, G.S., Fagerberg, R.: Cache-oblivious string dictionaries. In: SODA, pp. 581–590. ACM Press (2006)Google Scholar
  5. 5.
    Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM J. Comput. 28(5), 1627–1640 (1999)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Demaine, E.D., Iacono, J., Langerman, S.: Worst-case optimal tree layout in a memory hierarchy. CoRR, cs.DS/0410048 (2004)Google Scholar
  7. 7.
    Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246–260 (1974)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Ferragina, P.: On the weak prefix-search problem. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 261–272. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. J. ACM 46(2), 236–280 (1999)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: PODS, pp. 181–190 (2008)Google Scholar
  11. 11.
    Ferragina, P., Venturini, R.: The compressed permuterm index. ACM Transactions on Algorithms 7(1), 10 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Frakes, W., Baeza-Yates, R.: Information Retrieval: Data Structures and Algorithms. Prentice-Hall (1992)Google Scholar
  13. 13.
    Fredkin, E.: Trie memory. Communication of the ACM 3(9), 490–499 (1960)CrossRefGoogle Scholar
  14. 14.
    Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. ACM Transactions on Algorithms 8(1), 4 (2012)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)Google Scholar
  16. 16.
    He, M., Munro, J.I., Rao, S.S.: Succinct ordinal trees based on tree covering. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 509–520. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. 17.
    Hon, W.-K., Shah, R., Vitter, J.S.: Compression, Indexing, and Retrieval for Massive String Data. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 260–274. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  18. 18.
    Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31(2), 249–260 (1987)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Morrison, D.R.: PATRICIA - practical algorithm to retrieve coded in alphanumeric. J. ACM 15(4), 514–534 (1968)CrossRefGoogle Scholar
  20. 20.
    Munro, J.I.: Tables. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 37–42 (1996)Google Scholar
  21. 21.
    Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1) (2007)Google Scholar
  22. 22.
    Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Paolo Ferragina
    • 1
  • Rossano Venturini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations