Choosing an optimal sequence of discriminators

摘要

Multidimensional data structures have proved to be efficient storage structures for multidimensional dynamic data bases. A judicious choice of a sequence of discriminators can greatly reduce search costs for partial match queries. This paper proposes a scheme for optimal choice of sequence of discriminators for the K-D-B tree which takes the query statistics into account. The scheme is later extended to take into account various system parameters like seek time, block size, disk transfer rates and page placement policy. The problem of choosing the sequence is formulated as a 0–1 integer programming problem, the solution to which gives the required sequence of discriminators.