Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
