Applications of Data Structure in DBMS
Applications of Data Structure in DBMS
⮚ Trees
Trees, such as B-trees and AVL trees, are pivotal in
database indexing. They allow for hierarchical data
representation and efficient search operations, minimizing
the time required to locate records.
⮚ Hash Tables
Hash tables provide a mechanism for fast data retrieval
through key-value mapping. In DBMS, they are often used
for indexing and quick look-up operations, essential for
query performance.
References
✧ Silberschatz, A., Korth, H. F., & Sudarshan, S. (2010).
Database System Concepts (6th ed.). McGraw-Hill
Education.
✧ Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C.
(2009). Introduction to Algorithms (3rd ed.). MIT Press.
✧ Knuth, D. E. (1998). The Art of Computer Programming,
Volume 3: Sorting and Searching (2nd ed.). Addison-
Wesley.
✧ Elmasri, R., & Navathe, S. B. (2010). Fundamentals of
Database Systems (6th ed.). Addison-Wesley.
✧ MySQL Documentation. (n.d.). The InnoDB Storage
Engine. Retrieved from
https://dev.mysql.com/doc/refman/8.0/en/innodb-storage-
engine.html
✧ Bayer, R., & McCreight, E. M. (1972). Organization and
Maintenance of Large Ordered Indexes. Acta Informatica,
1, 173–189.