Generic Bijection With Graphs

• US 20090177680A1
• Filed: 01/04/2008
• Published: 07/09/2009
• Est. Priority Date: 01/04/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Newport, William Thomas, Johnson, Chris D.
• Granted Patent: US 8,161,000 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence

Abstract

A method, apparatus and program product is provided for accessing data in an abstract data store. In response to receiving a key value, an object is created by converting the key value into a key tuple. A value tuple is requested from the abstract data store corresponding to the key tuple. The key tuple and value tuple are converted to the object by a projector, which then stores the object on an object graph. An object is saved to the abstract data store by persisting the object onto the object graph. The object is detected on the object graph by the projector. In response to detecting the object, the object is converted to a key tuple and a value tuple by the projector. The object graph is then synchronized with the abstract data store by pushing the key and value tuples to the abstract data store.

Claims

1. A method of accessing data in an abstract data store to create an object, the method comprising, in response to receiving a key value:

converting the key value into a key tuple;

requesting a value tuple from the abstract data store corresponding to the key tuple;

converting the key tuple and value tuple to the object by a projector; and

storing the object on an object graph by the projector.

2. The method of claim 1 wherein the object is a first object, the method further comprising:

checking the key and value tuple for relationships to other entities; and

in response to finding a relationship;

converting a key value for the relationship into a key tuple,

requesting a value tuple from the abstract data store corresponding to the key tuple,

converting the key tuple and value tuple to a second object by the projector,

storing the second object on the object graph by the projector, and

defining an object reference between the first object and the second object.

3. The method of claim 2 further comprising:

checking the key and value tuple of the second object for relationships to other entities; and

in response to finding a relationship;

converting a key value for the relationship into a key tuple,

requesting a value tuple from the abstract data store corresponding to the key tuple,

converting the key tuple and value tuple to a third object by the projector,

storing the third object on the object graph by the projector, and

defining an object reference between the second object and the third object.

4. The method of claim 1 wherein requesting a value tuple from the abstract data store comprises:

checking the abstract data store for an existence of the key tuple;

in response to not finding the key tuple, returning a null value; and

in response to finding the key tuple, returning the corresponding value tuple.

5. The method of claim 1 wherein the projector communicates with a CRUD layer on top of the abstract data store.

6. A method of accessing data in an abstract data store to save an object, the method comprising:

persisting the object onto an object graph;

detecting the object on the object graph by a projector;

in response to detecting the object, converting the object to a key tuple and a value tuple by the projector; and

synchronizing the object graph with the abstract data store by pushing the key and value tuples to the abstract data store.

7. The method of claim 6 wherein the projector communicates with a CRUD layer on top of the abstract data store.

8. The method of claim 6 wherein synchronizing the object graph with the abstract data store comprises:

checking for the existence of the key and value tuples in the abstract data store; and

in response to finding the key and value tuples in the abstract data store, updating the value tuple in the abstract data store.

9. The method of claim 6 wherein synchronizing the object graph with the abstract data store comprises:

checking for the existence of the key and value tuples in the abstract data store; and

in response to not finding the key and value tuples in the abstract data store, creating the key tuple and the value tuple in the abstract data store.

10. The method of claim 6 wherein synchronizing the object graph with the abstract data store comprises:

removing the object from the object graph; and

checking for the existence of the key and value tuples in the abstract data store;

in response to finding the key and value tuples in the abstract data store, removing the key and value tuples from the abstract data store.

11. An apparatus comprising:

a processor; and

program code configured to be executed by the processor for accessing data in an abstract data store to save an object, the program code configured to persist the object onto an object graph, detect the object on the object graph by a projector, convert the object to a key tuple and a value tuple by the projector in response to detecting the object, and synchronize the object graph with the abstract data store by pushing the key and value tuples to the abstract data store.

12. The apparatus of claim 11 wherein the projector communicates with a CRUD layer on top of the abstract data store.

13. The apparatus of claim 11 wherein the program code is configured to synchronize the object graph with the abstract data store by:

checking for the existence of the key and value tuples in the abstract data store; and

in response to finding the key and value tuples in the abstract data store, updating the value tuple in the abstract data store.

14. The apparatus of claim 11 wherein the program code is configured to synchronize the object graph with the abstract data store by:

checking for the existence of the key and value tuples in the abstract data store; and

in response to not finding the key and value tuples in the abstract data store, creating the key tuple and the value tuple in the abstract data store.

15. The apparatus of claim 11 wherein the program code is configured to synchronize the object graph with the abstract data store by:

removing the object from the object graph; and

checking for the existence of the key and value tuples in the abstract data store;

in response to finding the key and value tuples in the abstract data store, removing the key and value tuples from the abstract data store.

16. A program product, comprising:

a computer readable medium; and

a program code configured for accessing data in an abstract data store to create an object, the program code resident on the computer readable medium and configured to convert the key value into a key tuple, request a value tuple from the abstract data store corresponding to the key tuple, convert the key tuple and value tuple to the object by a projector, and store the object on an object graph by the projector.

17. The program product of claim 16 wherein the object is a first object and the program code further configured to check the key and value tuple for relationships to other entities, and in response to finding a relationship, convert a key value for the relationship into a key tuple, request a value tuple from the abstract data store corresponding to the key tuple, convert the key tuple and value tuple to a second object by the projector, store the second object on the object graph by the projector, and define an object reference between the first object and the second object.

18. The program product of claim 17 wherein the program code further configured to check the key and value tuple of the second object for relationships to other entities, and in response to finding a relationship, convert a key value for the relationship into a key tuple, request a value tuple from the abstract data store corresponding to the key tuple, convert the key tuple and value tuple to a third object by the projector, store the third object on the object graph by the projector, and define an object reference between the second object and the third object.

19. The program product of claim 16 wherein the program code is configured to request the value tuple from the abstract data store by:

checking the abstract data store for an existence of the key tuple;

in response to not finding the key tuple, returning a null value; and

in response to finding the key tuple, returning the corresponding value tuple.

20. The program product of claim 16 wherein the projector communicates with a CRUD layer on top of the abstract data store.