US 12,111,808 B2
System and method for generating multi-category searchable ternary tree data structure
Jonathon William Bowyer, Kansas City, MO (US)
Assigned to Cerner Innovation, Inc., Kansas City, MO (US)
Filed by Cerner Innovation, Inc., Kansas City, MO (US)
Filed on Jul. 21, 2023, as Appl. No. 18/357,039.
Application 18/357,039 is a continuation of application No. 17/647,039, filed on Jan. 5, 2022, granted, now 11,748,325.
Application 17/647,039 is a continuation of application No. 16/717,454, filed on Dec. 17, 2019, granted, now 11,269,836, issued on Mar. 8, 2022.
Prior Publication US 2023/0359603 A1, Nov. 9, 2023
Int. Cl. G06F 16/22 (2019.01); G06F 16/245 (2019.01)
CPC G06F 16/2246 (2019.01) [G06F 16/2264 (2019.01); G06F 16/245 (2019.01)] 20 Claims
OG exemplary drawing
 
15. 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.