CS186 Berkeley Introduction to Database Systems 2021 伯克利 数据库系统

1.3万
17
2020-03-29 21:18:30
128
59
575
43
https://www.youtube.com/playlist?list=PLYp4IGUhNFmw8USiYMJvCUjZe79fvyYge 伯克利数据库系统教程,2021年,课程网页 https://cs186berkeley.net 2021新增了NOSQL, MapReduce and Spark
视频选集
(216/233)
Lec 1 Part 1 Intro and Why
21:49
Lec 1 Part 2 What
18:14
Lec 1 Part 3 Who
07:35
Lec 1 Part 4 How
09:24
Lec 2 SQL 1 Clip 1
05:43
Lec 2 SQL 1 Clip 2
04:36
Lec 2 SQL 1 Clip 3
05:37
Lec 2 SQL 1 Clip 4
05:01
Lec 2 SQL 1 Clip 5
03:59
Lec 2 SQL 1 Clip 6 7
05:02
Lec 3 SQL II 1 4
02:13
Lec 3 SQL II 6 10
02:50
Lec 3 SQL II 11 12
03:13
Lec 3 SQL II 13 15 slides
03:10
Lec 3 SQL II 17 21
03:59
Lec 3 SQL II 23 28
04:57
Lec 3 SQL II 30 34
04:31
Lec 3 SQL II 35
02:08
Lec 3 SQL II 37 39
05:36
Lec 3 SQL II 41 46
06:26
Lec 3 SQL II 48 53
07:13
Lec 3 SQL II 55 56
00:57
Lec 3 SQL II 58 66
06:44
Lec 3 SQL II 68 69
00:58
Lec 4 Part 1 DBMS Architecture
05:11
Lec 4 Part 2 Storage Hierarchy
06:23
Lec 4 Part 3 Components of a Disk
03:30
Lec 4 Part 4 Flash
05:42
Lec 4 Part 6 Disk Space Management
11:25
Lec 4 Part 7 Files
07:36
Lec 4 Part 8 Pages for Fixed Length
05:28
Lec 4 Part 9 Pages for Variable Length
08:00
Lec 4 Part 10 Record Layout
05:47
Lec 4 Part 11 Summary
00:31
Lec 5 Part 1 Review and Goals
03:54
Lec 5 Part 2 Model and Assumptions
03:54
Lec 5 Part 3 Scan
02:12
Lec 5 Part 4 Equality
05:17
Lec 5 Part 5 Range Search
01:42
Lec 5 Part 6 Insert
02:11
Lec 5 Part 7 Delete
01:18
Lec 5 Part 8 Summary
00:32
Lec 6 Part 1 Intro to Indexes
05:14
Lec 6 Part 2 High Fan out Search Tree
04:23
Lec 6 Part 3 Search and Insertion in ISAM
05:11
Lec 6 Part 4 B+ Tree Intro
05:01
Lec 6 Part 5 B+ Tree Search
00:51
Lec 6 Part 6 B+ Tree Insertion by example
05:16
Lec 6 Part 7 B+ Tree Insertion
04:30
Lec 6 Part 8 B+ Tree Deletion
01:36
Lec 6 Part 9 Bulk Loading
04:56
Lec 6 Part 10 Summary
02:06
Lec 7 Part 1 Lec Introduction
00:53
Lec 7 Part 2 Query Support Overview
03:56
Lec 7 Part 3 Composite Search Keys in One Dimension
08:52
Lec 7 Part 4 Three Alternatives for Data Entry Storage
05:53
Lec 7 Part 5 Clustered vs Unclustered Indexes
05:46
Lec 7 Part 6 Variable Length Keys
06:19
Lec 7 Part 7 Clustered B+ Tree Cost Model
07:34
Lec 7 Part 8 Lec Summary
01:41
Lec 8 Part 1 Intro to Buffer Management
00:53
Lec 8 Part 2 Mapping Pages
01:50
Lec 8 Part 3 Dirty Pages
02:16
Lec 8 Part 4 Buf Mgr State
02:11
Lec 8 Part 5 Page Replacement
04:50
Lec 8 Part 6 LRU
03:17
Lec 8 Part 7 Clock
04:06
Lec 8 Part 8 LRU and Sequential Flooding
03:42
Lec 8 Part 9 MRU and Repeated Scans
02:44
Lec 8 Part 10 Additional Topics
07:02
Lec 8 Part 11 Summary
01:51
Lec 9 Part 1 Out of Core Algs
05:25
Lec 9 Part 2 Double Buffering
02:19
Lec 9 Part 3 Sort Hash Specs
01:13
Lec 9 Part 4 Two Way Sorting
02:27
Lec 9 Part 5 External Sort
05:56
Lec 9 Part 6 External Hashing
06:15
Lec 9 Part 7 Recursive Partitioning for External Hash
02:12
Lec 9 Part 8 Sort Hash Duality
01:31
Lec 9 Part 9 parallel hashing
03:33
Lec 9 Part 10 parallel sort
02:35
Lec 9 Part 11 Sort v Hash
02:49
Lec 9 Part 12 Summary
00:57
Lec 10 Part 1 Intro
05:12
Lec 10 Part 2 Unary Operators
08:01
Lec 10 Part 3 Set Operators
06:52
Lec 10 Part 4 Joins
04:32
Lec 10 Part 5 GroupBy and Summary
01:47
Lec 11 Part 1 Intro and Select
07:00
Lec 11 Part 2 HeapScan and Sort Iterators
04:09
Lec 11 Part 3 Group By Iterator
06:43
Lec 11 Part 4 Cost Model for Subsequent Analysis
01:23
Lec 11 Part 5 Nested Loops Join
05:49
Lec 11 Part 6 Index Nested Loops Join
03:37
Lec 11 Part 7 Sort Merge Join
04:45
Lec 11 Part 8 Sort Merge Cost and a Refinement
05:07
Lec 11 Part 9 Grace Hash Join
05:54
Lec 11 Part 10 Grace Hash, Animated
03:41
Lec 11 Part 11 Hash Join Costs
03:55
Lec 11 Part 12 Conclusion
02:58
Lec 13 Part 1 Intro
03:08
Lec 13 Part 2 Big Picture
07:19
Lec 13 Part 3 Algebra Equivalences
04:22
Lec 13 Part 4 Heuristics
03:45
Lec 13 Part 5 Physical Equivalences
01:24
Lec 13 Part 6 Running Example
02:05
Lec 13 Part 7 Selection Pushdown
02:46
Lec 13 Part 8 Join Orders
03:22
Lec 13 Part 9 Join Algs
03:44
Lec 13 Part 10 Projection Pushdown
02:18
Lec 13 Part 11 Indexes
01:37
Lec 13 Part 12 Conclusion
01:15
Lec 14 Part 1 Introduction
05:16
Lec 14 Part 2 Background Query Blocks and Physical Properties
04:33
Lec 14 Part 3 Plan Space
02:42
Lec 14 Part 4 Selectivity Estimation
04:40
Lec 14 Part 5 Selectivity in More Depth
05:30
Lec 14 Part 6 Using Histograms for Selectivity Estimation
07:28
Lec 14 Part 7 Selectivity for Join Queries
03:24
Lec 14 Part 8 Summary of Cost Estimation
01:36
Lec 14 Part 9 Single Table Plans
05:28
Lec 14 Part 10 Dynamic Programming
08:59
Lec 14 Part 11 Example Query
03:18
Lec 14 Part 12 Summary of Query Optimization
01:15
Parallel Part 1 Intro to Parallelism
06:48
Parallel Part 2 A Bit of History
01:51
Parallel Part 3 Parallel Architectures and Software Structures
03:44
Parallel Part 4 Kinds of Query Parallelism
03:34
Parallel Part 5 Parallel Data Acceess
04:46
Parallel Part 6 Parallel Hash Join
05:47
Parallel Part 7 Parallel Sort-Merge
03:22
Parallel Part 8 Parallel Grouping_Aggregation
03:14
Parallel Part 9 Summary of Parallel Query Execution
03:37
Parallel Part 10 One-Sided and Broadcast Join Patterns
01:35
Parallel Part 11 Summary of Parallel Query Execution
03:37
Lec 15 Part 1 Intro to Text Search
09:03
Lec 15 Part 2 Bag of Words
02:11
Lec 15 Part 3 Inverted Files and Single
04:34
Lec 15 Part 4 Inverted Indexes and Boolean Logic
05:24
Lec 15 Part 5 Phrase Queries and Content Results
02:55
Lec 15 Part 6 Updating Text Indexes
05:55
Lec 15 Part 7 Text Search Summary
06:47
Lec 16 Introduction
01:02
Lec 16 Part 2 Overview of DB Design
03:11
Lec 16 Part 3 Data Models and Relational Levels of Abstraction
02:57
Lec 16 Part 4 Data Independence
05:29
Lec 16 Part 6 Basics of Entities and Relationships
02:44
Lec 16 Part 7 Key and Participation Constraints
03:50
Lec 16 Part 8 Weak Entities
02:37
Lec 16 Part 9 Alternative Notation and Terminology
04:00
Lec 16 Part 10 Binary vs Ternary Relationships
04:19
Lec 16 Part 11 Aggregation and Ternary Relationships
02:51
Lec 16 Part 12 Entities vs Attributes
03:06
Lec 16 Part 13 Entities vs Relationships
03:29
Lec 16 Part 14 Converting ER to Relational
05:22
Lec 16 Part 15 Translating Weak Entity Sets
01:43
Lec 16 part 16 Summary
03:13
Lec 17 Part 1 Functional Dependencies
07:19
Lec 17 Part 2 Anomalies
04:08
Lec 17 Part 3 Armstrongs Axioms
05:11
Lec 17 Part 4 Attribute Closures
04:18
Lec 17 Part 5 BCNF and other Normal Forms
05:45
Lec 17 Part 6 Lossless Join Decompositions
10:42
Lec 17 Part 7 Dependency Preservation and BCNF Decomposition
08:13
Lec 17 Part 8 Conclusion
01:56
Lec 18 Part 1 Intro to Transactions
06:26
Lec 18 Part 2 Examples and Problems
06:15
Lec 18 Part 3 The Transaction Model
04:47
Lec 18 Part 4 ACID Properties of Transactions
07:39
Lec 18 Part 5 Serializability
06:06
Lec 18 Part 6 Conflict Serializability
05:22
Lec 18 Part 7 Conflict Dependency Graphs
02:40
Lec 18 Part 8 View Serializability
03:39
Lec 19 Part 01 Two Phase Locking
03:51
Lec 19 Part 2 Strict 2PL
02:05
Lec 19 Part 3 Concurrency Examples
05:08
Lec 19 Part 04 Lock Manager Implementation
04:37
Lec 19 Part 5 Deadlock Scenarios and Prevention
03:28
Lec 19 Part 6 Deadlock Avoidance
02:52
Lec 19 Part 7 Deadlock Detection and Resolution
02:44
Lec 19 Part 8 Intro to Multigranularity Locking
02:45
Lec 19 Part 9 Intent Locks and Hierarchical Lock Protocol
03:57
Lec 19 Part 10 FYI
03:53
Lec 19 Part 11 Conclusion
01:46
Lec 20 Part 1 Recovery Intro
03:35
Lec 20 Part 2 Need for Atomicity and Durability, SQL support for Transactions
06:54
Lec 20 Part 3 Strawman Solution
05:12
Lec 20 Part 4 STEAL _ NO FORCE, UNDO and REDO
04:42
Lec 20 Part 5 Intro to Write
06:12
Lec 20 Part 6 Lec 20 Part 6 ARIES Log Records
06:10
Lec 20 Part 7
02:54
Lec 20 Part 8 ARIES Abort and Checkpointing
06:47
Lec 20 Part 9 ARIES Recovery
03:19
Lec 20 Part 10 Redo
05:15
Lec 20 Part 11 Undo
02:45
Lec 20 Part 12 Example of Recovery
05:54
Lec 20 Part 13 Summary
02:13
Lec 21 1 Cosine Similarity
04:49
Lec 21 2 TFxIDF
06:56
Lec 21 3 Precision and Recall
02:31
Lec 21 4 Parallelization and Zipf Distributions
04:37
Lec 21 5 n
07:10
Lec 21 6 PageRank
03:18
Lec 21 7 Notes from the Real World
05:26
Lec 21 8 Webcrawler Intro
03:35
Lec 21 9 Webcrawler Refinements
05:00
Lec 21 10 Conclusion
00:43
Lec 22 Part 1 Introduction to Distributed Transactions
03:50
Lec 22 Part 2 Distributed Locking
02:27
Lec 22 Part 3 Distributed Deadlock Detection
01:34
Lec 22 Part 4 Intro to Distributed Commit
02:58
Lec 22 Part 5 Simple 2PC
03:45
Lec 22 Part 6 Full 2PC Including Logging (Presumed Abort)
03:00
Lec 22 Part 7 The Recovery Processes
03:39
Lec 22 Part 8 2PC, Locking and Availability
05:39
Lec 22 Part 9
01:40
Lec 23 Part 1 Organization of Database Applications
06:48
Lec 23 Part 2 Scaling Relational Databases
05:07
Lec 23 Part 3 Taxonomy of NoSQL Data Models
06:01
Lec 23 Part 4 Introduction to JSON
07:38
Lec 23 Part 5 Mapping between Relational Data and JSON
03:58
Lec 23 Part 6 Summary of NoSQL Data Models
01:19
Lec 23 Part 7 Introduction to MongoDB
05:20
Lec 23 Part 8 MQL Retrieval Queries
03:24
Lec 23 Part 9 MQL Aggregations and Updates
05:27
Lec 23 Part 10 MongoDB Internals and Summary
01:41
Lec 24 Part 1 Motivation for MapReduce
07:36
Lec 24 Part 2 MapReduce Data and Programming Model
09:03
Lec 24 Part 3 MapReduce Implementation
05:24
Lec 24 Part 4 Implementing Relational Operators
05:29
Lec 24 Part 5 Introduction to Spark
04:40
Lec 24 Part 6 Programming in Spark
07:15
Lec 24 Part 7 Spark Datasets and Conclusions
02:50
客服
顶部
赛事库 课堂 2021拜年纪