Choosing optimal branching factors for k-d-B trees

DOI10.1016/0306-4379(85)90014-6zbMath0565.68096OpenAlexW2070654735MaRDI QIDQ1058876

Rekha Rani, K. D. Sharma

Publication date: 1985

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(85)90014-6

zbMATH Keywords

multidimensional storage structure for a dynamic databasepartial match queries

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

This page was built for publication: Choosing optimal branching factors for k-d-B trees