On searching compressed string collections cache-obliviously

@inproceedings{Ferragina2008OnSC,
  title={On searching compressed string collections cache-obliviously},
  author={Paolo Ferragina and Roberto Grossi and Ankur Gupta and Rahul Shah and Jeffrey Scott Vitter},
  booktitle={PODS},
  year={2008}
}
Current data structures for searching large string collections either fail to achieve minimum space or cause too many cache misses. In this paper we discuss some edge linearizations of the classic trie data structure that are simultaneously cache-friendly and compressed. We provide new insights on front coding [24], introduce other novel linearizations, and study how close their space occupancy is to the information-theoretic minimum. The moral is that they are not just heuristics. Our second… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Sorting and Searching, volume 3 of The Art of Computer Programming

  • D. E. Knuth
  • Addison-Wesley, Reading, MA, USA, second edition,
  • 1998
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…