US2021294854A1PendingUtilityA1

Merging of graphs

Assignee: STUEMPFIG THOMASPriority: Mar 19, 2020Filed: Mar 18, 2021Published: Sep 23, 2021
Est. expiryMar 19, 2040(~13.6 yrs left)· nominal 20-yr term from priority
G06F 16/9024G06F 21/44G06F 16/28G06F 21/6218
17
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A computer-implemented method including provision of at least two subgraphs, merging the at least two subgraphs to form a complete graph on the basis of at least one merging rule, wherein, when merging the at least two subgraphs on the basis of the at least one merging rule, a version of the merging rule is stored.

Claims

exact text as granted — not AI-modified
1 . A computer-implemented method comprising:
 providing at least two subgraphs; and   merging the at least two subgraphs to form a complete graph on a basis of at least one merging rule;   wherein when merging the at least two subgraphs on the basis of the at least one merging rule, a version of the at least one merging rule is stored.   
     
     
         2 . The computer-implemented method of  claim 1 , wherein providing the at least two subgraphs comprises preparing raw data. 
     
     
         3 . The computer-implemented method of  claim 1 , wherein providing the at least two subgraphs comprises authorization of an access to the at least two subgraphs. 
     
     
         4 . The computer-implemented method of  claim 3 , wherein authorization of an access comprises using a Security Assertion Markup Language (SAML). 
     
     
         5 . The computer-implemented method of  claim 1 , wherein providing the at least two subgraphs comprises providing the at least two subgraphs to an authenticated user. 
     
     
         6 . The computer-implemented method of  claim 1 , wherein providing the at least two subgraphs comprises providing the at least two subgraphs as stateless REST Web Service methods with JSON-LD. 
     
     
         7 . The computer-implemented method of  claim 1 , wherein the complete graph is stored in a semantic database. 
     
     
         8 . The computer-implemented method of  claim 1 , wherein the at least one merging rule is provided by a dedicated automatic rule system. 
     
     
         9 . The computer-implemented method of  claim 2 , wherein
 preparing raw data comprises a creation of a semantic description of the raw data.   
     
     
         10 . A non-transitory computer implemented storage medium that stores machine-readable instructions executable by at least one processor, the machine-readable instructions comprising:
 providing at least two subgraphs; and   merging the at least two subgraphs to form a complete graph on a basis of at least one merging rule;   wherein when merging the at least two subgraphs on the basis of the at least one merging rule, a version of the at least one merging rule is stored.   
     
     
         11 . The non-transitory computer implemented storage medium of  claim 10 , wherein providing the at least two subgraphs comprises preparing raw data. 
     
     
         12 . The non-transitory computer implemented storage medium of  claim 10 , wherein providing the at least two subgraphs comprises authorization of an access to the at least two subgraphs. 
     
     
         13 . The non-transitory computer implemented storage medium of  claim 12 , wherein authorization of an access comprises using a Security Assertion Markup Language (SAML). 
     
     
         14 . The non-transitory computer implemented storage medium of  claim 10 , wherein providing the at least two subgraphs comprises providing the at least two subgraphs to an authenticated user. 
     
     
         15 . The non-transitory computer implemented storage medium of  claim 10 , wherein providing the at least two subgraphs comprises providing the at least two subgraphs as stateless REST Web Service methods with JSON-LD. 
     
     
         16 . The non-transitory computer implemented storage medium of  claim 10 , wherein the complete graph is stored in a semantic database. 
     
     
         17 . The non-transitory computer implemented storage medium of  claim 10 , wherein the at least one merging rule is provided by a dedicated automatic rule system. 
     
     
         18 . The non-transitory computer implemented storage medium of  claim 11 , wherein
 preparing raw data comprises a creation of a semantic description of the raw data.

Join the waitlist — get patent alerts

Track US2021294854A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.