DBT

DBT

1. Physical data orrganisation

   • Database Storage Model
     • Classical DBMS Architecture
     • Database Cache
     • DB Page Storage Model
     • Tuple Identifiers (TID)
   • Secondary Storage Organisation
     • Magnetic disks
       • Blocks
       • Records
         • Fixed-length records
         • Variable-length records
         • Records with repeated fields
         • Records with fields of variable format
         • Spanned records
       • Block directory
   • Heap Files
     • storage blocks needed
     • Costs for heap organization
   • Efficient Record Access
     • Basic Operations
     • Range Queries
     • Block I/O
   • Hash Files
     • Hash organization
     • Costs for Hash organization
     • Number of buckets
     • Extendible Hashing
   • Index-sequential files
     • Dense Index
     • ISAM
       • ISAM for non-slidable records
   • B-Trees
     • Properties of B-trees
     • Search in a B-tree
     • Splitting after overflow
     • Reorganize B-tree
     • B+-trees
   • Multidimensional Data Access
     • Range queries
     • Partial match queries
     • Multidimensional indexing
   • R-trees
     • R-tree regions
     • 2-dimensional R-tree
     • Properties of R-trees
     • Splitting algorithms for R-trees
   • Using Index Structures
     • Primary Index
     • Secondary Index
     • Cluster Index

2. Query processing in relational DBMS

3. Top-k- and Skyline-Queries

4. Map-Reduce

5. NoSQL Systems