US 11,748,325 B2
System and method for generating multicategory 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, KS (US)
Filed on Jan. 5, 2022, as Appl. No. 17/647,039.
Application 17/647,039 is a continuation of application No. 16/717,454, filed on Dec. 17, 2019, granted, now 11,269,836.
Prior Publication US 2022/0129431 A1, Apr. 28, 2022
This patent is subject to a terminal disclaimer.
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)] 22 Claims
OG exemplary drawing
 
1. A computerized method, comprising:
generating a plurality of nodes as a ternary tree data structure for characters of a plurality of terms specific to a first terminology;
generating another plurality of nodes in the ternary tree data structure for characters of another plurality of terms specific to a second terminology that is different from the first terminology;
determining that at least one of the plurality of nodes generated for the first terminology corresponds to at least one of the characters for the other plurality of terms specific to the second terminology; and
generating, for each of the at least one of the plurality of nodes in the ternary tree data structure, a nested array that includes a first array having a term match value for the first terminology and a second array having a term match value for the second terminology, wherein the first and second arrays are nested in the nested array, and wherein the nested array supports a computerized search of the first and second terminologies in the ternary tree data structure.