Data collaboration between different entities
US-9857960-B1 · Jan 2, 2018 · US
US11327641B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-11327641-B1 |
| Application number | US-201916285010-A |
| Country | US |
| Kind code | B1 |
| Filing date | Feb 25, 2019 |
| Priority date | Aug 25, 2015 |
| Publication date | May 10, 2022 |
| Grant date | May 10, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Techniques related to data collaboration between different entities are disclosed. In an embodiment, a graph may be displayed in a computer graphical user interface. The graph may include nodes and edges. Each node may represent a distinct data object. Each edge may represent one or more relationships between the two distinct data objects. Based on one or more redaction criteria, a portion of the graph may be identified to be redacted before the graph is exported. Display of the graph in the computer graphical user interface may be updated to remove display of the portion of the graph. After the updating, a request to export the graph may be received. Responsive to receiving the request, a machine-readable representation of a redacted graph may be exported.
Opening claim text (preview).
What is claimed is: 1. A method comprising: displaying, in a computer graphical user interface of a computing device, a graph comprising nodes and edges, each of the edges connecting two of the nodes, each of the nodes representing a distinct data object, each edge representing one or more relationships between two distinct data objects; automatically detecting redaction criteria based on metadata of the graph, the automatically detected redaction criteria comprising: an access control classification, a provenance identifier, a data object type, and a data object property type; receiving, via the graphical user interface, a selection of a redaction template of a plurality of redaction templates, the redaction template specifying at least four redaction stages and at least four redaction criteria from the automatically detected redaction criteria; identifying a portion of the graph to be redacted before a redacted graph is exported, the portion comprising nodes of the graph and edges of the graph, the redacted graph comprising nodes and edges of the graph exclusive of the portion to be redacted; determining that the portion of the graph to be redacted is identified in a series of the at least four redaction stages based on the redaction template, wherein at each redaction stage, of the series of at least four redaction stages, one or more respective nodes or one or more respective edges of the graph are identified for inclusion in the portion of the graph to be redacted according to a different redaction criterion of the at least four redaction criteria; and exporting a machine-readable representation of the redacted graph; and wherein the method is performed by one or more computing devices. 2. The method of claim 1 , wherein identifying a portion of the graph to be redacted and updating display of the graph in a computer graphical user interface to remove display of a redacted portion of the graph are performed in each redaction stage of the series of at least four redaction stages. 3. The method of claim 1 , wherein the machine-readable representation is exported with an ontology map of the redacted graph. 4. The method of claim 1 , wherein the machine-readable representation comprises a respective unique identifier for each distinct data object in the redacted graph. 5. The method of claim 1 , wherein the exporting a machine-readable representation of the redacted graph that comprises the graph exclusive of the portion of the graph includes generating and providing audit data to a person authorized to approve the exporting of the machine-readable representation. 6. A computer system comprising: one or more processors; and one or more computer-readable media storing instructions which, when executed by the one or more processors, cause: displaying, in a computer graphical user interface of a computing device, a graph comprising nodes and edges, each of the edges connecting two of the nodes, each of the nodes representing a distinct data object, each edge representing one or more relationships between two distinct data objects; automatically detecting redaction criteria based on metadata of the graph, the automatically detected redaction criteria comprising: an access control classification, a provenance identifier, a data object type, and a data object property type; receiving, via the graphical user interface, different user-selected redaction criteria from the automatically detected redaction criteria; identifying a portion of the graph to be redacted before a redacted graph is exported, the portion comprising nodes of the graph and edges of the graph, the redacted graph comprising nodes and edges of the graph exclusive of the portion to be redacted; determining that the portion of the graph to be redacted is identified in a series of at least four redaction stages; wherein at each redaction stage, of the series of at least four redaction stages, one or more respective nodes or one or more respective edges of the graph are identified for inclusion in the portion of the graph to be redacted according to a different user-selected redaction criterion of the different user-selected redaction criteria; and exporting a machine-readable representation of the redacted graph. 7. The system of claim 6 , wherein identifying a portion of the graph to be redacted and updating display of the graph in a computer graphical user interface to remove display of a redacted portion of the graph are performed in each redaction stage of the series of at least four redaction stages. 8. The system of claim 6 , wherein the machine-readable representation is exported with an ontology map of the redacted graph. 9. The system of claim 6 , wherein the machine-readable representation comprises a respective unique identifier for each distinct data object in the redacted graph. 10. The system of claim 6 , wherein the exporting a machine-readable representation of the redacted graph that comprises the graph exclusive of the portion of the graph includes generating and providing audit data to a person authorized to approve the exporting of the machine-readable representation. 11. A non-transitory storage media storing instructions which, when executed by a processor, cause: displaying, in a computer graphical user interface of a computing device, a graph comprising nodes and edges, each of the edges connecting two of the nodes, each of the nodes representing a distinct data object, each edge representing one or more relationships between two distinct data objects; automatically detecting redaction criteria based on metadata of the graph, the automatically detected redaction criteria comprising: an access control classification, a provenance identifier, a data object type, and a data object property type; receiving, via the graphical user interface, different user-selected redaction criteria from the automatically detected redaction criteria; identifying a portion of the graph to be redacted before a redacted graph is exported, the portion comprising nodes of the graph and edges of the graph, the redacted graph comprising nodes and edges of the graph exclusive of the portion to be redacted; determining that the portion of the graph to be redacted is identified in a series of at least four redaction stages; wherein at each redaction stage, of the series of at least four redaction stages, one or more respective nodes or one or more respective edges of the graph are identified for inclusion in the portion of the graph to be redacted according to a different user-selected redaction criterion of the different user-selected redaction criteria; and exporting a machine-readable representation of the redacted graph. 12. The non-transitory storage media of claim 11 , wherein identifying a portion of the graph to be redacted and updating display of the graph in a computer graphical user interface to remove display of a redacted portion of the graph are performed in each redaction stage of the series of at least four redaction stages. 13. The non-transitory storage media of claim 11 , wherein the machine-readable representation is exported with an ontology map of the redacted graph. 14. The non-transitory storage media of claim 11 , wherein the machine-readable representation comprises a respective unique identifier for each distinct data object in the redacted graph. 15. The non-transitory storage media of claim 11 , wherein the exporting a machine-readable representation of the redacted graph that comprises the graph exclusive of the portion of the graph includes generating and providing audit data to a person authorized to approve the
Drawing of charts or graphs · CPC title
specially adapted for file transfer, e.g. file transfer protocol [FTP] · CPC title
involving graphical user interfaces [GUIs] · CPC title
Creating or editing images; Combining images with text · CPC title
Interaction techniques to control parameter settings, e.g. interaction with sliders or dials · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.