Practical spatial database access methods

Although many solutions to the problem of representing spatial data have been proposed, most are not practical. They cannot be guaranteed to perform well with large and arbitrarily distributed data collections. They may not be easily integrated with concurrency and recovery software already written for database systems. However, two proposed structures do have some guarantees, similar to those which have made the B/sup +/-tree so successful for one-dimensional data. These analytic guarantees include worst case space utilization in data and index pages, a minimal fan-out and exact match search time bounded by the height of the tree. The two methods are the holey brick tree and bit interleaving using a B/sup +/-tree. Both can also be integrated with concurrency and recovery systems in the same way that B/sup +/-trees are.<
>