# US 10,872,070 B2 · Distributed data processing > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,872,070 B2 - Document ID: US10872070B2 - Status: Granted - Kind: B2 - Application number: 16/800,641 - Filed: 2020-02-25 - Published: 2020-06-18 - Granted: 2020-12-22 - Earliest claimed: 2015-05-04 - Assignees: Advanced New Technologies Co., Ltd. - Applicants: Advanced New Technologies Co., Ltd. - Inventors: Min Han - Web page: https://patentgrep.com/patent/US10872070B2 ## CPC - G06F 16/2272: {Management thereof} - G06F 16/24539: {using cached or materialised query results} - G06F 7/08: Sorting, i.e. grouping record carriers in numerical or other ordered sequence according to the classification of at least some of the information they carry (by merging two or more sets of carriers in ordered sequence G06F7/16) - G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor - G06F 16/28: Databases characterised by their database models, e.g. relational or object models - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A method for distributed data processing includes selecting a first number of candidate key-value pairs from input key-value pairs stored in a distributed file system and identifying an invocation frequency for each of the first number of candidate key-value pairs in a predetermined period of time. The invocation frequency is a number of times the corresponding candidate key-value pair was called by a service system in the predetermined period of time. The method further includes selecting a second number of hot key-value pairs from the candidate key-value pairs based on the invocation frequencies of the candidate key-value pairs, mapping the second number of hot key-value pairs to intermediate key-value pairs, and reducing the intermediate key-value pairs to resultant key-value pairs to be called by the service system. ## Claims ### Claim 1 A computer-implemented method, comprising: identifying an invocation frequency for each of a first number of candidate key-value pairs in a predetermined period of time, wherein the invocation frequency is a number of times the corresponding candidate key-value pair was called by a service system in the predetermined period of time; selecting a second number of hot key-value pairs from the candidate key-value pairs, wherein the hot key-value pairs comprise at least one of: candidate key-value pairs that have invocation frequencies higher than a predetermined threshold, or candidate key-value pairs with key values within a key value interval; mapping, as intermediate key-value pairs, the second number of hot key-value pairs; and reducing, as resultant key-value pairs, the intermediate key-value pairs, wherein the resultant key-value pairs are to be called by the service system. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein the first number of candidate key-value pairs is randomly selected from input key-value pairs stored in a distributed file system. ### Claim 3 (depends on 1) The computer-implemented method of claim 1, further comprising: determining a service type of a service provided by the service system; determining one or more key types based on the service type; and selecting key-value pairs with the one or more key types as the first number of candidate key-value pairs. ### Claim 4 (depends on 1) The computer-implemented method of claim 1, wherein selecting a second number of hot key-value pairs further comprises: sorting the candidate key-value pairs based on their corresponding invocation frequencies; and selecting the second number of hot key-value pairs based on the sorted candidate key-value pairs that have invocation frequencies higher than a predetermined threshold. ### Claim 5 (depends on 1) The computer-implemented method of claim 1, wherein selecting a second number of hot key-value pairs further comprises: determining a distribution of invocation frequencies of the candidate key-value pairs; determining one or more key value intervals as filtering conditions for selecting the hot key-value pairs based on a predetermined frequency threshold; and selecting candidate key-value pairs with key values within the one or more key value intervals as hot key-value pairs. ### Claim 6 (depends on 5) The computer-implemented method of claim 5, wherein the one or more key value intervals are related to key values of the same key type, and wherein corresponding key-value pairs within the one or more key value intervals have a total invocation frequency greater than the predetermined frequency threshold. ### Claim 7 (depends on 5) The computer-implemented method of claim 5, wherein the one or more key value intervals are related to key values of one or more key types, and wherein corresponding key-value pairs within the one or more key value intervals have a total invocation frequency greater than the predetermined frequency threshold. ### Claim 8 (depends on 1) The computer-implemented method of claim 1, further comprising: mapping non-hot key-value pairs to intermediate key-value pairs when the non-hot key-value pairs are called by the service system; and reducing the intermediate key-value pairs to resultant key-value pairs. ### Claim 9 A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising: identifying an invocation frequency for each of a first number of candidate key-value pairs in a predetermined period of time, wherein the invocation frequency is a number of times the corresponding candidate key-value pair was called by a service system in the predetermined period of time; selecting a second number of hot key-value pairs from the candidate key-value pairs, wherein the hot key-value pairs comprise at least one of: candidate key-value pairs that have invocation frequencies higher than a predetermined threshold, or candidate key-value pairs with key values within a key value interval; mapping, as intermediate key-value pairs, the second number of hot key-value pairs; and reducing, as resultant key-value pairs, the intermediate key-value pairs, wherein the resultant key-value pairs are to be called by the service system. ### Claim 10 (depends on 9) The non-transitory, computer-readable medium of claim 9, wherein the first number of candidate key-value pairs is randomly selected from input key-value pairs stored in a distributed file system. ### Claim 11 (depends on 9) The non-transitory, computer-readable medium of claim 9, wherein the operations further comprise: determining a service type of a service provided by the service system; determining one or more key types based on the service type; and selecting key-value pairs with the one or more key types as the first number of candidate key-value pairs. ### Claim 12 (depends on 9) The non-transitory, computer-readable medium of claim 9, wherein selecting a second number of hot key-value pairs further comprises: sorting the candidate key-value pairs based on their corresponding invocation frequencies; and selecting the second number of hot key-value pairs based on the sorted candidate key-value pairs that have invocation frequencies higher than a predetermined threshold. ### Claim 13 (depends on 9) The non-transitory, computer-readable medium of claim 9, wherein selecting a second number of hot key-value pairs further comprises: determining a distribution of invocation frequencies of the candidate key-value pairs; determining one or more key value intervals as filtering conditions for selecting the hot key-value pairs based on a predetermined frequency threshold; and selecting candidate key-value pairs with key values within the one or more key value intervals as hot key-value pairs. ### Claim 14 (depends on 13) The non-transitory, computer-readable medium of claim 13, wherein the one or more key value intervals are related to key values of the same key type, and wherein corresponding key-value pairs within the one or more key value intervals have a total invocation frequency greater than the predetermined frequency threshold. ### Claim 15 (depends on 13) The non-transitory, computer-readable medium of claim 13, wherein the one or more key value intervals are related to key values of one or more key types, and wherein corresponding key-value pairs within the one or more key value intervals have a total invocation frequency greater than the predetermined frequency threshold. ### Claim 16 (depends on 9) The non-transitory, computer-readable medium of claim 9, wherein the operations further comprise: mapping non-hot key-value pairs to intermediate key-value pairs when the non-hot key-value pairs are called by the service system; and reducing the intermediate key-value pairs to resultant key-value pairs. ### Claim 17 A computer-implemented system, comprising: one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising: identifying an invocation frequency for each of a first number of candidate key-value pairs in a predetermined period of time, wherein the invocation frequency is a number of times the corresponding candidate key-value pair was called by a service system in the predetermined period of time; selecting a second number of hot key-value pairs from the candidate key-value pairs, wherein the hot key-value pairs comprise at least one of: candidate key-value pairs that have invocation frequencies higher than a predetermined threshold, or candidate key-value pairs with key values within a key value interval; mapping, as intermediate key-value pairs, the second number of hot key-value pairs; and reducing, as resultant key-value pairs, the intermediate key-value pairs, wherein the resultant key-value pairs are to be called by the service system. ### Claim 18 (depends on 17) The computer-implemented system of claim 17, wherein the first number of candidate key-value pairs is randomly selected from input key-value pairs stored in a distributed file system. ### Claim 19 (depends on 17) The computer-implemented system of claim 17, wherein the operations further comprise: determining a service type of a service provided by the service system; determining one or more key types based on the service type; and selecting key-value pairs with the one or more key types as the first number of candidate key-value pairs. ### Claim 20 (depends on 17) The computer-implemented system of claim 17, wherein selecting a second number of hot key-value pairs further comprises: sorting the candidate key-value pairs based on their corresponding invocation frequencies; and selecting the second number of hot key-value pairs based on the sorted candidate key-value pairs that have invocation frequencies higher than a predetermined threshold.