B-trees are a commonly used data structure to associate symbols with related information, as in a symbol table or file index. The performance of B-tree algorithms is well understood for sequential processing and even concurrent processing on small-scale
