Overview of Generalized Search Trees

Internal Nodes

Leaf Nodes

BP1

BPn

BP2

...

…..

.

.

.

GiST AM Parameters

Union( ) updates BPs

Penalty( ) returns insertion cost

Bounding predicate (BP)=User defined key

Consistent( ) returns matches

PickSplit( ) splits page items into two groups

Previous slide

Next slide

Back to first slide

View graphic version