On searching compressed string collections cache-obliviously
Ferragina, P., Grossi, R., Gupta, A., Shah, R., & Vitter, J. S. Proceedings of the ACM Conference on Principles of Database Systems (PODS), Vancouver, Canada, May 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...