B-tree
E97112
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
All labels observed (4)
| Label | Occurrences |
|---|---|
| "Organization and Maintenance of Large Ordered Indexes" | 1 |
| B# tree | 1 |
| B+ tree | 1 |
| B-tree canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T816970 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: B-tree Context triple: [PostgreSQL, supportsIndexType, B-tree]
-
A.
BST
BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
-
B.
Jepsen
Jepsen is a surname most notably associated with individuals such as display technology innovator Mary Lou Jepsen.
-
C.
INGRES relational database system
INGRES relational database system is an influential early relational DBMS developed at the University of California, Berkeley, that pioneered many concepts and technologies later adopted by commercial database systems.
-
D.
DBE
DBE is the title "Dame Commander of the Order of the British Empire," a high-ranking honor awarded in the British honours system.
-
E.
Btrfs
Btrfs is a modern copy-on-write Linux file system designed for advanced features like snapshots, checksumming, and efficient storage management.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: B-tree Target entity description: A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
A.
BST
BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
-
B.
Jepsen
Jepsen is a surname most notably associated with individuals such as display technology innovator Mary Lou Jepsen.
-
C.
INGRES relational database system
INGRES relational database system is an influential early relational DBMS developed at the University of California, Berkeley, that pioneered many concepts and technologies later adopted by commercial database systems.
-
D.
DBE
DBE is the title "Dame Commander of the Order of the British Empire," a high-ranking honor awarded in the British honours system.
-
E.
Btrfs
Btrfs is a modern copy-on-write Linux file system designed for advanced features like snapshots, checksumming, and efficient storage management.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
data structure
ⓘ
self-balancing search tree ⓘ tree data structure ⓘ |
| advantage |
good cache performance
ⓘ
reduces disk I/O operations ⓘ |
| comparedTo |
splay tree
ⓘ
surface form:
binary search tree
|
| constraint |
all leaves appear on the same level
ⓘ
each node (except root) has a minimum number of keys ⓘ each node has a maximum number of keys ⓘ keys in a node separate key ranges of children ⓘ root has at least two children unless it is a leaf ⓘ |
| describedIn |
B-tree
self-linksurface differs
ⓘ
surface form:
"Organization and Maintenance of Large Ordered Indexes"
|
| differenceFromBinarySearchTree |
designed for external memory
ⓘ
nodes can have more than two children ⓘ |
| field | computer science ⓘ |
| generalizationOf | binary search tree ⓘ |
| hasVariant |
B-tree
self-linksurface differs
ⓘ
surface form:
B# tree
B* tree ⓘ B-tree self-linksurface differs ⓘ
surface form:
B+ tree
|
| introducedBy |
Edward M. McCreight
ⓘ
Rudolf Bayer ⓘ |
| introducedIn | 1972 ⓘ |
| nodeContains |
multiple keys
ⓘ
pointers to child nodes ⓘ |
| optimizedFor |
block-oriented storage
ⓘ
disk access efficiency ⓘ |
| property |
all leaves at same depth
ⓘ
balanced height ⓘ height grows logarithmically with number of keys ⓘ keys stored in sorted order ⓘ multi-way branching ⓘ nodes can have many children ⓘ |
| supportsOperation |
delete
ⓘ
insert ⓘ range queries ⓘ search ⓘ sequential traversal ⓘ |
| timeComplexityDeletion | O(log n) ⓘ |
| timeComplexityInsertion | O(log n) ⓘ |
| timeComplexitySearch | O(log n) ⓘ |
| typicalApplication |
file systems
ⓘ
key-value stores ⓘ relational database systems ⓘ |
| usedFor |
database indexing
ⓘ
efficient deletion ⓘ efficient insertion ⓘ efficient search ⓘ file system indexing ⓘ storing sorted data ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: B-tree Description of subject: A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
B+ tree
this entity surface form:
B# tree
this entity surface form:
"Organization and Maintenance of Large Ordered Indexes"