FB+-tree: Indexing based on key ranges

The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B⁺-tree and designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed depth-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this technology for easy adaption and high efficiency. This indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.