US 12,222,945 B2
Federated graph queries across heterogeneous data stores
Anders Tungeland Gjerdrum, Tromso (NO); Theodoros Gkountouvas, Tromso (NO); and Jan-Ove Almli Karlberg, Tromso (NO)
Assigned to Microsoft Technology Licensing, LLC., Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on May 9, 2023, as Appl. No. 18/314,627.
Prior Publication US 2024/0378203 A1, Nov. 14, 2024
Int. Cl. G06F 7/00 (2006.01); G06F 16/00 (2019.01); G06F 16/2453 (2019.01); G06F 16/2455 (2019.01); G06F 16/248 (2019.01)
CPC G06F 16/2455 (2019.01) [G06F 16/24542 (2019.01); G06F 16/248 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
a processor; and
a query service implemented on the processor and configured to:
receive an input query from a user terminal via a network, the input query comprising a plurality of variables;
map each of the plurality of variables of the input query to elements of a public schema, wherein the elements of the public schema comprise entities and relationships;
identify a minimum set of multiple data stores for a plurality of store-specific queries, wherein the minimum set of multiple data stores comprises a smallest number of data stores to be searched to satisfy the input query;
map the plurality of variables of the input query to the minimum set of multiple data stores;
using the mapping of the plurality of variables of the input query to the minimum set of multiple data stores and the mapping of the plurality of variables of the input query to the elements of the public schema, assign storage tags to properties of the plurality of variables of the input query, each storage tag identifying a data store of the minimum set of multiple data stores;
based on at least the storage tags, perform the plurality of store-specific queries; and
return a query result to the user terminal based on at least the plurality of store-specific queries.