Choosing optimal branching factors for k-d-B trees

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 1985.

Cite

CITATION STYLE

APA

Sharma, K. D., & Rani, R. (1985). Choosing optimal branching factors for k-d-B trees. Information Systems, 10(1), 127–134. https://doi.org/10.1016/0306-4379(85)90014-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free