[개념정리] DB: Indexing과 Hashing
•
0 likes•3,654 views
The document discusses different types of indexing and hashing techniques used in databases. It covers ordered indices like B-trees and B+ trees, which store search keys in order. It also covers hashing techniques like static hashing and dynamic hashing using extendable hash structures. The document provides examples of how these indexing structures work and compares the performance and characteristics of ordered indexing versus hashing. Bitmap indices are also introduced as an efficient technique for multi-attribute queries.
[개념정리] DB: Indexing과 Hashing
- 37. 37
- 38. UseofExtendableHashStructure:Example(5/7)#1 compinsert시overflow 관련버킷재계산 111:computer 110:history 38
- 45. Multiple‑KeyAccess Usemultipleindicesforcertaintypesofqueries SELECT ID FROM instructor WHERE dept_name = “Finance” and salary = 80000 Possiblestrategiesusingindicesonsingleattributes: 1.Useindexondept_nametofindallinstructorsintheFinance department;testsalary=80000 2.Useindexonsalarytofindallinstructorswithsalaryof $80000;testdept_name=“Finance” 3.Usedept_nameindextofindpointerstoallrecordspertainingto theFinancedepartment.Similarlyuseindexonsalary.Take intersectionofbothsetsofpointersobtained 45