B-trees were invented by Rudolf Bayer and Edward McCreight at the Boeing Research Labs. Their paper – “Organization and Maintenance or Large Order Indices,” containing details of these structures, was circulated in 1970. It was used to manage the index pages, especially for large random-access files. The basic assumptions regarding the b-tree in data structure were that the indexes were voluminous and that only a tiny chunk of the tree fits in the main memory. Importance of choosing b-tree in data structure This is a tree data structure that keeps…
Read MoreDefining B Tree in Data Structure and its properties
