Choosing optimal branching factors for k-d-B trees (Q1058876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Choosing optimal branching factors for k-d-B trees |
scientific article; zbMATH DE number 3902089 |
Statements
Choosing optimal branching factors for k-d-B trees (English)
0 references
1985
0 references
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.
0 references
multidimensional storage structure for a dynamic database
0 references
partial match queries
0 references
0.8004763722419739
0 references
0.7851953506469727
0 references
0.7667881846427917
0 references
0.7664941549301147
0 references
