Main content

This entry is from Winter semester 2022/23 and might be obsolete. You can find a current equivalent here.

CS 571 — Index and Storage Structures
(dt. Index und Speicherstrukturen)

Level, degree of commitment Specialization module, compulsory elective module
Forms of teaching and learning,
workload
Lecture (2 SWS), recitation class (2 SWS),
180 hours (60 h attendance, 120 h private study)
Credit points,
formal requirements
6 CP
Course requirement(s): Successful completion of at least 50 percent of the points from the weekly exercises as well as at least 2 presentations of the tasks.
Examination type: Oral or written examination
Language,
Grading
German,
The grading is done with 0 to 15 points according to the examination regulations for the degree program M.Sc. Computer Science.
Duration,
frequency
One semester,
Zweijährlich im Wintersemester
Person in charge of the module's outline Prof. Dr. Bernhard Seeger

Contents

  • file systems
  • B-trees and variants
  • External Hashing
  • Multidimensional index structures
  • Index structures for spatial databases
  • Temporal Index Structures
  • High-dimensional index structures
  • Index Structures in Database Systems
  • concurrency and recovery for index structures

Qualification Goals

  • Acquisition of techniques for the development of external data structures and algorithms,
  • Evaluation of external data structures with regard to runtime, storage space and throughput,
  • Creation of data structures within a system-oriented environment,
  • Dealing with index structures in commercial database systems,
  • Practice of scientific working methods (recognition, formulation, solving problems, training of abstraction skills),
  • Training of oral communication skills in the exercises by practicing free speech in front of an audience and during discussion.

Prerequisites

None. The competences taught in the following modules are recommended: either Algorithms and Data Structures or Practical Informatics II: Data Structures and Algorithms for Pre-Service-Teachers.


Applicability

Module imported from M.Sc. Computer Science.

It can be attended at FB12 in study program(s)

  • B.Sc. Computer Science
  • M.Sc. Data Science
  • M.Sc. Computer Science
  • M.Sc. Mathematics
  • M.Sc. Business Mathematics
  • LAaG Computer Science

When studying B.Sc. Computer Science, this module can be attended in the study area Compulsory Elective Modules in Computer Science.

The module is assigned to Practical Computer Science. Further information on eligibility can be found in the description of the study area.


Recommended Reading

  • Kemper, Eickler: Datenbanksysteme, Oldenbourg.
  • Cormen, Leierson, Rivest, Stein: Algorithmen - Eine Einführung. Oldenbourg.
  • Härder, Rahm: Datenbanksysteme. Konzepte und Techniken der
  • Implementierung, Springer.
  • Saake, Heuer, Sattler: Datenbanken: Implementierungstechniken, mitp.



Please note:

This page describes a module according to the latest valid module guide in Winter semester 2022/23. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:

The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.

The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.