Module 4: Index Structures
  Lecture 16: Voronoi Diagrams and Tries
 

                                           

 

 

Classification of index structures
  • Space-partitioning
 
  • Fanout independent of dimensionality
 
  • Problem of dead space indexing
 
  • No guarantee on space usage
 
  • K-d-B-tree, K-d-tree, Quadtree, Grid le
  • Data-partitioning
 
  • Fanout decreases with dimensionality
 
  • Eliminates dead space
 
  • Guarantee on space usage
 
  • R-tree, R*-tree, X-tree
  • Point access methods (PAM)
 
  • Only points are indexed
  • Spatial access methods (SAM)
 
  • Spatial objects can be indexed