| 摘要 |
A computer-implemented B-tree structure for information processing. The B-tree structure is used with any storage mechanism that can hold a plurality of data records. The B-tree includes interconnected nodes having a root node, index nodes and leaf nodes. The B-tree structure allows for the data records to be associated with duplicate keys that are stored separate from the leaf nodes.
|
