US 12,229,133 B1
System and algorithms for fast and scalable data access to high dimensionality with sparse data
Ragy Eleish, Las Vegas, NV (US); Aaron Kaminsky, San Jose, CA (US); Yunfeng Fei, Fremont, CA (US); Yuh-Ming Shyy, Saratoga, CA (US); Ramabrahmam Venkata Velury, Santa Clara, CA (US); Ashish Patel, Fremont, CA (US); and Christof Bornhoevd, Belmont, CA (US)
Assigned to Workday, Inc., Pleasanton, CA (US)
Filed by Workday, Inc., Pleasanton, CA (US)
Filed on Mar. 17, 2023, as Appl. No. 18/186,045.
Int. Cl. G06F 7/00 (2006.01); G06F 16/2453 (2019.01); G06F 16/2455 (2019.01); G06F 16/248 (2019.01)
CPC G06F 16/24542 (2019.01) [G06F 16/2455 (2019.01); G06F 16/248 (2019.01)] 18 Claims
OG exemplary drawing
 
1. A system, comprising:
one or more processors configured to:
receive a query from a client system;
determine, based at least in part on the query, a plurality of partitions of a hypercube that are expected to comprise information used in generating a response for the query, wherein determining the plurality of partitions comprises:
obtaining an incoming grid definition based at least in part on the query;
segmenting the incoming grid definition into segment intersections; and
determining dependencies and coordinates associated with the segment intersections;
obtain, from a data source, a set of results for the plurality of partitions, the set of results comprising data stored in the plurality of partitions of the hypercube;
determine a plurality of virtual objects for the set of results;
combine the plurality of virtual objects into the response to the query; and
provide, to the client system, the response to the query; and
a memory coupled to the one or more processors and configured to provide the one or more processors with instructions.