Week 09 Lecture
Assignment 2
Assignment 2
Ex1: Queries with MA.Hashing
Tree Indexes for N-d Selection
Multi-dimensional Tree Indexes
Ex2: Query Types and Tuple Space
kd-Trees
Searching in kd-Trees
Ex3: Searching in kd-Trees
Quad Trees
Searching in Quad-tree
Ex4: Searching in Quad-trees
R-Trees
Insertion into R-tree
Query with R-trees
Ex5: Query with R-trees
Multi-d Trees in PostgreSQL
Costs of Search in Multi-d Trees
Implementing Join
Join
Join Example
Nested Loop Join
Nested Loop Join
Block Nested Loop Join
Ex6: Nested Loop Join Cost
Ex7: Nested Loop Join Cost (ii)
Ex8: Nested Loop Join Cost
(cont)
Block Nested Loop Join in Practice
Index Nested Loop Join
Sort-Merge Join
Sort-Merge Join
Sort-Merge Join on Example
Ex9: Sort-merge Join Cost
Produced: 4 May 2016
![[index]](icon/up.gif){kind=icon}