Algorithms for BD trees

DOI10.1002/SPE.4380161203MaRDI QIDQ3771667zbMATH OpenOpenAlexFDO

Authors Sivarama P. Dandamudi, Paul G. Sorenson

Publication date 1986

Published in Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/spe.4380161203

zbMATH Keywords

Databaserange queriesmultidimensional datafile structurespartial match querystorage structuresBD treemultikey searching

Mathematics Subject Classification ID

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

Recommendations

• Choosing optimal branching factors for k-d-B trees
• scientific article; zbMATH DE number 19204
• scientific article; zbMATH DE number 3887061
• Multidimensional balanced binary trees
• scientific article; zbMATH DE number 3845065

Cites work

• Multidimensional binary search trees used for associative searching

Cited in

(2)

• MISTRAL: Processing relational queries using a multidimensional acces technique (Diss., TU München)
• Choosing optimal branching factors for k-d-B trees

This page was built for publication: Algorithms for BD trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771667)