Business network access protocol for the business network

A computer program product for providing access to business network data, the computer program product comprising computer readable instructions embodied on tangible, non-transitory media, the instructions operable when executed to:

• identify a logical graph from a set of linked graph data associated with a business network to be transformed into a resource graph, the logical graph including at least two nodes and at least one edge, each edge connecting a pair of nodes, the edge defining a connection between the pair of nodes;
• convert each identified node into a resource;
• and
• generate a resource graph associated with the identified logical graph, where generating the resource graph comprises, and for each identified node in the identified logical graph:
• associate at least one attribute associated with the identified node as a resource attribute of the corresponding resource;
• add at least one node connected to the identified node via an edge in the identified logical graph as a resource attribute of the corresponding resource associated with the identified node;
• and
• dissolve at least one connection between the identified node and at least one other entity in the logical graph.

A system comprising:

• one or more computers;
• and
• a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising:
• identifying a logical graph from a set of linked graph data associated with a business network to be transformed into a resource graph, the logical graph including at least two nodes and at least one edge, each edge connecting a pair of nodes, the edge defining a connection between the pair of nodes;
• converting each identified node into a resource;
• and
• generating a resource graph associated with the identified logical graph, where generating the resource graph comprises, and for each identified node in the identified logical graph:
• associating at least one attribute associated with the identified node as a resource attribute of the corresponding resource;
• adding at least one node connected to the identified node via an edge in the identified logical graph as a resource attribute of the corresponding resource associated with the identified node;
• and
• dissolving at least one connection between the identified node and at least one other entity in the logical graph.