More Related Content
Similar to 12. Indexing and Hashing in DBMS
Similar to 12. Indexing and Hashing in DBMS (20)
More from koolkampus (20)
12. Indexing and Hashing in DBMS
- 20. Example of a B + -tree B + -tree for account file ( n = 3)
- 27. Updates on B + -Trees: Insertion (Cont.) B + -Tree before and after insertion of “Clearview”
- 40. Example of Hash File Organization Hash file organization of account file, using branch-name as key (see previous slide for details).
- 48. General Extendable Hash Structure In this structure, i 2 = i 3 = i , whereas i 1 = i – 1 (see next slide for details)
- 52. Use of Extendable Hash Structure: Example Initial Hash structure, bucket size = 2