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 …

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 …

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 …

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

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

We describe the following data structures. For halfspace range reporting, in S-space using
expected preprocessing time O (n log n), worst-case storage O (n log log n) and worst-case …

WC show how to preprocess a set S of points in lRd into an external memory data structure
that efficiently supports linear-constraint queries. Each query is in the form of a linear …

Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …

We describe data structures for representing simplicial meshes compactly while supporting
online queries and updates efficiently. Our data structure requires about a factor of five less …