Data Structures for Databases

← Back to document page

60Data Structures for DatabasesJoachim HammerUniversity of FloridaMarkus SchneiderUniversity of Overview of the Functionality of a DatabaseManagement Data Structures for Query Structures Sorting Large Files The Parse Tree Expression Trees Data Structures for Buffer Data Structures for Disk Space Organizations Page Organizations Overview of the Functionality of a Database Manage-ment SystemMany of the previous chapters have shown that efficient strategies for complex data-structuring problems are essential in the design of fast algorithms for a variety of ap-plications, including combinatorial optimization, information retrieval and Web search, Databases and data mining, and geometric applications. The goal of this chapter is toprovide the reader with an overview of the important data Structures that are used in theimplementation of a modern, general-purpose database management system (DBMS).

Data Structures for Databases 60-5 include a separate description of the data structures used to sort large flles using external memory (Section 60.2.2). 60.2.1 Index Structures An important part of the work of the physical plan generator is to chose an e–cient im-/+

  Structure