B+-tree (3)

• Search(K)

  • recursively find node pointed by Pi , from entry(Pi , Ki)
  • with greater i such as Ki ? K

• Insert (K)

  • search(K); insert new entry in leaf
  • if leaf overflow then split, may cascade up to the root

• Delete (K)

  • search(K); delete entry or display error msg
  • if leaf underflow then redistribute or merge with sibling, may cascade up to the root

Diapositive précédente

Diapositive suivante

Revenir à la première diapositive

Afficher la version graphique