| CPC G06F 16/24542 (2019.01) [G06F 16/24565 (2019.01); G06F 16/9024 (2019.01)] | 9 Claims |
|
1. A non-transitory computer-readable storage medium storing a computer program that causes a computer to perform a process comprising:
receiving a search query for graph data representing a graph including nodes and edges connecting the nodes, each of the nodes being associated with values of a first property and a second property, the search query specifying a search criterion for searching the nodes, the search criterion including a plurality of criterion items including a first criterion item that uses the first property and a second criterion item that uses the second property, the first criterion item specifying that a value of the first property is less than a first threshold;
receiving a constraint rule that uses the first property, the constraint rule indicating that a second value of the first property associated with a second node of the nodes is restricted to be less than a first value of the first property associated with a first node of the nodes;
sorting the plurality of criterion items so that a determination based on the first criterion item is made prior to a determination based on the second criterion item;
determining whether the first value matches the first criterion item;
predicting, when a result of the determining indicates that the first value matches the first criterion item, that the second value matches the first criterion item, in accordance with the constraint rule; and
generating a search result for the search query in accordance with the result of the determining and a result of the predicting.
|