Add to ORKGTwo modifications of B-trees are described, simple prefix B-trees and prefix B-trees. Both store only parts of keys, namely prefixes, in the index part of a B*-tree. In simple prefix B-trees those prefixes are selected carefully to minimize their length. In prefix B-trees the pre-fixes need not he fully stored, but are reconstructed as the tree is searched. Prefix B-trees are designed to combine some of the advantages of B-trees, digital search trees, and key compres-sion techniques while reducing the processing overhead of compression techniques
Trees are a fundamental structure in computing. They are used in almost every aspect of modeling and...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
Abstract: Efficient data structures for in-memory indexing gain in importance due to (1) the exponen...
This study examines the effect of receding common prefixes of shortest separators and thus extending...
We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link betwe...
It is shown how a highly compact representation of binary trees can be used as the basis of two acce...
Atomic-key B-trees are B-trees with keys of different sizes. This note presents two versions of an i...
Abstract. Designing external memory data structures for string databases is of significant recent in...
Data in relational databases is frequently stored and retrieved using B-Trees. In &cis,ion isugp...
We introduce a method of representing a broad class of binary search trees in an environment in whic...
There is a common problem of operating on hash values of elements of some database. In this paper th...
AbstractSuffix trees and suffix arrays are classical data structures that are used to represent the ...
A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-...
In this paper, we accelerate the processing of tree-based in-dex structures by using SIMD instructio...
Suffix trees and suffix arrays are classical data structures that are used to represent the set of s...
Trees are a fundamental structure in computing. They are used in almost every aspect of modeling and...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
Abstract: Efficient data structures for in-memory indexing gain in importance due to (1) the exponen...
This study examines the effect of receding common prefixes of shortest separators and thus extending...
We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link betwe...
It is shown how a highly compact representation of binary trees can be used as the basis of two acce...
Atomic-key B-trees are B-trees with keys of different sizes. This note presents two versions of an i...
Abstract. Designing external memory data structures for string databases is of significant recent in...
Data in relational databases is frequently stored and retrieved using B-Trees. In &cis,ion isugp...
We introduce a method of representing a broad class of binary search trees in an environment in whic...
There is a common problem of operating on hash values of elements of some database. In this paper th...
AbstractSuffix trees and suffix arrays are classical data structures that are used to represent the ...
A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-...
In this paper, we accelerate the processing of tree-based in-dex structures by using SIMD instructio...
Suffix trees and suffix arrays are classical data structures that are used to represent the set of s...
Trees are a fundamental structure in computing. They are used in almost every aspect of modeling and...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
Abstract: Efficient data structures for in-memory indexing gain in importance due to (1) the exponen...