Data Partitioning
Round-robin
Pro: Sequential scanning
Con: Associative access
Hashing
Pro: Associative, Sequential access
Con: Randomize Data
Range
Pro: Clusters data
Con: Data skew
Previous slide
Next slide
Back to first slide
View graphic version