Week 06 Lectures
Implementing Relational Operators
Reminder on Cost Analyses
Indexing
Indexing
Indexes
Dense Primary Index
Sparse Primary Index
Ex1: Index Storage Overheads
Selection with Primary Index
Insertion with Primary Index
Deletion with Primary Index
Clustering Index
Secondary Index
Multi-level Indexes
Select with Multi-level Index
B-Trees
B-Tree Depth
Insertion into B-Trees
Example: B-tree Insertion
B-Tree Insertion Cost
Selection with B-Trees
B-trees in PostgreSQL
N-dimensional Selection
N-dimensional Queries
Tuple Space
Operations for Nd Select
N-d Selection via Heaps
N-d Selection via Multiple Indexes
N-d Queries and Indexes
Ex2: One vs Multiple Indices
Bitmap Indexes
Ex3: Bitmap Index
Hashing for N-d Selection
Hashing and
pmr
MA.Hashing Example
MA.Hashing Hash Functions
Ex4: Multi-attribute Hashing
Queries with MA.Hashing
Ex5: Partial hash values in MAH
MA.Hashing Query Algorithm
Ex6: Representing Stars
Ex7: MA.Hashing Query Cost
Query Cost for MA.Hashing
Optimising MA.Hashing Cost
Ex8: MA.Hashing Design
Produced: 24 Mar 2020
![[index]](icon/up.gif){kind=icon}