加州大学伯克利分校 CS 186 数据库系统导论 Introduction to Database Systems(Fall 2018)

3.0万
44
2020-12-15 14:22:15
正在缓冲...
360
163
1590
117
https://cs186berkeley.net/
星星之火,可以燎原
视频选集
(1/217)
自动连播
1-1 Intro and Why
21:49
1-2 What
18:14
1-3 Who
07:35
1-4 How
09:24
2-1 SQL 1
05:43
2-2 SQL 2
04:36
2-3 SQL 3
05:37
2-4 SQL 4
05:01
2-5 SQL 5
03:59
2-6 SQL 6
05:02
3-1 SQL Cont 1
02:13
3-2 SQL Cont 2
02:50
3-3 SQL Cont 3
03:13
3-4 SQL Cont 4
03:10
3-5 SQL Cont 5
03:59
3-6 SQL Cont 6
04:57
3-7 SQL Cont 7
04:31
3-8 SQL Cont 8
02:08
3-9 SQL Cont 9
05:36
3-10 SQL Cont 10
06:26
3-11 SQL Cont 11
07:13
3-12 SQL Cont 12
00:57
3-13 SQL Cont 13
06:44
3-14 SQL Cont 14
00:58
4-1 Architecture
05:11
4-2 Storage Hierarchy
06:23
4-3 Components of a Disk
03:30
4-4 Flash
05:42
4-5 Storage Pragmatics and Trends
04:17
4-6 Disk Space Management
11:25
4-7 Files
07:36
4-8 Pages for Fixed Length
05:28
4-9 Pages for Variable Length
08:00
4-10 Record Layout
05:47
4-11 Summary
00:31
5-1 Review and Goals
03:54
5-2 Model and Assumptions
03:54
5-3 Scan
02:12
5-4 Equality
05:17
5-5 Range Search
01:42
5-6 Insert
02:11
5-7 Delete
01:18
5-8 Summary
00:32
6-1 Intro to Indexes
05:14
6-2 High Fan out Search Tree
04:23
6-3 Search and Insertion in ISAM
05:11
6-4 B+ Tree Intro
05:01
6-5 Searching the B+ Tree
00:51
6-6 Insert into B+ Tree
05:16
6-7 Split
04:30
6-8 B+ Tree Deletion
01:36
6-9 Bulk Loading
04:56
6-10 Summary
02:06
7-1 Lecture Introduction
00:53
7-2 Query Support Overview
03:56
7-3 Composite Search Keys in One Dimension
08:52
7-4 Three Alternatives for Data Entry Storage
05:53
7-5 Clustered vs Unclustered Indexes
05:46
7-6 Variable Length Keys_ Occupancy and Compression
06:19
7-7 Clustered B+ Tree Cost Model
07:35
7-8 Summary
01:41
8-1 Intro to Buffer Management
00:53
8-2 Mapping Pages
01:50
8-3 Dirty Pages
02:16
8-4 Buf Mgr State
02:11
8-5 Page Replacement
04:50
8-6 LRU
03:17
8-7 Clock
04:06
8-8 LRU and Sequential Flooding
03:42
8-9 MRU and Repeated Scans
02:44
8-10 Additional Topics
07:02
8-11 Summary
01:51
9-1 Out of Core Algs
05:25
9-2 Double Buffering
02:19
9-3 Sort Hash Specs
01:13
9-4 Two Way Sorting
02:27
9-5 External Sort
05:56
9-6 External Hashing
06:15
9-7 Recursive Partitioning for External Hash
02:12
9-8 Sort Hash Duality
01:31
9-9 Parallel Hashing
03:33
9-10 Parallel Sort
02:35
9-11 Sort v Hash
02:50
9-12 Summary
00:57
10-1 Intro
05:12
10-2 Unary Operators
08:01
10-3 Set Operators
06:52
10-4 Joins
04:32
10-5 GroupBy and Summary
01:47
11-1 Intro and Select
07:00
11-2 HeapScan and Sort Iterators
04:09
11-3 Group By Iterator
06:43
11-4 Cost Model for Subsequent Analysis
01:23
11-5 Nested Loops Join
05:49
11-6 Index Nested Loops Join
03:37
11-7 Sort Merge Join
04:45
11-8 Sort Merge Cost and a Refinement
05:07
11-9 Hash Join
05:54
11-10 Grace Hash Join
03:41
11-11 Hash Join Costs
03:55
11-12 Conclusion
02:58
12-1 Intro to Parallelism
06:48
12-2 A Bit of History
01:51
12-3 Parallel Architectures and Software Structures
03:44
12-4 Kinds of Query Parallelism
03:34
12-5 Parallel Data Acceess
04:46
12-6 Parallel Hash Join
05:47
12-7 Parallel Sort-Merge Join
03:22
12-8 Parallel Grouping_Aggregation
03:14
12-9 Symmetric Hash Join
03:29
12-10 One-Sided and Broadcast Join Patterns
01:35
12-11 Summary of Parallel Query Execution
03:37
13-1 Intro
03:08
13-2 Big Picture
07:19
13-3 Algebra Equivalences
04:22
13-4 Heuristics
03:45
13-5 Physical Equivalences
01:24
13-6 Running Example
02:05
13-7 Selection Pushdown
02:46
13-8 Join Orders
03:22
13-9 Join Algs
03:44
13-10 Projection Pushdown
02:18
13-11 Indexes
01:37
13-12 Conclusion
01:15
14-1 Introduction
05:16
14-2 Background Query Blocks and Physical Properties
04:33
14-3 Plan Space
02:42
14-4 Selectivity Estimation
04:40
14-5 Selectivity in More Depth
05:30
14-6 Using Histograms for Selectivity Estimation
07:28
14-7 Selectivity for Join Queries
03:24
14-8 Summary of Cost Estimation
01:36
14-9 Single Table Plans
05:28
14-10 Dynamic Programming
08:59
14-11 Example Query
03:18
14-12 Summary of Query Optimization
01:15
15-1 Intro to Text Search
09:03
15-2 Bag of Words
02:11
15-3 Inverted Files and Single-Term Queries
04:34
15-4 Inverted Indexes and Boolean Logic
05:24
15-5 Phrase Queries and Content Results
02:55
15-6 Updating Text Indexes
05:55
15-7 Text Search Summary
06:47
16-1 Introduction
01:02
16-2 Overview of DB Design
03:11
16-3 Data Models and Relational Levels of Abstraction
02:57
16-4 Data Independence
05:29
16-6 Basics of Entities and Relationships
02:45
16-7 Key and Participation Constraints
03:50
16-8 Weak Entities
02:37
16-9 Alternative Notation and Terminology
04:00
16-10 Binary vs Ternary Relationships
04:19
16-11 Aggregation and Ternary Relationships
02:51
16-12 Entities vs Attributes
03:06
16-13 Entities vs Relationships
03:29
16-14 Converting ER to Relational
05:22
16-15 Translating Weak Entity Sets
01:43
16-16 Summary
03:13
17-1 Functional Dependencies
07:19
17-2 Anomalies
04:08
17-3 Armstrongs Axioms
05:11
17-4 Attribute Closures
04:18
17-5 BCNF and other Normal Forms
05:45
17-6 Lossless Join Decompositions
10:42
17-7 Dependency Preservation and BCNF Decomposition
08:13
17-8 Conclusion
01:56
18-1 Intro to Transactions
06:26
18-2 Examples and Problems
06:16
18-3 The Transaction Model
04:47
18-4 ACID Properties of Transactions
07:39
18-5 Serializability
06:06
18-6 Conflict Serializability
05:22
18-7 Conflict Dependency Graphs
02:40
18-8 View Serializability
03:39
19-1 Two Phase Locking
03:51
19-2 Strict 2PL
02:05
19-3 Concurrency Examples
05:08
19-4 Lock Manager Implementation
04:37
19-5 Deadlock Scenarios and Prevention
03:28
19-6 Deadlock Avoidance
02:52
19-7 Deadlock Detection and Resolution
02:44
19-8 Intro to Multigranularity Locking
02:45
19-9 Intent Locks and Hierarchical Lock Protocol
03:57
19-10 FYI Index Latching and Phantoms
03:53
19-11 Conclusion
01:46
20-1 Recovery Intro
03:35
20-2 Need for Atomicity and Durability, SQL support for Transactions
06:54
20-3 Strawman Solution
05:12
20-4 STEAL NO FORCE, UNDO and REDO
04:42
20-5 Intro to Write-Ahead Logging
06:12
20-6 ARIES Logging
06:10
20-7 ARIES Logging Simple Case
02:54
20-8 ARIES Abort and Checkpointing
06:47
20-9 ARIES Recovery Overview and Analysis Phase
03:19
20-10 ARIES Recovery, REDO Phase
05:15
20-11 ARIES Recovery, UNDO Phase
02:45
20-12 Example Scenarios, Additional FAQs
05:54
20-13 Recovery Conclusion
02:13
21-1 Cosine Similarity
04:49
21-2 TFxIDF
06:56
21-3 Precision and Recall
02:32
21-4 Parallelization and Zipf Distributions
04:37
21-5 n-grams, q-grams and other tricks
07:10
21-6 PageRank
03:18
21-7 Notes from the Real World
05:26
21-8 Webcrawler Intro
03:36
21-9 Webcrawler Refinements
05:00
21-10 Conclusion
00:43
22-1 Introduction to Distributed Transactions
03:50
22-2 Distributed Locking
02:27
22-3 Distributed Deadlock Detection
01:34
22-4 Intro to Distributed Commit
02:58
22-5 Simple 2PC Messaging Only
03:45
22-6 Full 2PC Including Logging (Presumed Abort)
03:00
22-7 The Recovery Processes
03:39
22-8 2PC, Locking and Availability
05:39
22-9 Summary of Distributed Transactions
01:40
客服
顶部
赛事库 课堂 2021拜年纪