(Contents)(Previous)(Next)

B* Trees

Which storage procedure does the database system use?

B* trees are used as the storage procedure. The data records or index lists are kept in the leave pages; the key information in the index pages. The size of a page is 4 KB. For sequential access, these data pages are chained with the next page; for direct access, they are chained by using a multiple index.


(Contents)(Previous)(Next)