Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries

A file structure, called k-dimensional B-tree of order d, d ≥ 1, is presented which allows each of the operations k-dimensional exact match query (“k-dimensional search”), insertion and deletion to be performed in time 0(log(d+1)N+k) in the worst case, where N is the number of k-dimensional records in the file.