Detailed Action
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
This Office Action is in response to claims filed on 08/30/2022.
Claims 1-20 are pending; claims 1, 8, 14 and 18 are independent.
Claim Objections
Claim 11 is objected to for the following informalities.
There is insufficient antecedent basis for the underlined portion of the claim as shown below:
wherein obtaining from the data store one or more of the plurality of mutation operations performed on the extracted one or more entities comprises obtaining from the separate database one or more of the plurality of mutation operations performed on the extracted one or more entities over the selected period of time.
Please correct the informalities.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
Claims 3, 8-9, 11, 13, 15 and 48-19 rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor, or for pre-AIA the applicant regards as the invention.
The claims recite “disposition event messages” which is defined neither in the claims nor in the specification.
A Google search on 12/02/2025 showed the following AI generated description:
"Disposition event messages" are Message Disposition Notifications (MDNs), which are automated messages sent to a sender to report the status of a message's delivery. These messages indicate if the message was successfully delivered, failed, was processed, or was otherwise handled, and can include details like the reason for failure or a specific disposition type (e.g., "Displayed," "Deleted," "Denied").
This definition cannot be applied to the claims because it does not make sense in the context of claims 3, 8-9, 11, 13, 15 and 48-19.
Claim Rejections - 35 USC § 102
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 102 that forms the basis for all the rejections under this section made in this Office Action:
A person shall be entitled to a patent unless—
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention.
Claims 1-20 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Scheideler et al., Pub. No.: US 2019/0294733 A1 (Scheideler).
Scheideler teaches:
Claim 1. A method comprising:
maintaining in a data store associated with one or more entities of a graph database hosted at a knowledge base hosting network a respective one or more records of a plurality of mutation operations performed on the one or more entities; (each local subgraph in a remote device comprises nodes and edges, e.g., entities; modification/mutation operations on nodes and edges are recorded in a summary graph node in a central knowledge graph: ¶ 18, “a large central knowledge graph may be partitioned into sub-graphs of the original knowledge graph, wherein each sub-graph may represent one of the partitions or portions of the original, initial knowledge graph and each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”, ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph…This feature may make it easier to reintegrate a changed sub-graph, after the sub-graph may have been changed and may need resynchronization or reunification with the original, main knowledge graph”; ¶ 46, “the knowledge graph as a summary graph comprising, for each of the sub-graphs, a sub-graph representing vertex (i.e. a vertex which represents the sub-graph). Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”, ¶¶ 52, 62-63, “a modification of the local (remote) sub-graph is performed at 320…Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
obtaining from the data store one or more of the plurality of mutation operations performed on the one or more entities; and (see above, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a local/remote subgraph for updating the portion of the central knowledge graph related to the local/remote subgraph)
generating or updating one or more documents of a document storage based on the one or more of the plurality of mutation operations performed on the one or more entities obtained from the data store. (A generated summary graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
Claim 8. A method comprising:
extracting one or more entities from a graph database hosted at a knowledge base hosting network into a separate database; (each local subgraph in a remote device comprises nodes and edges, e.g., entities; modification/mutation operations on nodes and edges are recorded in a summary graph node in a central knowledge graph: ¶ 18, “a large central knowledge graph may be partitioned into sub-graphs of the original knowledge graph, wherein each sub-graph may represent one of the partitions or portions of the original, initial knowledge graph and each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”, ¶ 30, “the sub-graph may be separated from the initial, large knowledge graph by moving it to another partition on the same server ( or a different virtual or physical server) and allowing a restricted access to only a portion (i.e., the sub-graph) of the knowledge graph”; ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph…This feature may make it easier to reintegrate a changed sub-graph, after the sub-graph may have been changed and may need resynchronization or reunification with the original, main knowledge graph”; ¶ 46, “the knowledge graph as a summary graph comprising, for each of the sub-graphs, a sub-graph representing vertex (i.e. a vertex which represents the sub-graph). Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”, ¶¶ 52, 62-63, “a modification of the local (remote) sub-graph is performed at 320…Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
maintaining in the separate database associated with one or more entities of the graph database hosted at the knowledge base hosting network a respective one or more records of a plurality of mutation operations performed on the one or more entities; (see above, the entities, e.g., nodes/edges of a local/remote subgraph is maintained in a sperate central knowledge graph)
obtaining from the separate database one or more of the plurality of mutation operations performed on the extracted one or more entities; (see above, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a local/remote subgraph for updating the portion of the central knowledge graph related to the local/remote subgraph)
querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities in the separate database; and (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for relevant modified portion and bringing the modified local subgraph into the central knowledge graph: ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
generating or updating one or more documents of a document storage based on records returned from the query of the separate database. (A generated summary graph in the central knowledge graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
Claim 14. A computer-readable storage medium storing computer-readable instructions executable by one or more processors, that when executed by the one or more processors, cause the one or more processors to perform operations comprising:
maintaining in a data store associated with one or more entities of a graph database hosted at a knowledge base hosting network a respective one or more records of a plurality of mutation operations performed on the one or more entities; (each local subgraph in a remote device comprises nodes and edges, e.g., entities; modification/mutation operations on nodes and edges are recorded in a summary graph node in a central knowledge graph: ¶ 18, “a large central knowledge graph may be partitioned into sub-graphs of the original knowledge graph, wherein each sub-graph may represent one of the partitions or portions of the original, initial knowledge graph and each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”, ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph…This feature may make it easier to reintegrate a changed sub-graph, after the sub-graph may have been changed and may need resynchronization or reunification with the original, main knowledge graph”; ¶ 46, “the knowledge graph as a summary graph comprising, for each of the sub-graphs, a sub-graph representing vertex (i.e. a vertex which represents the sub-graph). Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”, ¶¶ 52, 62-63, “a modification of the local (remote) sub-graph is performed at 320…Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
obtaining from the data store one or more of the plurality of mutation operations performed on the one or more entities; and (see above, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a subgraph for updating the central knowledge graph)
querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities; and (see above, ¶¶ 34, 62-63, nodes and edges in a local/remote subgraph are the same nodes and edges in a portion of the central knowledge graph; the nodes and edges of the subgraph are obtained after modification for updating the related portion of the central knowledge graph: “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
generating or updating one or more documents of a document storage based on the one or more of the plurality of mutation operations performed on the one or more entities obtained from the data store. (A generated summary graph includes documents/content reflecting changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
Claim 18. A computer-readable storage medium storing computer-readable instructions executable by one or more processors, that when executed by the one or more processors, cause the one or more processors to perform operations comprising:
extracting one or more entities from a graph database hosted at a knowledge base hosting network into a separate database; (each local subgraph in a remote device comprises nodes and edges, e.g., entities; modification/mutation operations on nodes and edges are recorded in a summary graph node in a central knowledge graph: ¶ 18, “a large central knowledge graph may be partitioned into sub-graphs of the original knowledge graph, wherein each sub-graph may represent one of the partitions or portions of the original, initial knowledge graph and each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”, ¶ 30, “the sub-graph may be separated from the initial, large knowledge graph by moving it to another partition on the same server ( or a different virtual or physical server) and allowing a restricted access to only a portion (i.e., the sub-graph) of the knowledge graph”; ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph…This feature may make it easier to reintegrate a changed sub-graph, after the sub-graph may have been changed and may need resynchronization or reunification with the original, main knowledge graph”; ¶ 46, “the knowledge graph as a summary graph comprising, for each of the sub-graphs, a sub-graph representing vertex (i.e. a vertex which represents the sub-graph). Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”, ¶¶ 52, 62-63, “a modification of the local (remote) sub-graph is performed at 320…Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
maintaining in the separate database associated with one or more entities of the graph database hosted at the knowledge base hosting network a respective one or more records of a plurality of mutation operations performed on the one or more entities; (see above, the entities, e.g., nodes/edges of a local/remote subgraph is maintained in a sperate central knowledge graph)
obtaining from the separate database one or more of the plurality of mutation operations performed on the extracted one or more entities; (see above, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a local/remote subgraph for updating the portion of the central knowledge graph related to the local/remote subgraph)
querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities in the separate database; and (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for relevant modified portion and bringing the modified local subgraph into the central knowledge graph: ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
generating or updating one or more documents of a document storage based on records returned from the query of the separate database. (A generated summary graph in the central knowledge graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
Claim 2. The method of claim 1, further comprising:
querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities; and (¶¶ 34, 62, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a local/remote subgraph for updating the portion of the central knowledge graph related to the local/remote subgraph: “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
wherein generating or updating one or more documents of a document storage comprises generating or updating the one or more documents of the document storage based on the one or more of the plurality of mutation operations performed on the one or more entities obtained from the data store or the records returned from the query of the graph data base. (A generated summary graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”; ¶ 62)
Claim 3. The method of claim 2, wherein querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities comprises, for each of the obtained one or more of the plurality of mutation operations performed on the one or more entities:
applying, by a query-writing framework, a disposition event message based on the mutation operation to output a first selective query; (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for identifying only a portion of the central knowledge graph corresponding to a remote subgraph and updating only the portion of the central knowledge graph related to the remote subgraph: ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph. This may prevent the main knowledge graph from being modified in portions relating to the sub-graph if a local copy may have been generated”, ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
querying the knowledge base hosting network using the first selective query; (see above, ¶¶ 34, 62-63, nodes and edges in a local/remote subgraph are the same nodes and edges in a portion of the central knowledge graph; the nodes and edges of the subgraph are obtained after modification for updating the related portion of the central knowledge graph: “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
publishing a root node event message comprising a root node returned from the first selective query; (changes occurred to the “content of the local sub-graph” is applied to the knowledge graph from the node related to the subgraph; therefore, a root node is a node from which changes are applied to the knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”; ¶ 49, “the central knowledge graph management engine 202 contains a reinsertion or reintegration or replication and merge engine 214 adapted for bringing back a modified sub-graph into the central knowledge graph 206 through reinsertion/reintegration/replication”) )
applying the root node event message to the query-writing framework to output a second selective query; and (changes occurred to the “content of the local sub-graph” is applied to the knowledge graph from the node related to the subgraph; therefore, a root node, whether obtained by a first query, second query, etc., is a node from which changes are applied to the knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”, ¶ 49, “the central knowledge graph management engine 202 contains a reinsertion or reintegration or replication and merge engine 214 adapted for bringing back a modified sub-graph into the central knowledge graph 206 through reinsertion/reintegration/replication”)
querying the knowledge base hosting network using the second selective query; and (changes occurred to the “content of the local sub-graph” is applied to the knowledge graph from the node related to the subgraph; therefore, a root node, whether obtained by a first query, second query, etc., is a node from which changes are applied to the knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”)
wherein generating or updating one or more documents of a document storage based on records returned from the query of the graph data base comprises generating or updating the one or more documents of the document storage based on records returned from the second selective query. (A generated summary graph reflects changes occurred in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 27, “it may be possible to edit the remote portion of the knowledge graph and reintegrate it afterwards into the central knowledge graph without any manual intervention”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”; ¶ 49)
Claim 4. The method of claim 2, wherein maintaining in the data store associated with one or more entities of the graph database hosted at the knowledge base hosting network the respective one or more records of the plurality of mutation operations performed on the one or more entities comprises maintaining in the data store associated with one or more entities of the graph database hosted at the knowledge base hosting network the respective one or more records of the plurality of mutation operations performed on the one or more entities over a selected period of time; (¶ 63, wherein “the reinsertion can be triggered by passage of a certain time period” suggests that nodes and edges in corresponding subgraphs and the central knowledge graph are related to certain period of time)
wherein obtaining from the data store one or more of the plurality of mutation operations performed on the one or more entities comprises obtaining from the data store one or more of the plurality of mutation operations performed on the one or more entities over the selected period of time; and (¶ 63, wherein “the reinsertion can be triggered by passage of a certain time period” suggests that nodes and edges in corresponding subgraphs and the central knowledge graph are related to certain period of time)
wherein querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities comprises querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities over the selected period of time. (¶ 63, wherein “the reinsertion can be triggered by passage of a certain time period” suggests that nodes and edges in corresponding subgraphs and the central knowledge graph are related to certain period of time)
Claim 5. The method of claim 4, wherein the data store associated with one or more entities of the graph database hosted at the knowledge base hosting network that maintains the respective one or more records of the plurality of mutation operations performed on the one or more entities over the selected period of time comprises a plurality of data stores associated with one or more entities of the graph database hosted at the knowledge base hosting network that each maintain the respective one or more records of the plurality of mutation operations performed on the one or more entities over a respective non-overlapping selected period of time; (¶ 63, a subgraph is changed in multiple non overlapping time because “the reinsertion can be triggered by passage of a certain time period”)
wherein obtaining from the data store one or more of the plurality of mutation operations performed on the one or more entities comprises obtaining from each of the plurality of data stores one or more of the plurality of mutation operations performed on the one or more entities over the respective non-overlapping selected period of time; and(¶ 63, a subgraph is changed in multiple non overlapping time because “the reinsertion can be triggered by passage of a certain time period”)
wherein generating or updating one or more documents of the document storage based on the one or more of the plurality of mutation operations performed on the one or more entities obtained from the data store comprises generating or updating one or more documents of the document storage based on the one or more of the plurality of mutation operations performed on the one or more entities over the respective non-overlapping selected period of time obtained from the each of the plurality of data stores. (¶ 63, a subgraph is changed in multiple non overlapping time because “the reinsertion can be triggered by passage of a certain time period” and a graph summary is related to the time when a subgraph is reinstated as in ¶¶ 18 and 46)
Claim 6. The method of claim 1, wherein each of the one or more entities is selected from a group consisting of: one or more nodes, one or more connected edges, or a combination of one or more nodes and one or more edges, of the graph database hosted at the knowledge base hosting network. (¶ 52, each local subgraph in a remote device and central knowledge graph comprise nodes and edges, e.g. entities: “A central knowledge graph can be represented by G(V, E) and comprise the set V of all vertices and of the set E of all edges. The central knowledge graph can be broken down into a set of sub-graphs gi(vi, ei), each comprising a subset of vertices vi out of V and a subset of edges ei out of E. Each sub-graph can be much smaller than the central knowledge graph, i.e., comprising much fewer vertices and edges than the central knowledge graph, represented by gi(vi, ei)⊂G(V,E). Sub-graphs can be disjointed or may overlap”)
Claim 7. The method of claim I further comprising:
extracting from the one or more documents of the document storage a subset of the one or more entities obtained from the data store; (a portion of the central knowledge graph includes a summary node corresponding to a modified subgraph; the summary is updated based on the changes in the subgraph: ¶ 3, “content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”, ¶¶ 39, 46, “representing…the knowledge graph as a summary graph comprising, for each of the sub-graphs, a sub-graph representing vertex (i.e. a vertex which represents the sub-graph). Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
obtaining from the data store one or more of a plurality of mutation operations performed on the subset of the one or more entities; and (see above, a summery node corresponding to the modified subgraph in the central knowledge graph contains changes in the subgraph)
generating or updating one or more documents of the document storage based on the one or more of the plurality of mutation operations performed on the subset of the one or more entities obtained from the data store. (see above, a generated summary graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”; ¶ 49)
Claim 9. The method of claim 8, further comprising:
querying the knowledge base hosting network in response to disposition event messages based on mutation operations at the graph database hosted by the knowledge base hosting network; and (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for relevant modified portion and bringing the modified local subgraph into the central knowledge graph: ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
generating or updating the extracted one or more entities in the separate database based on records returned from the query of the knowledge base hosting network. (A generated summary graph in the central knowledge graph reflects changes in a subgraph: ¶ 18, “each of the sub-graphs may be represented by one single summary so that a summary graph may be generated out of the summary vertices”; ¶ 46, “Each of the sub-graph representing vertices is related to an index file and a content file. The index file comprises a list of all sub-graph vertices (and their identifiers) and edges of the sub-graph (and their identifiers and potentially also identifiers of the related vertices). The content file comprises searchable content of the sub-graph, which can be a potentially condensed summary of the content of the vertices of the sub-graphs”)
Claim 10. The method of claim 8, wherein extracting the one or more entities from the graph database into the separate database comprises receiving and reorganizing the one or more entities in the separate database according to user input/business logic. (¶ 26-29, wherein “Not all users may have access to the complete knowledge graph. A management concept may be used to allow certain users or user groups only access to certain topics represented by sub-graphs of the complete knowledge graph… a partition may be accessed by users with limited access rights to the large original knowledge graph. E.g., users working remotely from the server may only access the sub-graph in the special partition, without being exposed to the central, original, complete knowledge graph. This technique may also be used for users having only paid for accessing a sub-graph of the knowledge graph” discloses that certain nodes and edges are selected according to user input/business logic)
Claim 11. The method of claim 8, wherein maintaining in the separate database associated with one or more entities of the graph database hosted at the knowledge base hosting network the respective one or more records of the plurality of mutation operations performed on the one or more entities comprises maintaining in the separate database associated with one or more entities of the graph database hosted at the knowledge base hosting network the respective one or more records of the plurality of mutation operations performed on the one or more entities over a selected period of time; (¶ 63, wherein “the reinsertion can be triggered by passage of a certain time period” suggests that nodes and edges in corresponding subgraphs and the central knowledge graph are related to certain period of time)
wherein obtaining from the data store one or more of the plurality of mutation operations performed on the extracted one or more entities comprises obtaining from the separate database one or more of the plurality of mutation operations performed on the extracted one or more entities over the selected period of time; and (¶ 63, wherein “the reinsertion can be triggered by passage of a certain time period” suggests that nodes and edges in corresponding subgraphs and the central knowledge graph are related to certain period of time)
wherein querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities in the separate database comprises querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities over the selected period of time. (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for relevant modified portion and bringing the modified local subgraph into the central knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”; ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
Claim 12. The method of claim 8, wherein each of the one or more entities is selected from a group consisting of: one or more nodes, one or more connected edges, or a combination of one or more nodes and one or more edges, of the graph database hosted at the knowledge base hosting network. (¶ 52, each local subgraph in a remote device and central knowledge graph comprise nodes and edges, e.g. entities: “A central knowledge graph can be represented by G(V, E) and comprise the set V of all vertices and of the set E of all edges. The central knowledge graph can be broken down into a set of sub-graphs gi(vi, ei), each comprising a subset of vertices vi out of V and a subset of edges ei out of E. Each sub-graph can be much smaller than the central knowledge graph, i.e., comprising much fewer vertices and edges than the central knowledge graph, represented by gi(vi, ei)⊂G(V,E). Sub-graphs can be disjointed or may overlap”)
Claim 13. The method of claim 8, wherein extracting the one or more entities from the graph database hosted at the knowledge base hosting network into the separate database comprises modifying [e.g., adding fields and/or properties] the extracted one or more entities in the separate database; and (subgraphs and the central knowledge graph are modified by adding/deleting nodes/edges: ¶¶ 28-31, “The option to change the remote sub-graph may include to change/add/delete vertices or related parameters, as well as, change/add/delete edges between the vertices of the sub-graph. Thus, the full spectrum of management functions that is typically available for a knowledge graph may also be available for users having only access to the sub-graph”)
wherein querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities in the separate database comprises querying the separate database in response to disposition event messages based on the obtained one or more of the plurality of mutation operations performed on the extracted one or more entities as modified in the separate database. (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for relevant modified portion and bringing the modified local subgraph into the central knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”; ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
Claim 15. The computer readable medium of claim 14, wherein querying the graph database hosted at the knowledge base hosting network about the obtained one or more of the plurality of mutation operations performed on the one or more entities comprises, for each of the obtained one or more of the plurality of mutation operations performed on the one or more entities:
applying, by a query-writing framework, a disposition event message based on the mutation operation to output a first selective query; (Note that this claim is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph because it is not clear what “a disposition event message” is; however, for moving forward, it is considered as a choice for identifying/searching either a local subgraph, central knowledge graph and/or both for identifying only a portion of the central knowledge graph corresponding to a remote subgraph and updating only the portion of the central knowledge graph related to the remote subgraph: ¶ 34, “the method may also comprise locking one of the sub-graphs, in particular, the vertices and edges, in the knowledge graph. This may prevent the main knowledge graph from being modified in portions relating to the sub-graph if a local copy may have been generated”, ¶¶ 62-63, “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
querying the knowledge base hosting network using the first selective query; (¶¶ 34, 62, a summary vertex in a central knowledge graph includes updated nodes and edges in a subgraph and the same nodes and graphs are further obtained from a local/remote subgraph for updating the portion of the central knowledge graph related to the local/remote subgraph: “local sub-graph can be accessed…, i.e., be searched and read. Content of the vertices and structure of the edges (linkage) can be modified…After modifications…a reinsertion, replication, or resynchronization of the local subgraphs (from the remote device) into the central knowledge graph is performed”)
publishing a root node event message comprising a root node returned from the first selective query; (changes occurred to the “content of the local sub-graph” is applied to the central knowledge graph from the node related to the subgraph; therefore, a root node is a node from which changes are applied to the knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”; ¶ 49, “the central knowledge graph management engine 202 contains a reinsertion or reintegration or replication and merge engine 214 adapted for bringing back a modified sub-graph into the central knowledge graph 206 through reinsertion/reintegration/replication”) )
applying the root node event message to the query-writing framework to output a second selective query; and (changes occurred to the “content of the local sub-graph” is applied to the central knowledge graph from the node related to the subgraph; therefore, a root node, whether obtained by a first query, second query, etc., is a node from which changes are applied to the knowledge graph: ¶ 3, “The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph”, ¶ 49, “the central knowledge