Triple

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).

Phrase: B+ tree | Statement: [B-tree, hasVariant, B+ tree]

Target entity: B+ tree
Context triple: [B-tree, hasVariant, B+ tree]

• A. 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.
• B. 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.
• C. splay tree
  A splay tree is a self-adjusting binary search tree data structure that moves frequently accessed elements closer to the root to optimize average access time.
• 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. GiST
  GiST (Generalized Search Tree) is a flexible indexing framework in PostgreSQL that allows the implementation of a wide variety of custom index types for complex data and queries.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

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]"

Entity: B+ tree
Triple: [B-tree, hasVariant, B+ tree]

A B+ tree is a balanced search tree data structure in which all actual data records are stored in the leaf nodes and internal nodes contain only keys to efficiently support range queries and disk-based indexing.

Target entity: B+ tree
Target entity description: A B+ tree is a balanced search tree data structure in which all actual data records are stored in the leaf nodes and internal nodes contain only keys to efficiently support range queries and disk-based indexing.

• A. B-tree chosen
  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.
• B. 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.
• C. splay tree
  A splay tree is a self-adjusting binary search tree data structure that moves frequently accessed elements closer to the root to optimize average access time.
• 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. GiST
  GiST (Generalized Search Tree) is a flexible indexing framework in PostgreSQL that allows the implementation of a wide variety of custom index types for complex data and queries.
• F. None of above.