Summary: External Memory Data Structures
(Invited Paper)
Lars Arge ?
Department of Computer Science, Duke University, Durham, NC 27708, USA
Abstract. 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 often need to be stored
in data structures on external storage devices, and in such cases the
Input/Output (or I/O) communication between internal and external
memory can become a major performance bottleneck. In this paper we
survey recent advances in the development of worst­case I/O­efficient
external memory data structures.
1 Introduction
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 dynami­
cally changing datasets often need to be stored in space efficient data structures
on external storage devices such as disks, and in such cases the Input/Output
(or I/O) communication between internal and external memory can become a
major performance bottleneck. Many massive dataset applications involve ge­
ometric data (for example, points, lines, and polygons) or data which can be

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences