Organizing prime data elements using a tree data structure
AssigneeAscava, Inc.
InventorHarshvardhan Sharangpani
Life of this patent
Estimating the term…
Abstract
A first node in a tree data structure may be reached by traversing a sequence of links based on a name, where the sequence of links may correspond to a first portion of the name, and where the tree data structure may organize prime data elements. A regular expression may be retrieved which is associated with a first link and which emanates from the first node. A second portion of the name may be matched with the regular expression, where the second portion is subsequent to the first portion in the name. In response to the second portion of the name matching the regular expression, the first link may be traversed to reach a second node.
Claims20
A method for navigating a tree data structure based on a name, the method comprising:
- reaching a first node in the tree data structure by traversing a sequence of links based on the name, wherein the sequence of links corresponds to a first portion of the name;
- retrieving a regular expression associated with a first link which emanates from the first node;
- matching, by a processor, a second portion of the name with the regular expression, wherein the second portion is subsequent to the first portion in the name;
- and
- in response to the second portion of the name matching the regular expression, traversing the first link to reach a second node.
A non-transitory computer-readable storage medium comprising stored instructions, which when executed by a processor, cause the processor to:
- reach a first node in a tree data structure by traversing a sequence of links based on a name, wherein the sequence of links corresponds to a first portion of the name;
- retrieve a regular expression associated with a first link which emanates from the first node;
- match a second portion of the name with the regular expression, wherein the second portion is subsequent to the first portion in the name;
- and
- in response to the second portion of the name matching the regular expression, traverse the first link to reach a second node.
A system, comprising:
- a memory storing instructions;
- and
- a processor coupled with the memory and to execute the instructions, wherein the instructions, when executed by the processor, cause the processor to:
- reach a first node in a tree data structure by traversing a sequence of links based on a name, wherein the sequence of links corresponds to a first portion of the name, and wherein the tree data structure organizes prime data elements;
- retrieve a regular expression associated with a first link which emanates from the first node;
- match a second portion of the name with the regular expression, wherein the second portion is subsequent to the first portion in the name;
- and
- in response to the second portion of the name matching the regular expression, traverse the first link to reach a second node.
Dependencies are inferred from the claim text.