Choosing optimal branching factors for k-d-B trees

  • Sharma K
  • Rani R
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • K. D. Sharma

  • Rekha Rani

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free