Module 5: Disk-based Index Structures
  Lecture 22: SS-trees,SR-trees,P-trees
 

                                           

 

 

Performance
  • Storage cost is higher
 
  • 3 times that of SS-tree, 1.5 times that of R*-tree
  • Fanout is lower
  • Height is larger
  • Number of internal node accesses is more
  • Number of leaf node accesses is less
 
  • Better pruning of index nodes
  • Together, faster search than SS-trees and R*-trees
  • Construction time is larger