Triple
T8151863
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RocksDB |
E190351
|
entity |
| Predicate | usesArchitecture |
P24956
|
FINISHED |
| Object |
Log-Structured Merge-Tree
A Log-Structured Merge-Tree (LSM-tree) is a write-optimized data structure that organizes data in sequential logs and periodically merges them to provide efficient writes and good read performance for key-value storage systems.
|
E717514
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Log-Structured Merge-Tree | Statement: [RocksDB, usesArchitecture, Log-Structured Merge-Tree]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Log-Structured Merge-Tree Context triple: [RocksDB, usesArchitecture, Log-Structured Merge-Tree]
-
A.
LSM
LSM is an undergraduate dual-degree program at the University of Pennsylvania that integrates rigorous training in life sciences with business and management education.
-
B.
Raft consensus algorithm
Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
-
C.
B-tree
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.
-
D.
RocksDB
RocksDB is a high-performance, embeddable key–value store developed by Facebook, optimized for fast storage on flash and solid-state drives using a Log-Structured Merge-Tree (LSM) architecture.
-
E.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Log-Structured Merge-Tree Triple: [RocksDB, usesArchitecture, Log-Structured Merge-Tree]
Generated description
A Log-Structured Merge-Tree (LSM-tree) is a write-optimized data structure that organizes data in sequential logs and periodically merges them to provide efficient writes and good read performance for key-value storage systems.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Log-Structured Merge-Tree Target entity description: A Log-Structured Merge-Tree (LSM-tree) is a write-optimized data structure that organizes data in sequential logs and periodically merges them to provide efficient writes and good read performance for key-value storage systems.
-
A.
LSM
LSM is an undergraduate dual-degree program at the University of Pennsylvania that integrates rigorous training in life sciences with business and management education.
-
B.
Raft consensus algorithm
Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
-
C.
B-tree
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.
-
D.
RocksDB
RocksDB is a high-performance, embeddable key–value store developed by Facebook, optimized for fast storage on flash and solid-state drives using a Log-Structured Merge-Tree (LSM) architecture.
-
E.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ca82be7ba8819087de0147e9292c83 |
completed | March 30, 2026, 2:03 p.m. |
| NER | Named-entity recognition | batch_69cb4483799c81908e73f9a87ed99185 |
completed | March 31, 2026, 3:50 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ccbef9f28881909961b599d395d6df |
completed | April 1, 2026, 6:45 a.m. |
| NEDg | Description generation | batch_69ccc310b514819099228a1cc66517c5 |
completed | April 1, 2026, 7:02 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ccd8041c00819094094701ace21aa0 |
completed | April 1, 2026, 8:32 a.m. |
Created at: March 30, 2026, 5:37 p.m.