Preventing transfer and duplication of redundantly referenced objects across nodes of an application system

• US 8,290,904 B2
• Filed: 07/27/2009
• Issued: 10/16/2012
• Est. Priority Date: 07/27/2009
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Champlin, Jonathan David, Rheaume, Gary Paul, Curtis, John Douglas
• Primary Examiner(s): Thai, Hanh
• Application Number:
  US12/509,899
• Publication Number:
  US 20110022573A1
• Time in Patent Office: 1,177 Days
• Field of Search: 707/626, 707/770, 707/803
• US Class Current: 707/626
• CPC Class Codes: G06F 16/178 Techniques for file synchronisation in file systems

Abstract

Unique identifiers referred to as “keys” are generated for objects stored on each node. When a container object including at least one embedded object is transferred from a sending node to a receiving node, the sending node sends the key uniquely identifying the embedded object to the receiving node to determine whether the embedded object is already stored on the receiving node. If the receiving node indicates that the embedded object is already stored at the receiving node, then the sending node determines that the embedded object does not need to be sent to the receiving node. In that case, if the embedded object has not been sent, the sending node does not send the embedded object. If the sending node has already started sending the embedded object, then the sending node terminates sending of the embedded object.

Claims

1. A system comprising:

at least one computer readable memory, said computer readable memory having stored thereon program code for preventing transfer and duplication of redundantly referenced embedded objects across different nodes, said program code including

program code for generating a plurality of keys, each one of said keys identifying a corresponding one of a plurality of objects,

program code for, by a sending node to a receiving node responsive to determining that an embedded object is to be transferred from said sending node to a receiving node with a container object, transferring one of said keys corresponding to said embedded object from said sending node to said receiving node;

program code for determining, by said receiving node responsive to said one of said keys received from said sending node, whether said embedded object is already stored on said receiving node;

program code for, by said receiving node in response to determining that said embedded object is already stored on said receiving node, indicating to said sending node that said embedded object is already stored on said receiving node;

program code for, by said sending node in response to receiving said indication that said embedded object is already stored on said receiving node, preventing transfer of said embedded object from said sending node to said receiving node with said container object;

program code for incrementing, by said receiving node in response to said receiving node indicating to said sending node that said embedded object is already stored in said receiving node, a reference count associated with said embedded object in said receiving node;

program code for decrementing, by said receiving node, said reference count responsive to determining that an object containing said embedded object has been deleted; and

program code for deleting, by said receiving node, said embedded object responsive to said reference count being decremented to zero.

2. The system of claim 1, further comprising:

wherein said program code for generating said plurality of keys generates a key for each corresponding one of said plurality of objects responsive to said corresponding one of said plurality of objects being saved.

3. The system of claim 1, further comprising:

wherein said program code for generating said plurality of keys includes program code for applying a hash function to each corresponding one of said plurality of objects and wherein each one of said keys includes an output of said hash function applied to said corresponding one of said plurality of objects.

4. The system of claim 3, wherein each one of said keys further comprises metadata describing said corresponding one of said plurality of objects.

5. The system of claim 4, wherein said metadata includes a size of said corresponding one of said plurality of objects.

6. The system of claim 1, further comprising:

wherein said container object comprises an electronic mail message; and

wherein said embedded object comprises an attachment to said electronic mail message.

7. The system of claim 1, further comprising:

wherein said container object comprises a row in a relational database; and

wherein said embedded object comprises a binary large object (BLOB) contained in said row.

8. The system of claim 1, further comprising:

wherein said container object comprises an XML (eXtendsible Markup Language) document; and

wherein said embedded object comprises an data object within said XML document.

9. The system of claim 1, further comprising:

wherein said program code for sending one of said keys corresponding to said embedded object being transferred in said container object includes program code for sending said one of said keys corresponding to said embedded object together with an initial portion of said container object.

10. The system of claim 9, further comprising:

wherein said program code for preventing transfer of said embedded object from said sending node to said receiving node includes program code for stopping transfer of said embedded object after transfer of said embedded object has already started.

11. The system of claim 1, wherein said plurality of objects comprises a plurality of electronic documents.

