Summary: Chapter 1
EXTERNAL MEMORY
DATA STRUCTURES
Lars Arge
Abstract
In many massive dataset applications the data must be stored in
space and query efficient data structures on external storage devices.
Often the data needs to be changed dynamically. In this chapter we
discuss recent advances in the development of provably worst­case effi­
cient external memory dynamic data structures. We also briefly discuss
some of the most popular external data structures used in practice.
1. INTRODUCTION
Massive datasets often need to be stored in space efficient data struc­
tures on external storage devices. These structures are used to store
a dynamically changing dataset such that queries can be answered effi­
ciently. Many massive dataset applications involve geometric data (for
example, points, lines, and polygons) or data which can be interpreted
geometrically. Such applications often perform queries which correspond
to searching in massive multidimensional geometric databases for objects
that satisfy certain spatial constraints. Typical queries include reporting

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

Collections: Computer Technologies and Information Sciences