Database Management Systems ( Rdbms ) Essay

1033 Words Nov 27th, 2016 5 Pages
Preference of B+ Tree over other structures
Sarthak Anand(A20389087), sanand13@hawk.iit.edu
Abstract—The purpose of this paper is the discuss the working of a B+ Tree and understand why it is preferred over other types of structures in database systems.

Keywords—B+ Tree, B Tree , indexing.

I. INTRODUCTION
A database management system (DBMS) is a combination of programs that gives the ability for you to store, extract and modify information from a database. There exist many different types of database management systems, ranging from small systems that run on personal devices to large systems that run on mainframes.

Relational Database Management Systems (RDBMS) are the most popular database management systems used today. SQL (Sequential Query Language) is generally used to implement RDBMS. In RDMS, data is stored in tables and therefore the data is stored in rows and columns. RDBMS forms the base for all commercially used database management systems like Oracle, IBM DB2, MySQL etc.
II. Indexing
Data in a database are stored in ordered manner regardless of the structured being used. The data is stored in an ordered manner by using a primary key and unique identified value. This is known as indexing.
III. types data structures
Various types of data structures are used in a RDBMS. For example: Sequential Indexing, B Tree and B+ Tree.
A. Sequential
In this type of data structure, the records are ordered in a sequential manner. An index file keeps a track of the records by…
Open Document