The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching
Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Advances in the Design of the BANG File
FOFO '89 Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
On the Complexity of BV-tree Updates
CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
In external multi-dimensional access methods, Forced Splittingis an approach used to ensure that, when a page splits, no sub-tree of the page belongs under both halves, thereby guaranteeing that only one path from the root need be searched to find any point in the tree. This reduces occupancy of forcibly split pages, possibly down to single entries in pathological cases. Freeston introduced a novel approach to obtaining the benefits of forced splitting while avoiding the negative consequences for a class of access methods he called BV-Trees. Perhaps because of its rather abstract presentation and the lack of complete algorithm descriptions, we believe that this idea has not achieved the recognition it deserves. We present a different view of the BV-Tree concept in terms of what we call Virtual Forced Splitting (VFS), show how the semantics of a VFS tree can be understood by its relationship to a much simpler Forced Split tree obtained by reduction from the VFS tree. This allows an explanation of the complex issue of demotion; a requirement for correct implementation that is acknowledged but not discussed in the literature before now. We show how various multi-dimensional algorithms such as k-Nearest Neighbour and Range Search can be effectively implemented on such trees, and, finally, discuss our own implementation of a BV-Tree, and report performance results in comparison to the R*-Tree.