About us
Services
Products
Work
Contact
Feedback
In Focus
Flash XML slideshow
Database training
2.3.05. B-tree
Paritioning structure
Each node contains keys & pointers
Pointers can be:
Node pointers - to child nodes
Data pointers - to records in heap
Number of keys = Number of pointers - 1
Every node in the tree is identical
‹ 2.3.04. Index zipping
up
2.3.06. B+ trees ›
s5 slideshow