OBJECT PROCESSING

• US 20170154090A1
• Filed: 12/01/2015
• Published: 06/01/2017
• Est. Priority Date: 12/01/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Fang, Min
• Granted Patent: US 10,346,424 B2
• Time in Patent Office: Days
• 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
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

A computer-implemented method comprises composing a plurality of objects and a metadata object into a complex object at a first node. The metadata object refers to the plurality of objects in the complex object. The method further comprises transmitting the complex object to a second node.

Claims

1. A computer-implemented method, comprising:

generating a first metadata object including first metadata information referring to a first plurality of objects;

composing, at a first node, a first complex object including the first plurality of objects and the first metadata object; and

transmitting the first complex object from the first node to a second node.

2. The computer-implemented method according to claim 1, further comprising:

decomposing, at the second node, the first complex object into the first plurality of objects and a first decomposed metadata object at the second node.

3. The computer-implemented method according to claim 2, further comprising:

receiving a request, by the second node from the first node, for a requested object;

accessing, by the second node, the requested object to determine a second decomposed metadata object referred to by the requested object; and

generating, at the second node, a second complex object including the second decomposed metadata object and at least one object referred to by second metadata information included in the second decomposed metadata object.

4. The computer-implemented method according to claim 1, wherein:

the first metadata information included in the first metadata object includes a respective identifier for each object of the first plurality of objects, with each identifier being based, at least in part, on a logical block address of the respectively corresponding object and a size of the respectively corresponding object.

5. The computer-implemented method according to claim 1, wherein the first plurality of objects are composed into the first complex object based, at least in part, on a cold ranking which is based on a frequency at which the respectively corresponding object is accessed.

6. The computer-implemented method according to claim 1, further comprising:

determining, at the first node, a size of the first complex object based, at least in part, on dynamically changed throughput.

7. The computer-implemented method according to claim 6, wherein the determination of the size of the first complex object includes:

sending a plurality of complex objects with different sizes; and

choosing a size for the first complex object that will maximize throughput.

8. A computer program product comprising a computer readable storage medium having stored thereon:

first program instructions programmed to generate a first metadata object including first metadata information referring to a first plurality of objects;

second program instructions programmed to compose, at a first node, a first complex object including the first plurality of objects and the first metadata object; and

third program instructions programmed to transmit the first complex object from the first node to a second node.

9. The computer program product according to claim 8, further comprising:

fourth program instructions programmed to decompose, at the second node, the first complex object into the first plurality of objects and a first decomposed metadata object at the second node.

10. The computer program product according to claim 9, further comprising:

fifth program instructions programmed to receive a request, by the second node from the first node, for a requested object;

sixth program instructions programmed to access, by the second node, the requested object to determine a second decomposed metadata object referred to by the requested object; and

seventh program instructions programmed to generate, at the second node, a second complex object including the second decomposed metadata object and at least one object referred to by second metadata information included in the second decomposed metadata object.

11. The computer program product according to claim 8, wherein:

the first metadata information included in the first metadata object includes a respective identifier for each object of the first plurality of objects, with each identifier being based, at least in part, on a logical block address of the respectively corresponding object and a size of the respectively corresponding object.

12. The computer program product according to claim 8, wherein the first plurality of objects are composed into the first complex object based, at least in part, on a cold ranking which is based on a frequency at which the respectively corresponding object is accessed.

13. The computer program product according to claim 8, further comprising:

fourth program instructions programmed to determine, at the first node, a size of the first complex object based, at least in part, on dynamically changed throughput.

14. The computer program product according to claim 13, wherein the determination of the size of the first complex object includes:

fifth program instructions programmed to send a plurality of complex objects with different sizes; and

sixth program instructions programmed to choose a size for the first complex object that will maximize throughput.

15. A system comprising:

a processor(s) set; and

a computer readable storage medium;

wherein;

the processor set is structured, located, connected and/or programmed to run program instructions stored on the computer readable storage medium; and

the program instructions include;

first program instructions programmed to generate a first metadata object including first metadata information referring to a first plurality of objects;

second program instructions programmed to compose, at a first node, a first complex object including the first plurality of objects and the first metadata object; and

third program instructions programmed to transmit the first complex object from the first node to a second node.

16. The system according to claim 15, further comprising:

fourth program instructions programmed to decompose, at the second node, the first complex object into the first plurality of objects and a first decomposed metadata object at the second node.

17. The system according to claim 16, further comprising:

fifth program instructions programmed to receive a request, by the second node from the first node, for a requested object;

sixth program instructions programmed to access, by the second node, the requested object to determine a second decomposed metadata object referred to by the requested object; and

seventh program instructions programmed to generate, at the second node, a second complex object including the second decomposed metadata object and at least one object referred to by second metadata information included in the second decomposed metadata object.

18. The system according to claim 15, wherein:

the first metadata information included in the first metadata object includes a respective identifier for each object of the first plurality of objects, with each identifier being based, at least in part, on a logical block address of the respectively corresponding object and a size of the respectively corresponding object.

19. The system according to claim 15, wherein the first plurality of objects are composed into the first complex object based, at least in part, on a cold ranking which is based on a frequency at which the respectively corresponding object is accessed.

20. The system according to claim 15, further comprising:

fourth program instructions programmed to determine, at the first node, a size of the first complex object based, at least in part, on dynamically changed throughput.