About: K-D-B-tree

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide the search efficiency of a balanced k-d tree, while providing the block-oriented storage of a B-tree for optimizing external memory accesses.

Property	Value
dbo:abstract	In computer science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide the search efficiency of a balanced k-d tree, while providing the block-oriented storage of a B-tree for optimizing external memory accesses. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/KBDtreeStructure.png?width=300
dbo:wikiPageID	42442225 (xsd:integer)
dbo:wikiPageLength	10537 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1124587404 (xsd:integer)
dbo:wikiPageWikiLink	dbc:Computer_graphics_data_structures dbr:Computer_science dbr:B-tree dbc:Geometric_data_structures dbr:K-d_tree dbc:Data_types dbc:Trees_(data_structures) dbc:Database_index_techniques dbr:HB-tree dbr:File:KBDtreeStructure.png dbr:File:KDBTreeSplits.png
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:Orphan dbt:Reflist dbt:Data_structures
dcterms:subject	dbc:Computer_graphics_data_structures dbc:Geometric_data_structures dbc:Data_types dbc:Trees_(data_structures) dbc:Database_index_techniques
gold:hypernym	dbr:Structure
rdf:type	yago:WikicatComputerGraphicsDataStructures yago:Ability105616246 yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:Know-how105616786 yago:Method105660268 yago:PsychologicalFeature100023100 yago:WikicatGeometricDataStructures dbo:Building yago:Structure105726345 yago:Technique105665146 yago:WikicatDatabaseIndexTechniques
rdfs:comment	In computer science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide the search efficiency of a balanced k-d tree, while providing the block-oriented storage of a B-tree for optimizing external memory accesses. (en)
rdfs:label	K-D-B-tree (en)
owl:sameAs	freebase:K-D-B-tree yago-res:K-D-B-tree wikidata:K-D-B-tree dbpedia-sr:K-D-B-tree https://global.dbpedia.org/id/fUBH
prov:wasDerivedFrom	wikipedia-en:K-D-B-tree?oldid=1124587404&ns=0
foaf:depiction	wiki-commons:Special:FilePath/KBDtreeStructure.png wiki-commons:Special:FilePath/KDBTreeSplits.png
foaf:isPrimaryTopicOf	wikipedia-en:K-D-B-tree
is dbo:wikiPageRedirects of	dbr:BKD_tree
is dbo:wikiPageWikiLink of	dbr:BKD_tree dbr:K-d_tree dbr:List_of_terms_relating_to_algorithms_and_data_structures
is foaf:primaryTopic of	wikipedia-en:K-D-B-tree