Abstract

Abstract We present static cache-oblivious dictionary structuresfor strings which provide analogues of tries and suffix trees in the cache-oblivious model. Our constructiontakes as input either a set of strings to store, a single string for which all suffixes are to be stored, a trie, acompressed trie, or a suffix tree, and creates a cacheoblivious data structure which performs prefix queriesin O(logB n + |P |/B) I/Os, where n is the number ofleaves in the trie, P is the query string, and B is theblock size. This query cost is optimal for unbounded alphabets. The data structure uses linear space. 1 Introduction Strings are one of basic data models of computer science.They have numerous applications, e.g. for textual and biological data, and generalize other models such asintegers and multi-dimensional data. A basic problem in the model is to store a set of strings such thatstrings in the set having a given query string

Citations