Database Courses

Course Objectives

To learn the representation, storage, organization of, and access to information items.
To focus on the main design goal of IR systems, i.e., retrieving information which might be useful to the users.
To study and understand different techniques and algorithms used in IR systems.
To become familiar with how people interpret and use information from a computer scientist's perspective.

Course Objectives:

To cover the file organization and management and a variety of data access techniques of a database system.
To cover database implementation involving concurrency control, recovery from failure, transaction management, and deadlock.
To survey various topics related to database management systems, including caching scheme for Client-Server DBMS and data consistency of DBMS, etc.

Topics

Storage and File Structure
- System Structure & Storage Devices
- Storage & Buffer Management
- File Organization
Indexing and Hashing
- Indexing
- B⁺-Tree/B-Tree Indexing
- Hashing
Query Processing
- Query Optimization
- Selection Operation
- Join Strategies & Evaluations
Transactions
- Transactions
- Serializability & Recoverability
- Testing for Serializability
Concurrent Control
- Log-Based Protocols
- Timestamp-Based Protocols
- Deadlock Handling
Recovery System
- Recovery: Transactions
- Log-Based Recovery
- Shadow Paging Recovery & Checkpoints
- Recovery: Buffer Management

Course Objectives:

to study the theory of computation
to learn the traditional topics of formal languages, automata, computability, and computational complexity
to understand the foundations of theoretical computer science

Topics

Finite State Automata and Regular Languages
- Finites state machines
- Limitations of finite state machines
- Non-deterministic FSA
- Regular grammars
- Regular expressions
Push Down Automata and Context Free Languages
- Push down automata - formal definitions
- Context free grammars
- Limitations of push down automata
- Non-deterministic PDA
- Lookahead/parsing, LL(k), LR(k)
Turing machine and unrestricted grammars
- Turing machines
- Turing machine extensions
- Unrestricted grammars
- Computability - Church's thesis, TM encoding, universal TM
- Undecideable (halting) & uncomputable languages, enumerability
Other variations
- Recursive function theory
- Primitive recursive functions
- Partial recursive functions
- Turing equivalence
CS 452 Database Modeling Concepts
Course Objectives
- To learn the concepts and terminology associated with the field of database management systems.
- To study the database design methodologies and design issues.
- To survey various topics related to database management systems, including database query languages, commercial systems, etc.
Topics

Purpose of DBMS, DB Terminology

Entity-Relationship Model

Relational Model

SQL

Integrity Constraints

Relational Database Design

Logic-Based Data Model

Object-Oriented Databases

Object-Relational Databases

XML

Course Objectives:

To understand the principles that guide the design of distributed DBMSs.
To become acquaintance with current design problems of distributed DBMSs.
To apply concepts learned to enhance the current design theory, methods, and algorithms of distirbuted DBMSs.

Topics