System and method for generating multi-category searchable ternary tree data structure
AssigneeCerner Innovation, Inc.
InventorJonathon William Bowyer
Life of this patent
Estimating the term…
Abstract
Systems, methods, and computer-readable media are disclosed herein that generate a ternary tree data structure that includes multiple categories (e.g., terminologies) using dynamic array modifications that facilitate sharing of one or more nodes across categories. A plurality of different categories may be added and stored within a single ternary tree data structure such that each categories may be separately queried using the single ternary data structure.
Claims20
One or more non-transitory media having instructions which, when executed by one or more processors, cause the one or more processors to facilitate a plurality of operations, the operations comprising:
- performing a string query in a ternary tree, the ternary tree having a plurality of nodes that represent at least a first terminology and a second terminology;
- determining that the string query is designated for the first terminology;
- in response to the determining, traversing the plurality of nodes in the ternary tree;
- locating a first search result corresponding to the string query, the first search result corresponding to a node of the plurality of nodes, the node having a corresponding array, the corresponding array storing a first term match number for the first terminology in a first nested array and storing a second term match number for the second terminology in a second nested array;
- and
- returning the first term match number for the first terminology.
A system comprising one or more processors communicatively coupled to a data store and configured to facilitate a plurality of operations, the operations comprising:
- performing a string query in a ternary tree, the ternary tree having a plurality of nodes that represent at least a first terminology and a second terminology;
- determining that the string query is designated for the first terminology;
- in response to the determining, traversing the plurality of nodes in the ternary tree;
- locating a first search result corresponding to the string query, the first search result corresponding to a node of the plurality of nodes, the node having a corresponding array, the corresponding array storing a first term match number for the first terminology in a first nested array and storing a second term match number for the second terminology in a second nested array;
- and
- returning the first term match number for the first terminology.
A method, comprising:
- performing a string query in a ternary tree, the ternary tree having a plurality of nodes that represent at least a first terminology and a second terminology;
- determining that the string query is designated for the first terminology;
- in response to the determining, traversing the plurality of nodes in the ternary tree;
- locating a first search result corresponding to the string query, the first search result corresponding to a node of the plurality of nodes, the node having a corresponding array, the corresponding array storing a first term match number for the first terminology in a first nested array and storing a second term match number for the second terminology in a second nested array;
- and
- returning the first term match number for the first terminology.
Dependencies are inferred from the claim text.