Module 5: Disk-based Index Structures
Lecture 27: M-trees
Structure
Each internal node entry contains
Routing object
Covering tree
:
subtree of
Covering radius
:
all objects in
is within distance
from
Distance of
to its parent
:
Leaf nodes
Covering radius
point to actual data object