Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
Sandra Ober, Martin Winter, Clemens Arth, Horst Bi...