CS522 Advanced database Systems 6/23/2018 CS522 Advanced database Systems Midterm Review Huiping Guo Department of Computer Science California State University, Los Angeles

Midterm Tuesday, 07/05, 6:00 --- 8:30 pm in FA219 Closed book and closed notes Laptops are NOT allowed Calculators are allowed 2 pages of cheat sheets are allowed Letter size, front and back Bring your own scratch paper! Midterm Review CS522_S16

Topics covered Introduction to DBMS Overview of storage and indexing Disks and files Tree indexing Hash indexing Midterm Review CS522_S16

Introduction to DBMS Major components of a DBMS Basic functionality of each component Midterm Review CS522_S16

Topics covered Introduction to DBMS Overview of storage and indexing Disks and files Tree indexing Hash indexing Midterm Review CS522_S16

Storage and indexing File organizations Index Data entries What is a file organization? The alternatives of file organizations Index Tree indexing and hash indexing Index categories Data entries Format: three alternatives Organization: tree and hash Difference between index entry and data entry Midterm Review CS522_S16

You are expected to know Which file organization is good for which data operations Given a simple table Give data entries in different format Build a tree or hash index structure Clustered or unclustered Midterm Review CS522_S16

Topics covered Introduction to DBMS Overview of storage and indexing Disks and files Tree indexing Hash indexing Midterm Review CS522_S16

Disks Storage hierarchy Magnetic disks RAID Structure Disk access time Key to reduce I/O costs How to arrange data on the disk RAID Why RAID Two key techniques Midterm Review CS522_S16

Disk Space Management Manage space on disk How? Keep track of which disk blocks are in use Keep track of which pages are on which disk blocks How? Maintain a list of free blocks Or maintain a bit map with on bit for each disk block Midterm Review CS522_S16

Buffer manager How buffer manager works? Buffer replacement policy What variables does BM keep How does BM handle page request Buffer replacement policy Midterm Review CS522_S16

Files of records Format of a heap file Page format Record format Linked list of pages Directory of pages Page format Fixed-length records Variable-length records Record format Midterm Review CS522_S16

Topics covered Introduction to DBMS Overview of storage and indexing Disks and files Tree indexing Hash indexing Midterm Review CS522_S16

ISAM Structure of ISAM index Operations on ISAM Problems with ISAM Advantages of ISAM Midterm Review CS522_S16

B+ tree index Structure of B+ tree Characteristics of a B+ tree Format of non-leaf and leaf pages Characteristics of a B+ tree Parameters of B+ tree Order, occupancy, fan-out Insertions No split Leaf-page split Non-leaf page spit New root Midterm Review CS522_S16

B+ tree index (cont.) Deletions Handle duplicate Leaf/non-leaf page merge Leaf-page redistribution Non-leaf redistribution Note: maintain minimum occupancy Handle duplicate Two methods Bulk loading algorithm Midterm Review CS522_S16

Topics covered Introduction to DBMS Overview of storage and indexing Disks and files Tree indexing Hash indexing Midterm Review CS522_S16

Hash indexing Static hash indexing Extendible hashing structure operations on hash index Search Insert Local and global variables How to split a bucket When double the size of directory Midterm Review CS522_S16

Hash indexing (Cont.) Linear hashing structure operations on linear index Search Insert How to split a bucket When increase the round number Comparison between hash indexing and tree indexing Midterm Review CS522_S16