About: B+ tree   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : dbkwik.org associated with source dataset(s)

A B+ tree is a data structure. It is essentially a B-tree, but the values only occur in the lowest-level leaf nodes. It allows searching, addition and removal of elements, and, optionally by linking each leaf node to another to allow easy traversal, as in a linked list, enumeration of its elements.

AttributesValues
rdfs:label
  • B+ tree
rdfs:comment
  • A B+ tree is a data structure. It is essentially a B-tree, but the values only occur in the lowest-level leaf nodes. It allows searching, addition and removal of elements, and, optionally by linking each leaf node to another to allow easy traversal, as in a linked list, enumeration of its elements.
sameAs
dcterms:subject
abstract
  • A B+ tree is a data structure. It is essentially a B-tree, but the values only occur in the lowest-level leaf nodes. It allows searching, addition and removal of elements, and, optionally by linking each leaf node to another to allow easy traversal, as in a linked list, enumeration of its elements.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software