DBT - created from Mind Map

Seite 1

Physical data orrganisation

Query processing in relational DBMS

Top-k- and Skyline-Queries

Map-Reduce

NoSQL Systems

Database Storage Model

Secondary Storage Organisation

Heap Files

Efficient Record Access

Hash Files

Index-sequential files

B-Trees

Multidimensional Data Access

R-trees

Using Index Structures

Classical DBMS Architecture

Database Cache

DB Page Storage Model

Tuple Identifiers (TID)

Magnetic disks

Blocks

Records

Block directory

Fixed-length records

Variable-length records

Records with repeated fields

Records with fields of variable format

Spanned records

storage blocks needed

Costs for heap organization

Basic Operations

Range Queries

Block I/O

Hash organization

Costs for Hash organization

Number of buckets

Extendible Hashing

Dense Index

ISAM

ISAM for non-slidable records

Properties of B-trees

Search in a B-tree

Splitting after overflow

Reorganize B-tree

B+-trees

Range queries

Partial match queries

Multidimensional indexing

Primary Index

Secondary Index

Cluster Index

Seite 2