IP Library › Granted Patent US 12,505,031
Granted Patent B2
US 12,505,031 · App. 18/378,415 · Granted Dec 23, 2025

Systems and methods for graph management

Inventors: Krishna Mohan Bhupathi (Cary, NC); Maria Lucena (King of Prussia, PA); Benjamin Dixon (Atlanta, GA); John Martin Arnesen (Maineville, OH); Divya Mahajan (Nashua, NH)
Assignee: FMR LLC
G06F11/3698
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,031
App. No.
18/378,415
Granted
Dec 23, 2025
Kind
B2
Abstract

A computer-implemented system is provided for configuring and managing a federation ecosystem implemented in a data query language and comprising a plurality of subgraphs. The system includes a sandbox registry in communication with the subgraphs. The sandbox registry is configured to test and verify changes to the subgraphs to ensure validity of the subgraphs. The system also includes a global registry in communication with the sandbox registry. The global registry is configured to register the subgraphs after the subgraphs are tested and verified by the sandbox registry. The system further includes a portal in communication with the global registry. The portal is configured to present to a user the subgraphs registered with the global registry and receive from the user instructions for combining two or more of the subgraphs to form at least one supergraph.

Claims (29)

1 . A computer-implemented system for configuring and managing a federation ecosystem implemented in a data query language and comprising a plurality of subgraphs, each subgraph representing a self-contained microservice, the computer-implemented system comprising:

a sandbox registry in communication with the plurality of subgraphs, the sandbox registry configured to test and verify changes to the plurality of subgraphs to ensure validity of the subgraphs;

a global registry in communication with the sandbox registry, the global registry configured to register the subgraphs after the subgraphs are tested and verified by the sandbox registry;

a plurality of gateways in communication with the global registry; and

a portal in communication with the global registry, the portal configured to present to one or more users the plurality of subgraphs registered with the global registry and receive from the one or more users: (i) instructions for combining two or more of the plurality of subgraphs to form respective ones of a plurality of supergraphs, and (ii) selections among the plurality of gateways to deploy the respective ones of the supergraphs,

wherein the global registry is adapted to centrally manage the plurality of supergraphs by automatically (i) composing each of the plurality of supergraphs based on the two or more subgraphs specified in the user instructions for each supergraph, (ii) communicating with the selected gateways for respective ones of the plurality of supergraphs to orchestrate service and deployment of the corresponding supergraphs at runtime, and (iii) managing a life cycle of each of the plurality of supergraphs that is mapped to the corresponding two or more subgraphs registered with the global registry.

2 . The computer implemented system of claim 1 , wherein the portal is configured to allow each of the one or more users to select options for configuring the selected gateway in association with the corresponding one of the plurality of supergraphs.

3 . The computer implemented system of claim 2 , wherein the portal is further configured to allow the user to discover and explore the subgraphs registered with the global registry and browse functionalities of the subgraphs.

4 . The computer-implemented system of claim 1 , wherein at least one subgraph in the plurality of subgraphs is used to compose two or more of the plurality of supergraphs.

5 . The computer-implemented system of claim 1 , further comprising a continuous integration (CI) pipeline configured to publish the plurality of subgraphs to the sandbox registry.

6 . The computer-implemented system of claim 5 , wherein if a subgraph in the plurality of subgraphs is associated with a supergraph in the plurality of supergraphs, the CI pipeline is configured to perform access control and schema validation checks on the subgraph against the corresponding supergraph.

7 . The computer-implemented system of claim 1 , wherein the global registry is configured to verify that the user instructions for composing the plurality of supergraphs comply with a set of predefined policies and do not violate access rules associated with the two or more subgraphs used to form each of the plurality of supergraphs.

8 . The computer-implemented system of claim 1 , wherein the global registry manages the life cycle of each of the plurality of supergraphs by performing at least one of (i) automatically updating the supergraph when an update occurs to at least one of the subgraphs based on which the supergraph is formed, or (ii) automatically removing the supergraph from the federation ecosystem when the supergraph is obsolete.

