See B+ tree on Wiktionary
Download JSON data for B+ tree meaning in All languages combined (1.6kB)
{
"forms": [
{
"form": "B+ trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"head": "B+ tree"
},
"expansion": "B+ tree (plural B+ trees)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves."
],
"id": "en-B+_tree-en-noun-pqmCv67T",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"-ary",
"-ary"
],
[
"tree",
"tree"
],
[
"data structure",
"data structure"
],
[
"child",
"child"
],
[
"node",
"node"
],
[
"B-tree",
"B-tree"
]
],
"raw_glosses": [
"(computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves."
],
"related": [
{
"word": "B-tree"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "B+ tree"
}
{
"forms": [
{
"form": "B+ trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"head": "B+ tree"
},
"expansion": "B+ tree (plural B+ trees)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "B-tree"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms spelled with +",
"en:Theory of computing"
],
"glosses": [
"An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"-ary",
"-ary"
],
[
"tree",
"tree"
],
[
"data structure",
"data structure"
],
[
"child",
"child"
],
[
"node",
"node"
],
[
"B-tree",
"B-tree"
]
],
"raw_glosses": [
"(computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "B+ tree"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-09 from the enwiktionary dump dated 2024-05-02 using wiktextract (4d5d0bb and edd475d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.