Relational Database Management Systems and Big data
A Relational Database Management System was first conceptualized by Edgar Codd in the late 1960s. The underlying data structure that Relational Databases use for interacting with the data is a B-Tree. Balanced (and not Binary) Trees is a mechanism to place and locate data records in a database.
B-Tree was used primarily because the algorithm behind B-Tree minimizes the total number of times a disk must be accessed to locate a desired record, thereby essentially speeding up the overall process of fetching the data. There are two concepts that you should know with respect to the underlying disk storing the data record:
- Seeking: A process where the head of the disk is moved to a particular place on the disk to either read or write the data. Latency of the disk operation is directly related to the seek time.
- Bandwidth: A disk bandwidth defines the rate of the transfer of data between the disk and the underlying SATA interface or any other interface...