Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

A method, apparatus and computer program product for storing data in a disk storage
system is presented. A high-performance dictionary data structure is defined. The dictionary …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

We present a technique for designing external memory data structures that support batched
operations I/O efficiently. We show how the technique can be used to develop external …

We present the software library Stxxl that is an implementation of the C++ standard template
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …

Neighbor-joining is a well-established hierarchical clustering algorithm for inferring
phylogenies. It begins with observed distances between pairs of sequences, and clustering …

Many modern applications store and process datasets much larger than the main memory of
even state-of-the-art high-end machines. Thus massive and dynamically changing datasets …

The cache hierarchy prevalent in todays high performance processors has to be taken into
account in order to design algorithms that perform well in practice. This paper advocates the …

There is arguably no field in greater need of a comprehensive handbook than computer
engineering. The unparalleled rate of technological advancement, the explosion of …