A special application of the concept of indexes, or inverted lists, is a B-tree, which is a multilevel index
that allows both sequential and direct processing of data records. It also ensures a certain level of efficiency
in processing because of the way that the indexes are structured.