US 11,941,006 B2
Heuristic database querying with dynamic partitioning
Chandra Biksheswaran Mouleeswaran, Cupertino, CA (US); Amit Agarwal, Cupertino, CA (US); Prashant Kumar Pathak, San Jose, CA (US); and Xiaoyan Wang, Pleasanton, CA (US)
Assigned to Palo Alto Networks, Inc., Santa Clara, CA (US)
Filed by Palo Alto Networks, Inc., Santa Clara, CA (US)
Filed on Jul. 29, 2022, as Appl. No. 17/815,969.
Prior Publication US 2024/0037101 A1, Feb. 1, 2024
Int. Cl. G06F 16/2455 (2019.01); G06F 16/2453 (2019.01); G06F 16/2458 (2019.01)
CPC G06F 16/2455 (2019.01) [G06F 16/24542 (2019.01); G06F 16/2471 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
based on submission of a first query to a database, determining a plurality of candidate partitions of a search space corresponding to the database, wherein determining the plurality of candidate partitions comprises selecting sets of one or more candidate values of a first key to be appended to the first query;
evaluating the plurality of candidate partitions based on a plurality of heuristics;
selecting a first partition of the plurality of candidate partitions for execution of the first query based on the evaluating, wherein the first partition corresponds to a first of the sets of one or more candidate values of the first key;
obtaining a first subset of results of the first query, wherein the first subset of results is a result of executing the first query on the first partition of the search space; and
paginating the first subset of results of the first query.