US 12,174,831 B2
Scouting queries for improving query planning in distributed asynchronous graph queries
Tomáš Faltín, Prague (CZ); Vasileios Trigonakis, Zurich (CH); Sungpack Hong, Palo Alto, CA (US); and Hassan Chafi, San Mateo, CA (US)
Assigned to Oracle International Corporation, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Dec. 2, 2022, as Appl. No. 18/073,629.
Prior Publication US 2024/0184780 A1, Jun. 6, 2024
Int. Cl. G06F 16/245 (2019.01); G06F 16/2453 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/24542 (2019.01) [G06F 16/9024 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-executed method comprising:
creating a plurality of scouting queries, each scouting query in the plurality of scouting queries corresponding to a respective query plan in a plurality of query plans for a graph query for searching a graph, wherein each query plan in the plurality of query plans has an associated confidence value and a corresponding scouting query;
performing limited execution of the plurality of scouting queries;
determining a metric value for each scouting query in the plurality of scouting queries based on the limited execution of the scouting query;
determining a score for each query plan in the plurality of query plans based on the confidence value of the query plan and the metric value of its corresponding scouting query;
selecting a query plan based on the scores of the plurality of query plans; and
executing the graph query based on the selected query plan.