Choosing optimal branching factors for k-d-B trees

摘要

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.