Granted Patent B2

US 12,743,407 · App. 18/315,530 · Granted Sep 22, 2026

Inventor: Ke Du (Xi'An, CN)

Assignee: International Business Machines Corporation

G06F16/2246G06F16/2365

Abstract

Claims (47)

1 . A computer-implemented method for processing data in a data format with key-value pairs, comprising:

extracting all keys from a plurality of data objects, wherein duplicated keys are removed such that only one of a same key remains;

reorganizing the data in the data format into a format with a key portion followed by a value portion, wherein the extracted keys are arranged in the key portion in a predetermined order, and the values of each of the plurality of data objects are arranged in the value portion in an order corresponding to the order of the keys;

grouping the values corresponding to each of the extracted keys for the plurality of data objects into a respective value group, wherein the respective value groups are arranged in respective value partitions of the value portion in the order corresponding to the order of the keys;

determining a reused part shared by the values of different data objects of the plurality of data objects, wherein the reused part of the values sharing the reused part in the value portion is replaced by a reference to the reused part, wherein the value portion comprises a reused-part partition in which the reused part is arranged in a position corresponding to a reference to the reused part;

arranging all respective value groups in a value portion in an order corresponding to an order of the keys, such that a consistent order is used for the keys and values, wherein the reused part is arranged in the reused-part partition as one of a list of reused parts shared by the values of the different data objects; and

compressing data into a reorganized data format with the key portion followed by a value portion.

2 . The computer-implemented method of claim 1 , wherein the respective value groups are arranged in the value portion in the order corresponding to the order of the keys.

3 . The computer-implemented method of claim 1 , wherein the reference to the reused part comprises the position of the reused part within the list of the reused-part partition.

4 . The computer-implemented method of claim 1 , wherein the value partitions of the value portion following the reused-part partition, wherein the reused part of the values sharing the reused part in a respective value partition is replaced by the reference to the reused part.

5 . The computer-implemented method of claim 1 , further comprising:

identifying one of the keys of the plurality of data objects of the data based on a search keyword;

determining a search range within the value portion corresponding to the identified key based on the order of the keys; and

searching for the search keyword within the search range corresponding to the identified key.

6 . The computer-implemented method of claim 1 , wherein the predetermined order for the extracted keys is an order of traversing leaf nodes of a tree structure of the data in the data format with key-value pairs.

7 . The computer-implemented method of claim 1 , further comprising: storing the data in the reorganized format.

8 . The computer-implemented method of claim 1 , further comprising: data format comprises JavaScript Object Notation (JSON).

9 . A computer system for processing data in a data format with key-value pairs, comprising:

one or more computer processors, one or more computer-readable storage media, and program instructions stored on the one or more of the computer-readable storage media for execution by at least one of the one or more processors, wherein the computer system is capable of performing a method comprising:

extracting all keys from a plurality of data objects, wherein duplicated keys are removed such that only one of a same key remains;

reorganizing the data in the data format into a format with a key portion followed by a value portion, wherein the extracted keys are arranged in the key portion in a predetermined order, and the values of each of the plurality of data objects are arranged in the value portion in an order corresponding to the order of the keys;

grouping the values corresponding to each of the extracted keys for the plurality of data objects into a respective value group, wherein the respective value groups are arranged in respective value partitions of the value portion in the order corresponding to the order of the keys;

determining a reused part shared by the values of different data objects of the plurality of data objects, wherein the reused part of the values sharing the reused part in the value portion is replaced by a reference to the reused part; determining a reused part shared by the values of different data objects of the plurality of data objects, wherein the reused part of the values sharing the reused part in the value portion is replaced by a reference to the reused part, wherein the value portion comprises a reused-part partition in which the reused part is arranged in a position corresponding to a reference to the reused part;

arranging all respective value groups in a value portion in an order corresponding to an order of the keys, such that a consistent order is used for the keys and values wherein the reused part is arranged in the reused-part partition as one of a list of reused parts shared by the values of the different data objects; and

compressing data into a reorganized data format with the key portion followed by a value portion.

10 . The computer system of claim 9 , wherein the respective value groups are arranged in the value portion in the order corresponding to the order of the keys.

11 . The computer system of claim 9 , wherein the reference to the reused part comprises the position of the reused part within the list of the reused-part partition.

12 . The computer system of claim 9 , wherein the reused part of the values sharing the reused part in a respective value partition is replaced by the reference to the reused part.

13 . The computer system of claim 9 , further comprising:

identifying one of the keys of the plurality of data objects of the data based on a search keyword;

determining a search range within the value portion corresponding to the 1 identified key based on the order of the keys; and

searching for the search keyword within the search range corresponding to the identified key.

14 . The computer system of claim 9 , wherein the predetermined order for the extracted keys is an order of traversing leaf nodes of a tree structure of the data in the data format with key-value pairs.

15 . The computer system of claim 9 , further comprising: storing the data in the reorganized format.

16 . The computer system of claim 9 , further comprising: data format comprises JavaScript Object Notation (JSON).

17 . A computer program product for processing data in a data format with key-value pairs, the computer program product comprising:

one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions executable by a computing system to cause the computing system to perform a method comprising:

extracting all keys from a plurality of data objects, wherein duplicated keys are removed such that only one of a same key remains;

reorganizing the data in the data format into a format with a key portion followed by a value portion, wherein the extracted keys are arranged in the key portion in a predetermined order, and the values of each of the plurality of data objects are arranged in the value portion in an order corresponding to the order of the keys;

grouping the values corresponding to each of the extracted keys for the plurality of data objects into a respective value group, wherein the respective value groups are arranged in respective value partitions of the value portion in the order corresponding to the order of the keys;

determining a reused part shared by the values of different data objects of the plurality of data objects, wherein the reused part of the values sharing the reused part in the value portion is replaced by a reference to the reused part determining a reused part shared by the values of different data objects of the plurality of data objects, wherein the reused part of the values sharing the reused part in the value portion is replaced by a reference to the reused part, wherein the value portion comprises a reused-part partition in which the reused part is arranged in a position corresponding to a reference to the reused part;

arranging all respective value groups in a value portion in an order corresponding to an order of the keys, such that a consistent order is used for the keys and values wherein the reused part is arranged in the reused-part partition as one of a list of reused parts shared by the values of the different data objects; and

compressing data into a reorganized data format with the key portion followed by a value portion.

18 . The computer program product of claim 17 , further comprising:

identifying one of the keys of the plurality of data objects of the data based on a search keyword;

determining a search range within the value portion corresponding to the identified key based on the order of the keys; and

searching for the search keyword within the search range corresponding to the identified key.

Assignments (1)

Continuity (1)

References Cited (18)