System and method for data management

• US 8,326,813 B2
• Filed: 01/20/2010
• Issued: 12/04/2012
• Est. Priority Date: 01/20/2010
• Status: Active Grant

• Current Assignee: Siemens Industry Software Limited (Siemens AG)
• Original Assignee: Siemens Product Lifecycle Management Software Incorporated (Siemens AG)
• Inventors: Nizami, Javeed, Kaiser, Reiner K.
• Primary Examiner(s): Casanova, Jorge A
• Application Number:
  US12/690,188
• Publication Number:
  US 20110178998A1
• Time in Patent Office: 1,049 Days
• Field of Search: 707/610, 707/620, 707/702
• US Class Current: 707/702
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Abstract

A system, method, and computer program product for data transfer. The method includes receiving a request to transfer a principal object from a source location to a target location. The method also includes receiving at least one closure rule corresponding to the principal object, and transferring the principal object from the source location to be stored in the target location. The method also includes identifying at least one secondary object to be transferred with the principal object, according to the at least one closure rule. The method also includes selectively transferring the secondary object from the source location to be stored in the target location.

Claims

1. A method for data transfer, comprising:

receiving a request, in a data processing system, to transfer a principal object from a source location to a target location;

receiving at least one closure rule, in the data processing system, corresponding to the principal object;

transferring the principal object from the source location, by the data processing system, to be stored in the target location;

identifying, by the data processing system, at least one secondary object from the source location, other than the principal object, needed to be transferred with the principal object to avoid data corruption, according to the at least one closure rule, wherein the at least one closure rule defines a recursive clause for traversing a set of objects associated with the primary object at the source location to identify the at least one secondary object based on references between objects in the set of objects; and

selectively transferring the secondary object from the source location, by the data processing system, to be stored in the target location.

2. The method of claim 1, further comprising determining if the secondary object is already stored in the target location.

3. The method of claim 1, further comprising determining if a secondary object is already stored in the target location and is more recent than a secondary object stored in the primary location.

4. The method of claim 1, wherein the identifying and selectively transferring steps are repeated for a plurality of secondary objects.

5. The method of claim 1, wherein the at least one closure rule express object model dependencies for structure traversal and ownership considerations for the primary object in a codeless manner.

6. The method of claim 1, wherein the at least one closure rule defines what one or more secondary objects must be processed with the principal object to avoid the data corruption because of interdependencies between the principal object and the one or more secondary objects.

7. A data processing system comprising a processor and accessible memory, the data processing system particularly configured to perform the steps of:

receiving a request to transfer a principal object from a source location to a target location;

receiving at least one closure rule corresponding to the principal object;

transferring the principal object from the source location to be stored in the target location;

identifying at least one secondary object from the source location, other than the principal object, needed to be transferred with the principal object to avoid data corruption, according to the at least one closure rule, wherein the at least one closure rule defines a recursive clause for traversing a set of objects associated with the primary object at the source location to identify the at least one secondary object based on references between objects in the set of objects; and

selectively transferring the secondary object from the source location to be stored in the target location.

8. The data processing system of claim 7, further configured to perform the step of determining if the secondary object is already stored in the target location.

9. The data processing system of claim 7, further configured to perform the step of determining if a secondary object is already stored in the target location and is more recent than a secondary object stored in the primary location.

10. The data processing system of claim 7, wherein the identifying and selectively transferring steps are repeated for a plurality of secondary objects.

11. The data processing system of claim 7, wherein the at least one closure rule express object model dependencies for structure traversal and ownership considerations for the primary object in a codeless manner.

12. The data processing system of claim 7, wherein the at least one closure rule defines what one or more secondary objects must be processed with the principal object to avoid the data corruption because of interdependencies between the principal object and the one or more one secondary objects.

13. A non-transitory computer-readable storage medium encoded with computer-executable instructions that, when executed, cause a data processing system to perform the steps of:

receiving a request to transfer a principal object from a source location to a target location;

receiving at least one closure rule corresponding to the principal object;

transferring the principal object from the source location to be stored in the target location;

identifying at least one secondary object from the source location, other than the principal object, needed to be transferred with the principal object to avoid data corruption, according to the at least one closure rule, wherein the at least one closure rule defines a recursive clause for traversing a set of objects associated with the primary object at the source location to identify the at least one secondary object based on references between objects in the set of objects; and

selectively transferring the secondary object from the source location to be stored in the target location.

14. The computer-readable storage medium of claim 13, further including instructions to perform the step of determining if the secondary object is already stored in the target location.

15. The computer-readable storage medium of claim 13, further including instructions to perform the step of determining if a secondary object is already stored in the target location and is more recent than a secondary object stored in the primary location.

16. The computer-readable storage medium of claim 13, wherein the identifying and selectively transferring steps are repeated for a plurality of secondary objects.

17. The computer-readable storage medium of claim 13, wherein the at least one closure rule express object model dependencies for structure traversal and ownership considerations for the primary object in a codeless manner.

18. The computer-readable storage medium of claim 13, wherein the at least one closure rule defines what one or more secondary objects must be processed with the principal object to avoid the data corruption because of interdependencies between the principal object and the one or more secondary objects.