Abstract
A k-d-B tree is an efficient multidimensional storage structure for a dynamic database. This study attempts to find optimal branching factors for a k-d-B tree subject to partial match queries which specify the same number of attributes. The suggested method is supported by experimental results.
Sign-in/Register to access full text options 
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.
