For example, AVL trees are not suitable for representing huge tables residing in secondary memory. Many algorithms and data structures that are efficient for manipulating data in primary memory are not efficient for manipulating large data in secondary memory because they do not minimize the number of disk accesses. Thus, When data is too large to fit in main memory the number of disk accesses becomes important. Each block has a fixed number of bytes – typically 512, 1024, 2048, 4096 or 8192 bytes Each block may hold many data records.ģ Motivation for studying Multi-way and B-treesĪ disk access is very expensive compared to a typical computer instruction (mechanical limitations) - One disk access is worth about 200,000 instructions. A block is the smallest amount of data that can be accessed on a disk. What is a B-tree? Why B-trees? Insertion in a B-tree Deletion in a B-tree B+ TreesĢ Disk Storage Data is stored on disk (i.e., secondary memory) in blocks. 1 B-Trees and B+-Trees Disk Storage What is a multiway tree?
0 Comments
Leave a Reply. |