A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously… Expand

The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.Expand

The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.Expand

A new data structure that is called a priority search tree, of which two variants are introduced, operations (1), (2), and (3) can be implemented in $O(\log n)$ time, where n is the cardinality of D.Expand

The structure of the functions computable in time or space bounded by t is investigated for recursive functions t. The t-computable classes are shown to be closed under increasing recursively… Expand

A key idea is the construction of a number representation behaving as described above, which can be used to model the propagation of modifications in the B-tree along the finger path, with the advantage that access is cheap in the neighborhood of each finger.Expand

A strategy is presented for pagination of B*-trees with variable-length records that results in shallow trees with fast access times and the performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.Expand

The main result illustrates a property of running times similar in interpretation to Borodin's gap theorem, based on the construction of difficult to compute characteristic functions which take the value one very infrequently.Expand