by admin | Jun 6, 2015 | sem3
B+ tree Index Files A B+ tree is a balanced binary search tree that follows a multi-level index format. The leaf nodes of a B+ tree denote actual data pointers. B+ tree ensures that all leaf nodes remain at the same height, thus balanced. Additionally, the leaf nodes...
by admin | Jun 6, 2015 | sem3
Hashing For a huge database structure, it can be almost next to impossible to search all the index values through all its level and then reach the destination data block to retrieve the desired data. Hashing is an effective technique to calculate the direct location...
by admin | Jun 6, 2015 | sem3
indexing We know that data is stored in the form of records. Every record has a key field, which helps it to be recognized uniquely. Indexing is a data structure technique to efficiently retrieve records from the database files based on some attributes on which the...
by admin | Jun 6, 2015 | sem3
File Organization File Organization defines how file records are mapped onto disk blocks. We have four types of File Organization to organize file records − Heap File Organization When a file is created using Heap File Organization, the Operating System allocates...
by admin | Jun 6, 2015 | sem3
RAID in dbms Redundant Array of Independent Disks RAID or Redundant Array of Independent Disks, is a technology to connect multiple secondary storage devices and use them as a single storage media. RAID consists of an array of disks in which multiple disks are...
by admin | Jun 6, 2015 | sem3
Overview of Physical Storage Media Databases are stored in file formats, which contain records. At physical level, the actual data is stored in electromagnetic format on some device. These storage devices can be broadly categorized into three types − Primary Storage −...
