Method and System for Generic Extraction of Business Object Data

• US 20090112908A1
• Filed: 10/30/2007
• Published: 04/30/2009
• Est. Priority Date: 10/30/2007
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Mueller, Martin, Wintel, Maic
• Granted Patent: US 8,577,837 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• 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

Systems, methods, and software for generic extraction of business object data are provided. One computerized method includes retrieving multiple identifiers of sub-nodes. The sub-nodes are associated with a root node of a business object. The method further includes generating a tree data structure. The tree includes multiple tree nodes and multiple tree edges. The multiple nodes correspond to the root node of the business object and the retrieved multiple identifiers. The method also includes traversing the tree to retrieve data associated with the root business object and the retrieved multiple identifiers. The method further includes storing the retrieved data.

Claims

1. A computer-implementable method, comprising:

retrieving a plurality of identifiers of sub-nodes based on a root node of a business object in a service-oriented architecture platform;

generating a tree data structure comprising a plurality of nodes and at least one edge, wherein the plurality of nodes correspond to the root node of the business object and the retrieved plurality of identifiers;

traversing the tree to retrieve data associated with the root business object node and the retrieved plurality of identifiers; and

storing the retrieved data.

2. The method of claim 1, wherein retrieving the plurality of identifiers comprises executing a method invoked within the root node, wherein the method returns identifiers of all sub-nodes that are to be replicated for the business object.

3. The method of claim 1, wherein generating the tree data structure comprises automatically determining the paths from the root node to each of the sub-nodes.

4. The method of claim 1, wherein traversing the tree comprises:

executing a retrieve method for each tree node of the plurality of tree nodes to retrieve data associated with the sub-node corresponding to each tree node; and

executing a retrieve by association method for each tree edge to retrieve a second plurality of identifiers of business object nodes, wherein each edge comprises a source node and a target node, and wherein the business object nodes are associated with the sub-node corresponding to the source node of the edge.

5. The method of claim 4, wherein the retrieve method and the retrieve by association method return data limited by a page size.

6. The method of claim 4 further comprising executing a retrieve method for each of the second plurality of identifiers.

7. The method of claim 1, wherein traversing the tree comprises retrieving data for a first identifier of the retrieved plurality of identifiers, and the method further comprises deleting at least one identifier used to locate the first identifier, wherein the at least one identifier is no longer needed.

8. The method of claim 1 further comprising receiving a request to replicate one or more business objects, wherein retrieving the plurality of identifiers comprises retrieving one or more plurality of identifiers corresponding to each of the one or more business objects, wherein generating the tree comprises generating one or more trees corresponding to each of the one or more business objects, and wherein traversing the tree comprises traversing each of the one or more trees.

9. The method of claim 1, wherein retrieving a plurality of identifiers of sub-nodes comprises retrieving a first subset of the plurality of identifiers of sub-nodes, wherein the first subset is based on a page size;

and retrieving a second subset of the plurality of identifiers of sub-nodes, wherein the second subset is based on the page size.

10. Software comprising computer-readable instruction embodied in a tangible medium that when executed by a processor is operable to:

retrieve a plurality of identifiers of sub-nodes based on a root node of a business object in a service-oriented architecture platform;

generate a tree data structure comprising a plurality of nodes and at least one edge, wherein the plurality of nodes correspond to the root node of the business object and the retrieved plurality of identifiers;

traverse the tree to retrieve data associated with the root business object node and the retrieved plurality of identifiers; and

store the retrieved data as an initial load.

11. The software of claim 10 further operable to execute a method invoked within the root node, wherein the method returns identifiers of all sub-nodes that are to be replicated for the business object.

12. The software of claim 10 further operable to determine the paths from the root node to each of the sub-nodes.

13. The software of claim 10 further operable to:

execute a retrieve method for each tree node of the plurality of tree nodes to retrieve data associated with the sub-node corresponding to each tree node; and

execute a retrieve by association method for each tree edge to retrieve a second plurality of identifiers of business object nodes, wherein each edge comprises a source node and a target node, and wherein the business object nodes are associated with the sub-node corresponding to the source node of the edge.

14. The software of claim 13, wherein the retrieve method and the retrieve by association method return data limited by a page size.

15. The software of claim 13 further operable to execute a retrieve method for each of the second plurality of identifiers.

16. The software of claim 10 further operable to:

retrieve data for a first identifier of the retrieved plurality of identifiers; and

delete at least one identifier used to locate the first identifier, wherein the at least one identifier is no longer needed.

17. The software of claim 10 further operable to:

receive a request to replicate one or more business objects;

retrieve one or more plurality of identifiers corresponding to each of the one or more business objects;

generate one or more trees corresponding to each of the one or more business objects; and

traverse each of the one or more trees to retrieve data associated with each of the one or more business objects.

18. The software of claim 10 further operable to:

retrieve a first subset of the plurality of identifiers of sub-nodes, wherein the first subset is based on a page size; and

retrieve a second subset of the plurality of identifiers of sub-nodes, wherein the second subset is based on the page size.

19. A system for managing a process, comprising:

memory storing one or more business objects; and

one or more processors communicatively coupled to the memory, operable to;

retrieve a plurality of identifiers of sub-nodes, wherein the sub-nodes are associated with a root node of one of the business objects;

generate a tree data structure comprising a plurality of tree nodes and a plurality of tree edges, wherein the plurality of nodes correspond to the root node of the particular business object and the retrieved plurality of identifiers;

traverse the tree to retrieve data associated with the root business object and the retrieved plurality of identifiers; and

store the retrieved data.

20. The system of claim 19 wherein the processor is further operable to:

execute a retrieve method for each tree node of the plurality of tree nodes to retrieve data associated with the sub-node corresponding to each tree node; and

execute a retrieve by association method for each tree edge to retrieve a second plurality of identifiers of business object nodes, wherein each edge comprises a source node and a target node, and wherein the business object nodes are associated with the sub-node corresponding to the source node of the edge.