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.
[1] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[2] Kurt Mehlhorn. Dynamic Binary Search , 1979, SIAM J. Comput..
[3] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.