12. The system of claim 1, further comprising:

wherein said sending node and said receiving node each comprise a computer system including at least one processor; and

wherein said sending node and said receiving node are interconnected by at least one computer network.

13. A computer program product, comprising:

at least one non-transitory computer readable storage medium, said computer readable storage medium having stored thereon program code for preventing transfer and duplication of redundantly referenced embedded objects across different nodes, said program code including

program code for generating a plurality of keys, each one of said keys identifying a corresponding one of a plurality of objects,

program code for, by a sending node to a receiving node responsive to determining that an embedded object is to be transferred from said sending node to said receiving node with a container object, transferring one of said keys corresponding to said embedded object from said sending node to said receiving node;

program code for determining, by said receiving node responsive to said one of said keys received from said sending node, whether said embedded object is already stored on said receiving node;

program code for, by said receiving node in response to determining that said embedded object is already stored on said receiving node, indicating to said sending node that said embedded object is already stored on said receiving node;

program code for, by said sending node in response to receiving said indication that said embedded object is already stored on said receiving node, preventing transfer of said embedded object from said sending node to said receiving node with said container object;

program code for incrementing, by said receiving node in response to said receiving node indicating to said sending node that said embedded object is already stored in said receiving node, a reference count associated with said embedded object in said receiving node;

program code for decrementing, by said receiving node, said reference count responsive to determining that an object containing said embedded object has been deleted; and

program code for deleting, by said receiving node, said embedded object responsive to said reference count being decremented to zero.

14. A computer-implemented method for preventing transfer and duplication of redundantly referenced embedded objects across different nodes, comprising:

generating a plurality of keys, each one of said keys identifying a corresponding one of a plurality of objects;

transferring, by a sending node to a receiving node responsive to determining that an embedded object is to be transferred from said sending node to said receiving node with a container object, one of said keys corresponding to said embedded object from said sending node to said receiving node;

determining, by said receiving node responsive to said one of said keys received from said sending node, whether said embedded object is already stored on said receiving node;

indicating, to said sending node by said receiving node in response to determining that said embedded object is already stored on said receiving node, that said embedded object is already stored on said receiving node;

preventing, by said sending node in response to receiving said indication that said embedded object is already stored on said receiving node, transfer of said embedded object from said sending node to said receiving node with said container object;

incrementing, by said receiving node responsive to said receiving node indicating to said sending node that said embedded object is already stored in said receiving node, a reference count associated with said embedded object in said receiving node;

decrementing, by said receiving node, said reference count responsive to determining that an object containing said embedded object has been deleted; and

deleting, by said receiving node, said embedded object responsive to said reference count being decremented to zero.

15. The method of claim 14, further comprising:

wherein said generating said plurality of keys includes generating a key for each corresponding one of said plurality of objects responsive to said corresponding one of said plurality of objects being saved.

16. The method of claim 14, further comprising:

wherein said generating said plurality of keys includes for applying a hash function to each corresponding one of said plurality of objects and wherein each one of said keys includes an output of said hash function applied to said corresponding one of said plurality of objects.

17. The method of claim 16, wherein each one of said keys further comprises metadata describing said corresponding one of said plurality of objects.

18. The method of claim 16, wherein said metadata includes a size of said corresponding one of said plurality of objects.

19. The method of claim 14, further comprising:

wherein said container object comprises an electronic mail message; and

wherein said embedded object comprises an attachment to said electronic mail message.

20. The method of claim 14, further comprising:

wherein said container object comprises a row in a relational database; and

wherein said embedded object comprises a binary large object (BLOB) contained in said row.

21. The method of claim 14, further comprising:

wherein said container object comprises an XML (eXtendsible Markup Language) document; and

wherein said embedded object comprises an data object within said XML document.

22. The method of claim 14, further comprising:

wherein said sending one of said keys corresponding to said embedded object being transferred in said container object includes sending said one of said keys corresponding to said embedded object together with an initial portion of said container object.

23. The method of claim 22, further comprising:

wherein said preventing transfer of said embedded object from said sending node to said receiving node includes stopping transfer of said embedded object after transfer of said embedded object has already started.