Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Compressed Document Retrieval on String Collections

Living reference work entry
First Online:
Received:
Accepted:
DOI: https://doi.org/10.1007/978-3-642-27848-8_644-1
How to cite

Years and Authors of Summarized Original Work

2009; Hon, Shah, and Vitter

2013; Belazzougui, Navarro, and Valenzuela

2013; Tsur

2014; Hon, Shah, Thankachan and Vitter

2014; Navarro and Thankachan

Problem Definition

We face the following problem.

Problem 1 (Top-k document retrieval). 

Let\(\mathcal{D} =\{ \mathsf{T}_{1},\mathsf{T}_{2},\ldots ,\mathsf{T}_{D}\}\)

Keywords

Top-k Document retrieval String algorithms Compressed data structures 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Belazzougui D, Navarro G, Valenzuela D (2013) Improved compressed indexes for full-text document retrieval. J Discret Algorithms 18:3–13MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Gagie T, Kärkkäinen J, Navarro G, Puglisi SJ (2013) Colored range queries and document retrieval. Theor Comput Sci 483:36–50CrossRefMATHGoogle Scholar
  3. 3.
    Hon WK, Shah R, Vitter JS (2009) Space-efficient framework for top-k string retrieval problems. In: FOCS, Atlanta, pp 713–722Google Scholar
  4. 4.
    Hon WK, Shah R, Thankachan SV, Vitter JS (2014) Space-efficient frameworks for top-k string retrieval. J ACM 61(2):9MathSciNetCrossRefGoogle Scholar
  5. 5.
    Navarro G (2014) Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Comput Surv 46(4):52CrossRefGoogle Scholar
  6. 6.
    Navarro G, Mäkinen V (2007) Compressed full-text indexes. ACM Comput Surv 39(1):2CrossRefGoogle Scholar
  7. 7.
    Navarro G, Nekrich Y (2012) Top-k document retrieval in optimal time and linear space. In: SODA, Kyoto, pp 1066–1077Google Scholar
  8. 8.
    Navarro G, Thankachan SV (2014) New space/time tradeoffs for top-k document retrieval on sequences. Theor Comput Sci 542:83–97MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Raman R, Raman V, Satti SR (2007) Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans Algorithms 3(4):43MathSciNetCrossRefGoogle Scholar
  10. 10.
    Russo L, Navarro G, Oliveira AL (2011) Fully compressed suffix trees. ACM Trans Algorithms 7(4):53MathSciNetCrossRefGoogle Scholar
  11. 11.
    Shah R, Sheng C, Thankachan SV, Vitter JS (2013) Top-k document retrieval in external memory. In: ESA, Sophia Antipolis, pp 803–814Google Scholar
  12. 12.
    Tsur D (2013) Top-k document retrieval in optimal space. Inf Process Lett 113(12):440–443MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.School of CSEGeorgia Institute of TechnologyAtlantaUSA