Searching a Data Structure
First Claim
Patent Images
1. A computer comprising:
- an access module configured to access a data structure, wherein the data structure is formed of at least one sequence of nodes having a plurality of elementary links, each elementary link being a directional edge from a respective node in the sequence to the next adjacent node in the sequence; and
a distance computation module configured to compute, based one or more predicates, a distance along each elementary link for each of the one or more predicates, and store it in the data structure in association with that elementary link, wherein the distance along that elementary link is computed for that predicate by applying that predicate to the node to which that elementary link is directed, and is zero-valued unless that node satisfies that predicate.
1 Assignment
0 Petitions
Accused Products
Abstract
A data structure is formed of at least one sequence of nodes having a plurality of elementary links, each elementary link being a directional edge from a respective node in the sequence to the next adjacent node in the sequence. Based one or more predicates, a distance along each elementary link for each of the one or more predicates is computed, and stored in the data structure in association with that elementary link. The distance along that elementary link is computed for that predicate by applying that predicate to the node to which that elementary link is directed, and is zero-valued unless that node satisfies that predicate.
-
Citations
20 Claims
-
1. A computer comprising:
-
an access module configured to access a data structure, wherein the data structure is formed of at least one sequence of nodes having a plurality of elementary links, each elementary link being a directional edge from a respective node in the sequence to the next adjacent node in the sequence; and a distance computation module configured to compute, based one or more predicates, a distance along each elementary link for each of the one or more predicates, and store it in the data structure in association with that elementary link, wherein the distance along that elementary link is computed for that predicate by applying that predicate to the node to which that elementary link is directed, and is zero-valued unless that node satisfies that predicate. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A computer-implemented method of optimising an electronically stored data structure for an index lookup, wherein the data structure is formed of at least one sequence of nodes having a plurality of elementary links, each elementary link being a directional edge from a respective node in the sequence to the next adjacent node in the sequence, the method comprising:
-
computing, based one or more predicates, a distance along each elementary link for each of the one or more predicates by applying that predicate to the node to which that elementary link is directed, wherein the distance is zero-valued unless that node satisfies that predicate; and storing in the data structure, in association with each elementary link, the one or more distances along that link computed for the one or more predicates.
-
-
20. A computer program product comprising executable code stored on a computer-readable storage medium, the code configured when executed on a computer to perform the following operations:
-
accessing a data structure, wherein the data structure is formed of at least one sequence of nodes having a plurality of elementary links, each elementary link being a directional edge from a respective node in the sequence to the next adjacent node in the sequence; computing, based one or more predicates, a distance along each elementary link for each of the one or more predicates by applying that predicate to the node to which that elementary link is directed, wherein the distance is zero-valued unless that node satisfies that predicate; and storing in the data structure, in association with each elementary link, the one or more distances along that link computed for the one or more predicates.
-
Specification