CS-310 Lecture 08 - Relational Databases скачать в хорошем качестве

CS-310 Lecture 08 - Relational Databases

Outline: 0:04 Last Time: Load balancers 2:54 On to Databases 4:09 Back to Wikipedia 6:57 Computers have a hierarchy of storage 12:14 MediaWiki 12:15 Computers have a hierarchy of storage 14:54 Storage has limited bandwidth 19:39 Redundant Array of Independent Disks (RAID) 23:31 Basic idea of RAID 25:25 A Database Server @ NU 28:05 Large database servers 31:48 Persistent (disk) storage has always been different 34:57 Relational DBs 39:41 Why so many tables? 44:57 DB Design diagram: (my style) 48:25 For more coverage of relational DB schema design: 49:25 SQL Query language 53:24 Why a Relational Database? 57:45 Can we just read/write files to disk to achieve... 58:32 Filesystem is like a basic database, it gives: 1:00:41 Indexing 1:01:38 Why sorting is not enough 1:03:36 A printed catalog can add multiple indexes 1:05:51 DB indexes use a tree or hashtable instead of sorting 1:06:43 Balanced binary search tree 1:09:03 Creating indexes/keys 1:10:52 Multiple indexes in one table are possible 1:12:27 Composite indexes involve multiple columns 1:13:18 Query execution plans 1:14:53 When to index columns? 1:15:39 Indexes are not free! 1:17:26 Key and Index terminology in SQL 1:18:40 Summary These lectures were delivered by Professor Steve Tarzia in Winter 2021 for his CS-310 Scalable Software Architectures course at Northwestern University. This class was formerly numbered CS-396. Course materials and slides can be downloaded from https://stevetarzia.com/teaching