US 2022/0019590 A1 · SWIFT QUERY ENGINE AND METHOD THEREFORE

Abstract

A method of realizing a scalable fast query engine randomly shuffles object vectors of a massive array of object vectors to produce a sorted array of object vectors, each object vector containing a respective number of keys of a massive set of predefined keys, and inverts the sorted array, with ordered mapping, onto a set of key-specific arrays of objects. Upon receiving a query, a query-specific array of objects is formed from selected key-specific arrays corresponding to specific keys stated in the query. In response to the query, a target set of objects is formed to include the query-specific set and selected objects of key-specific sets of high intersection levels with the query-specific set. The method identifies candidate key-specific arrays from the entire set of key-specific arrays then determines precise, or exact, intersection levels of the candidate key-specific arrays with the query-specific array.

Claims20

Dependent claims

A method of selecting a target set of objects, implemented at a query engine employing at least one processor, the method comprising:

acquiring an array of N objects, each object associated with a respective object vector comprising a respective number of keys from a set of predefined keys;
randomly shuffling the N objects to produce a sorted array of objects;
inverting the sorted array of objects with ordered mapping onto a number of key-specific arrays of objects identified as positions of said sorted array;
receiving a query stating a number of keys belonging to a set of predefined keys;
forming a query-specific array of objects including contents of selected key-specific arrays corresponding to query-stated keys;
determining an intersection level of each key-specific array, excluding the selected key-specific arrays, with the query-specific array;
forming a target set of objects to include the query-specific array and a subset of at least one key-specific array having an intersection level with the query-specific array exceeding a predefined lower bound.

4 more elements

A query engine comprising:

a network interface configured to communicate with data sources and clients;
a first module configured to randomly shuffle an acquired array of objects to produce a sorted array of objects and assign a rank of each object in the sorted array as a respective global identifier;
a second module configured to perform ordered mapping of the sorted array of objects onto a set of key-specific arrays of objects so that each key-specific array contains global identifiers in an ascending order;
a third module configured to generate a query-specific array of objects corresponding to key-words specified in a query;
a fourth module configured to determine candidate key-specific arrays of objects based on intersection with said query-specific array of objects;
a fifth module configured to form a set of target objects combining the query-specific array and selected candidate key-specific arrays of objects;
a memory device storing the sorted array of objects, respective object vectors, and the key-specific arrays of objects;
and
at least one processor coupled to said network interface, first module, second module, third module, fourth module, and fifth module.

6 more elements

Dependencies are inferred from the claim text.

Swift query engine and method therefore

Life of this patent

Swift query engine and method therefore

Life of this patent

Abstract

Claims20