Searching a Data Structure

摘要

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.

主权项

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.