The book states that it’s common to have a branching factor of several hundred, some even say low thousands!.The branching factor is tied to the space needed to store the page references and the range boundaries.The branching factor is the number of references to child pages in one page of a B-tree.These pages are called leaf pages, where the values live along with the key.This continues until you reach the page that has the data for the key you searched for.The child pages might contain more references to other child pages based off of more narrowly focused key ranges.This root will contain references to child pages based off of key ranges.Knowing (or being able to quickly find) which page the data you are looking for is in, drastically cuts down on the amount of data you have to scan through.These are pointers to positions on a disk. Every page has an address that can be referenced from other pages.B-trees use fixed block sizes, referred to as pages, that are usually 4 KB in size which (generally) map well to the underlying hardware because disks are typically arranged in fixed block sizes.Like the SSTable, the B-tree stores key/value pairs sorted by key.“Indexing” is the way databases store metadata about your data to make quick look ups.
0 Comments
Leave a Reply. |