R-trees performances

• Many variations : SS-trees[MD4], TV-trees[MD2], Xtrees[MD3], K-D-B_trees[MD6],….

• Size: O(N) Nodes

• Search performance sensitive to overlap

  • overlap increases with dimensionality

• Insertion and deletion are costly

  • computing MBR
  • split algorithms

Diapositive précédente

Diapositive suivante

Revenir à la première diapositive

Afficher la version graphique