9 . The computer-implemented system of claim 1 , wherein the global registry is configured to maintain an audit trail that defines the subgraphs and maps the subgraphs to corresponding ones of the supergraphs in the federation ecosystem.

10 . The computer-implemented system of claim 1 , wherein the data query language is GraphQL.

11 . A computer-implemented method for managing a federation ecosystem implemented in a data query language, the computer-implemented method comprising:

presenting to one or more users, by a portal in communication with a global registry, information related to a plurality of subgraphs registered with the global registry, including allowing each of the one or more users to discover and explore, via the portal, the plurality of subgraphs and browse functionalities of the plurality of subgraphs, each subgraph representing a self-contained microservice, wherein the global registry is in communication with a sandbox registry that is configured to provide the information about the plurality of subgraphs to the global registry after testing and verifying the subgraphs;

receiving from the one or more users, via the portal, (i) instructions for combining two or more of the plurality of subgraphs to form respective ones of a plurality of supergraphs, and (ii) selections among a plurality of gateways to deploy the respective ones of the supergraphs; and

centrally managing, by the global registry, the plurality of supergraphs by:

automatically composing each of the plurality of supergraphs based on the two or more subgraphs specified in the user instructions for each supergraph;

communicating with the selected gateways for respective ones of the supergraphs to orchestrate service and deployment of the corresponding supergraphs at runtime; and

managing a life cycle of each of the plurality of supergraphs, wherein each supergraph is mapped to the corresponding two or more subgraphs registered with the global registry.

12 . The computer-implemented method of claim 11 , wherein the information presented by the portal includes options selectable by the user to configure the plurality of gateways in association with respective ones of the plurality of supergraphs.

13 . The computer-implemented method of claim 11 , wherein at least one subgraph in the plurality of subgraphs is used to compose two or more of the plurality of supergraphs.

14 . The computer-implemented method of claim 11 , further comprising publishing the plurality of subgraphs to the sandbox registry using a continuous integration (CI) pipeline.

15 . The computer-implemented method of claim 14 , further comprising, if a subgraph in the plurality of subgraphs is associated with a supergraph in the plurality of supergraphs, performing access control and schema validation checks on the subgraph against the corresponding supergraph by the CI pipeline.

16 . The computer-implemented method of claim 11 , wherein automatically composing each of the plurality of supergraphs comprises verifying by the global registry that the user instructions for composing the supergraph comply with a set of predefined policies and do not violate access rules associated with the two or more subgraphs used to form each of the plurality of supergraphs.

17 . The computer-implemented method of claim 11 , wherein centrally managing a life cycle of each of the plurality of supergraphs comprises performing, by the global registry, at least one of (i) automatically updating the supergraph when an update occurs to at least one of the subgraphs based on which the supergraph is formed, or (ii) automatically removing the supergraph from the federation ecosystem when the supergraph is obsolete.

18 . The computer-implemented method of claim 11 , wherein the data query language is GraphQL.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2023
From: BHUPATHI, KRISHNA MOHAN; LUCENA, MARIA; DIXON, BENJAMIN; ARNESEN, JOHN MARTIN; MAHAJAN, DIVYA
To: FMR LLC
Reel/Frame 065352/0959 →
Continuity (1)
Related Publication 20250117316A1 · Apr 10, 2025
References Cited (5)
US 20120159425A1 · Shukla · 2012 [cited by examiner]
US 20170090894A1 · Maus · 2017 [cited by examiner]
US 20230138971A1 · Krishnan · 2023 [cited by examiner]
Debergalis, Matt, “The Supergraph: A New Way to Think About GraphQL,” Apollo Graph Inc., Blog, Retrieved from the Internet: <https://www.apollographql.com/blog/the-supergraph-a-new-way-to-think-about-graphql>, May 18, 2… [cited by applicant]
“Supergraph-Specific Studio Features,”Apollo Graph Inc., Retrieved from the Internet: <https://www.apollographql.com/ docs/graphos/graphs/federated-graphs/>, Published prior to Oct. 10, 2023, pp. 1-17. [cited by applicant]