Both A and B

The hash bucket is frequent

Either A or B

Both items are frequent

Hashing

Sorting

Sampling and partitioning

 Indexing only

 Data loss

Data compression

 Data redundancy

Data swamp

Unique departments

Total salary

Average salary per department

Sorted salaries

map()

apply()

vectorized operations

for loop

Estimating similarity between sets

Sorting elements

Data compression

Counting frequency

Mapper phase

Reducer phase

Input split phase

Shuffle phase

They sort data efficiently

They store entire datasets

They require disk storage

They process infinite streams with limited memory

Fully clustered points

 Centroids

Outliers not assigned to any cluster

 Compressed clusters

Tree-based indexing

Exact storage of elements

Use of multiple hash functions with bit arrays

Disk-based storage