Data collaboration between different entities

Patent metadata

Field	Value
Publication number	US-12386496-B2
Application number	US-202217738459-A
Country	US
Kind code	B2
Filing date	May 6, 2022
Priority date	Aug 25, 2015
Publication date	Aug 12, 2025
Grant date	Aug 12, 2025

Abstract

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.

First claim

What is claimed is:

1. A method comprising:
importing, by a computing device, a redacted graph comprising nodes and edges and at least one access control classification,
each of the edges connecting two of the nodes,
each of the nodes representing a distinct data object,
the redacted graph being redacted based on the at least one access control classification, each edge representing one or more relationships between two distinct data objects;
redacting the at least one access control classification and assigning a new access control classification in an absence of the at least one access control classification to the redacted graph;
determining that one or more nodes of the redacted graph represent same data objects represented by nodes in a current graph stored on the computing device;
performing data deconfliction on the one or more nodes of the redacted graph and corresponding nodes in the current graph, comprising:
comparing the one or more nodes of the redacted graph to the corresponding nodes in the current graph;
when the one or more nodes of the redacted graph and the corresponding nodes in the current graph represent concurrent versions, comparing data object properties of the one or more nodes to data object properties of the corresponding nodes to determine whether values of the data object properties contain conflicting values;
when the values of the data object properties from the one or more nodes and the corresponding nodes contain conflicting values, causing displaying, in a computer graphical user interface, the conflicting values for the data object properties of the one or more nodes and the corresponding nodes;
receiving a selection of a particular data value from the conflicting values associated with a particular data object property of a particular node belonging to either the one or more nodes or the corresponding nodes; and
assigning the particular data value associated with the particular data object property as deconflicted data for the particular node;
updating the corresponding nodes in the current graph to contain the deconflicted data based on the one or more nodes of the redacted graph; and
causing displaying, in the computer graphical user interface of the computing device, the current graph with updated corresponding nodes,
wherein the method is performed by one or more processors.

2. The method of claim 1 , wherein determining that the one or more nodes of the redacted graph represent the same data objects represented by nodes in the current graph comprises:
comparing the nodes of the redacted graph to the nodes of the current graph; and determining that the one or more nodes of the redacted graph and one or more nodes of the current graph represent the same data objects based on data object properties of the nodes of the redacted graph and the nodes in the current graph.

3. The method of claim 1 , wherein
when the one or more nodes of the redacted graph and the corresponding nodes in the current graph represent different versions of the same data objects, selecting nodes that represent a most recent version.

4. The method of claim 3 , wherein selecting the nodes that represent the most recent version is based on timestamp values or vector clocks associated with the one or more nodes of the redacted graph and the corresponding nodes in the current graph.

5. The method of claim 1 , further comprising:
when the values of the data object properties form the one or more nodes and the corresponding nodes do not contain conflicting values, combining the values of the data object properties from the one or more nodes and the corresponding nodes to represent deconflicted data for the corresponding nodes in the current graph.

6. The method of claim 1 , further comprising, upon performing the data deconfliction on the one or more nodes of the redacted graph and the corresponding nodes in the current graph, maintaining copies of conflicted changes associated with the corresponding nodes in the current graph.

7. The method of claim 1 , further comprising:
wherein access control classifications associated with the nodes in the redacted graph have been redacted prior to receiving the redacted graph;
receiving, via the computer graphical user interface, access control input assigning a new access control classification to a particular node of the corresponding nodes in the current graph; and
assigning the new access control classification to the particular node.

8. 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:
importing a redacted graph comprising nodes and edges and at least one access control classification,
each of the edges connecting two of the nodes,
each of the nodes representing a distinct data object,
the redacted graph being redacted based on the at least one access control classification, each edge representing one or more relationships between two distinct data objects;
redacting the at least one access control classification and assigning a new access control classification in an absence of the at least one access control classification to the redacted graph;
determining that one or more nodes of the redacted graph represent same data objects represented by nodes in a current graph stored on the computer system;
performing data deconfliction on the one or more nodes of the redacted graph and corresponding nodes in the current graph, comprising:
comparing the one or more nodes of the redacted graph to the corresponding nodes in the current graph;
when the one or more nodes of the redacted graph and the corresponding nodes in the current graph represent concurrent versions, comparing data object properties of the one or more nodes to data object properties of the corresponding nodes to determine whether values of the data object properties contain conflicting values;
when the values of the data object properties from the one or more nodes and the corresponding nodes contain conflicting values, causing displaying, in a computer graphical user interface, the conflicting values for the data object properties of the one or more nodes and the corresponding nodes;
receiving a selection of a particular data value from the conflicting values associated with a particular data object property of a particular node belonging to either the one or more nodes or the corresponding nodes; and
assigning the particular data value associated with the particular data object property as deconflicted data for the particular node;
updating the corresponding nodes in the current graph to contain the deconflicted data based on the one or more nodes of the redacted graph; and
causing displaying, in the computer graphical user interface, the current graph with updated corresponding nodes.

9. The computer system of claim 8 , wherein determining that the one or more nodes of the redacted graph represent the same data objects represented by nodes in the current graph comprises:
comparing the nodes of the redacted graph to the nodes of the current graph; and determining that the one or more nodes of the redacted graph and one or more nodes of
the current graph represent the same data objects based on data object properties of the nodes of the redacted graph and the nodes in the current graph.

10. The computer system of claim 8 , wherein
when the one or more nodes of the redacted graph and the corresponding nodes in the current graph represent different versions of the same data objects, selecting nodes that represent a most recent version.

11. The computer system of claim 10 , wherein selecting the nodes that represent

Assignees

• Palantir Technologies Inc

Inventors

• Dennis Graham
• Taylor Timothy
• Lear Kimberley
• Rickard Jesse
• Balding Dyon
• Pitelka Hunter
• Leblanc David
• Shanks Vaughan
• Davies Joel
• Merten Steffen
• Cook Christopher
• Male Christopher
• Barker Marc

Classifications

• G06T11/26 Primary

  Drawing of charts or graphs · CPC title

• G06T2200/24

  involving graphical user interfaces [GUIs] · CPC title

• G06T11/60

  Creating or editing images; Combining images with text · CPC title

• H04L67/10

  in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title

• H04L67/06

  specially adapted for file transfer, e.g. file transfer protocol [FTP] · CPC title