CN120106832A - A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system - Google Patents
A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system Download PDFInfo
- Publication number
- CN120106832A CN120106832A CN202510559420.1A CN202510559420A CN120106832A CN 120106832 A CN120106832 A CN 120106832A CN 202510559420 A CN202510559420 A CN 202510559420A CN 120106832 A CN120106832 A CN 120106832A
- Authority
- CN
- China
- Prior art keywords
- value
- sequence
- service
- serial number
- payment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
- G06Q20/108—Remote banking, e.g. home banking
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the field of bank financial data processing, and discloses a device and a method for generating a serial number of high concurrent payment flow of a bank distributed payment system, wherein the device comprises a central database and a program memory, the central database stores an ordered list, and the ordered list comprises service names and corresponding sequence values; the service name, the machine ID, the timestamp of the sequence table and the serial number smaller than the maximum value generated in the program memory are called by the program memory, then the splice generation of the serial number of the payment flow is completed, and the scheme not only meets the requirements of uniqueness, order, resolution and traceability of the payment flow, but also improves the serial number generation efficiency.
Description
Technical Field
The invention relates to the field of bank financial data processing, in particular to a method and a device for generating a serial number of high-concurrency payment running water of a bank distributed payment system.
Background
In the existing bank financial science and technology payment field, for financial transactions, a payment running serial number is generally required to be used for identifying and searching a financial transaction, for a distributed payment system with high concurrency and large transaction amount, repeated running, disorder and difficult discrimination often occur, so that the system is abnormal and the problem of searching financial running records of business personnel is caused, and the existing method for generating the running serial number on the market mainly comprises the following modes:
1. The time stamping method uses a time stamp accurate to millisecond as a serial number of the pipeline, such as a simple time stamping method, and when a plurality of machines access at the same time and have high concurrency, the repetition problem can occur.
2. The database self-increment ID creates a self-increment field in the database that is incremented automatically whenever a new record is inserted. The method is simple and easy to implement, but in a distributed environment, the cross-database and the cross-server are needed to be considered, because the generation of the database self-increment ID depends on a counter in a single database, in a distributed system, database instances of different nodes cannot directly share and coordinate the value of the counter, and therefore, conflict can occur.
3. The UUID method, UUID, is a 128-bit numerical value, typically expressed as 32 hexadecimal digits, divided into 5 segments, in forms such as { xxxxxxx-xxxx-xxxx-xxxxxxxxxxx }. The UUID is composed of a time stamp, a clock sequence and a hardware address, almost can guarantee uniqueness in the global scope, but lacks of order, is not easy to distinguish, and is not suitable for being used as a running water of banking business.
4. The atomic incrementer method uses thread-safe atomic variables to generate an incremented pipeline sequence number. This applies only to stand-alone environments, but requires a global coordinator to manage the incremental operations in the distributed system, increasing the waste of system resources.
5. The ID is generated based on Snowflake algorithm, snowflake algorithm is a distributed ID generation algorithm developed by Twitter, and the generated ID is a 64-bit integer including a time stamp, a data center ID, a machine ID and a serial number.
The Snowflake algorithm is highly dependent on the system time stamp. If the system time of the server is callback, i.e., the system time is back-up, it may result in the generation of duplicate IDs. For example, when system time dials back from T to T-1, the algorithm may regenerate the ID that has been previously generated.
Six, the random number generator generates a running water serial number, and the running water serial number is generated through a random number generator random, wherein the random number generator is essentially a pseudo-random number generator, and the generated random number sequence is calculated through a specific algorithm and seed. In a distributed system, if multiple nodes use the same algorithm and seed, or are initialized in a short time, the same random number sequence may be generated, resulting in a repetition of the running water sequence number.
All the methods are not suitable for the generation mode of serial numbers under the condition that bank payment running water has high concurrency, so that a serial number generation mode for identifying unique transactions and payment running water is needed for a distributed payment system to meet the requirements of uniqueness, ordering, distinguishing and traceability of the payment running water.
Disclosure of Invention
The invention aims to provide a method and a device for generating serial numbers of high-concurrency payment running water of a bank distributed payment system, which are used for realizing the generation of serial numbers for identifying unique transactions and payment running water of the distributed payment system.
In order to achieve the purpose, the invention adopts the following technical scheme that the method for generating the serial number of the high-concurrency payment running water of the bank distributed payment system comprises the following steps:
S1, establishing a sequence table in a central database, wherein the sequence table comprises a plurality of service names and sequence values corresponding to the service names;
S2, according to different payment services, the sequence value of the corresponding payment service is called in stages from the sequence table, the sequence value is stored into a program memory as a starting value, a quantity value is set in the program memory, the sum of the quantity value and the starting value is calculated to form a node value, and the node value is also stored into the program memory;
S3, acquiring a machine ID of the current application;
S4, acquiring a time stamp of the current system;
S5, when a payment task sends a request for adding a running water serial number, firstly taking a starting value as a serial value required by the running water serial number in a program memory, and when the task needs a new running water serial number, accumulating one by one on the basis of the starting value to form a new serial value;
And S6, splicing the service name in the step S1, the machine ID in the step S3, the time stamp in the step S4 and the sequence value in the step S5 to form a serial number of the running water, and sending the serial number to a payment task for use.
The principle and the advantages of the scheme are that in practical application, as the distributed payment system is to split each functional system into different service modules, the requirement on data consistency is higher, the serial numbers in the method are completed through splicing, each spliced part has independent meaning, so that the serial numbers are well recognized, and the serial numbers belonging to the same service part in the distributed system are recognized by using the same serial number.
In addition, the sequence number spliced by the scheme comprises a service name, a machine ID, a time stamp and a sequence value, so that the possibility of repeated sequence numbers is greatly reduced. Can completely meet the use of the current high concurrency serial number.
Finally, due to the high concurrency characteristic of the payment system, a large number of transactions exist in the same time period, each service type is named independently, a sequence value is assigned to each service type, and a plurality of service types and corresponding sequence values are stored in a central database through a table. Therefore, the sequence value of the service in the sequence table can be selected according to different services, so that the sequence value can be generated under the condition that each service is not interfered with each other.
In the process of generating a sequence value of a serial number of the stream, the scheme designs an independent sequence value for each service, and various types of sequence values are stored in a central database. When the calculation is performed, the data is called from the database through the program memory, and after the calculation of the program memory is completed, the result is stored into the central database. However, the program memory has a limited memory data, although it has a high computing power. In the case of high concurrency, for example, a method of calling database data every time a serial number is generated, then storing the result into a central database, generating the serial number next time and cycling is adopted. This not only increases the computer resource consumption of the data interaction process, but above all may lead to queuing of traffic under high concurrency demands.
The design of the method is ingenious in that the number of serial numbers generated in one stage is set in the program memory, the program memory in each stage only calls data into the database once, and the serial values needed in one stage are sequentially generated in the program memory in an accumulation mode. In order to prevent the sequence value from repeating, the maximum sequence value generated in one stage in the program memory, namely the node value of the application, is sent to the central database, and the sequence value is updated once in the central database in one stage. The updating sequence value and the generating sequence value of the program memory in the central database are independently completed, so that the generation of the sequence number can be quickened, and the data in the central database does not need to be frequently called. The method saves the computing resources of the computer, finally improves the sequence number generation efficiency, and solves the problem that the sequence numbers cannot be generated in time due to high concurrency.
Preferably, in step S1, the service name is a custom string, the sequence value is a positive integer, the initial value of the sequence value is 1, the service name is directly in the form of a string, the artificial readability of the sequence number is increased, the service type can be directly known from the meaning of the string, and the sequence value is in the form of a positive integer, so that the calculation difficulty of the program memory is simplified.
Preferably, the service names can be increased or decreased according to service requirements in the sequence table, the sequence values corresponding to each service name are not interfered with each other, and the service names are not allowed to be identical character strings.
When the payment system is running, new business is generated, and a row of names and sequence values which are used as the new business can be directly added into the sequence table. And the maintenance convenience of a later-stage software system is improved.
Preferably, in step S2, the number value is 100×n, n being an integer greater than or equal to 1;
Preferably, in step S3, the machine ID of the current application is acquired through a hostname command.
Preferably, in step S4, the current system timestamp is obtained using date tool DateUtil, accurate to milliseconds, and the date formatted as a number.
Preferably, in step S5, if a request for adding a running sequence number is issued by a plurality of tasks of the same service type, each task sequentially calls a sequence value from the sequence table to a respective program memory, wherein the sequence value called by the next task is a sequence value formed by adding a number value to the sequence value called by the last task, and each task independently outputs a sequence value required by the running sequence number of the task in the program memory.
The method has the advantages that when multiple same-kind services need to call the sequence values, the services do not need to be distinguished, the sequence value updated by the last service can be called by each service in sequence according to the preset quantity value of each service, and only the node value of the last service is finally stored in the database. The multiple same-kind services can independently complete the generation of the sequence value in the own program memory, so that the data in the database is prevented from being frequently called, and the calculated amount of the database is increased.
Preferably, in step S5, the sequence value part in the running sequence number is a fixed number of bits, the sequence value is less than the fixed number of bits, 0 is added to the left side of the sequence value, and when the number of bits of the sequence value exceeds the fixed number of bits, the corresponding sequence value in the database is reset to 1. And the accuracy of serial number output is ensured through unifying serial number formats.
Preferably, in step S5, when the service needs a new running sequence number, after each generation of the sequence value, it is determined whether the next generated sequence value is equal to the node value, if so, the service repeats steps S2 and S3, and the new start value and the node value are cached in the program memory of the service.
The method has the beneficial effects that the generation of the sequence value of only one stage can be completed in the program memory of each service, so that in order to prevent the error of the generated sequence number, whether the next generated sequence value is equal to the node value or not needs to be judged after each generation of the sequence value.
In order to finish the generation of the whole payment serial number, the application provides a payment serial number generation device, which is used for executing the steps of a high concurrent payment serial number generation method, and comprises a central database and a program memory, wherein the central database is used for storing a sequence table, and the sequence table stores and changes service names and sequence values corresponding to the service names; the program memory is used for calling the service name and the sequence value in the sequence table, calling the machine ID of the current payment service and calling the timestamp of the current system, and an executable program of the spliced payment serial number is stored in the program memory.
Drawings
Fig. 1 is a flowchart illustrating steps of a payment serial number generation method according to embodiment 1 of the present invention.
Fig. 2 is a schematic diagram of a payment pipelining serial number generating device according to embodiment 2 of the present invention.
Fig. 3 is a schematic diagram of a sequence table and a program memory data updating method according to embodiment 1 of the present invention.
Fig. 4 is a schematic diagram of the structure of a sequence table in embodiment 1 of the present invention.
Detailed Description
The following is a further detailed description of the embodiments:
the reference numerals in the drawings of the specification comprise a central database 1, a sequence table 2, a service server 3, a program memory 4, a calling service 5 and a sequence number splicing module 6.
Example 1
A method for generating serial numbers of high concurrent payment flows of a distributed payment system of banks as shown in figures 1 and 2 comprises the following steps of S1, establishing a sequence table in a central database, wherein the sequence table comprises various service names and sequence values corresponding to the service names.
S2, according to different payment services, the sequence value of the corresponding payment service is called in stages from the sequence table, the sequence value is stored into a program memory as a starting value, a quantity value is set in the program memory, the sum of the quantity value and the starting value is calculated to form a node value, the node value is also stored into the program memory, meanwhile, the node value is used as a new sequence value of the service name in the sequence table, and the quantity value is an integer of 100 x N, and N is more than or equal to 1.
And S3, acquiring the machine ID of the current application, and acquiring the machine ID of the current application through a hostname command.
S4, acquiring a time stamp of the current system, acquiring the time stamp of the current system by using a date tool DateUtil, and formatting the date into a number after accurate millisecond.
S5, when a payment task sends out a request for adding the serial number of the stream, the initial value is firstly used as a serial value required by the serial number of the stream in a program memory, and when the task needs a new serial number of the stream, the new serial values are accumulated one by one on the basis of the initial value.
The sequence value part in the serial number of the running water is a fixed bit number, in this embodiment, six bits are selected, less than six bits of sequence value is added with 0 at the left side of the sequence value, and when the bit number of the sequence value exceeds six bits, the corresponding sequence value in the database is reset to 1.
And S6, splicing the service name in the step S1, the machine ID in the step S3, the time stamp in the step S4 and the sequence value in the step S5 to form a serial number of the running water, and sending the serial number to a payment task for use.
In step S1, as shown in fig. 4, the service names are custom character strings, the sequence values are positive integers, the initial values of the sequence values are 1, the service names can be increased or decreased according to the service requirements in the sequence table, the sequence values corresponding to each service name are not interfered with each other, and the service names are not allowed to be the same character strings.
As shown in FIG. 3, the number value of each time is selected to be 500, in step S5, if a request for adding the running sequence number is sent by a plurality of tasks of the same service type, each task sequentially calls the sequence value from the sequence table to the respective program memory, the sequence value called for the first time by the first task is "1", the node value stored in the program memory of the task is "501", and at most 500 sequence values can be generated in the program memory. At this time, the sequence value in the sequence table is updated to 501, and when the sequence value is called by the next task, the sequence value is formed by adding the sequence value called by the last task and the number value, and each task independently outputs the sequence value required by the serial number of the task flow in the program memory.
When multiple same-kind services need to call sequence values, the services do not need to be distinguished, the sequence value updated by the last service can be sequentially called by each service according to the preset quantity value of each service, and only the node value of the last service is finally stored in a database. The multiple same-kind services can independently complete the generation of the sequence value in the own program memory, so that the data in the database is prevented from being frequently called, and the calculated amount of the database is increased.
In step S5, when the service needs a new running sequence number, after each generation of the sequence value, it is required to determine whether the next generated sequence value is equal to the node value, if so, the service repeats steps S2 and S3, and the new start value and the node value are cached in the program memory of the service.
Example 2
As shown in fig. 2, the payment running serial number generating device is used for executing the steps of the high-concurrency payment running serial number generating method, and comprises a central database 1, a program memory 4 and a serial number splicing module 6, wherein the central database 1 stores an ordered list 2, service names and serial numbers corresponding to the service names are stored and changed in the ordered list 2, the program memory 4 calls the service names and the serial numbers in the ordered list 2 through a calling service 5, the calling service 5 also calls a machine ID of a current processing service server 3 and invokes a timestamp of the current service server 3, the program memory 4 calculates continuously available serial numbers, and the serial number splicing module 6 stores an executable program for splicing the payment running serial numbers.
In the process of generating a sequence value of a serial number of the stream, the scheme designs an independent sequence value for each service, and various types of sequence values are stored in a central database. When the calculation is performed, the data is called from the database through the program memory, and after the calculation of the program memory is completed, the result is stored into the central database. However, the program memory has a limited memory data, although it has a high computing power. In the case of high concurrency, for example, a method of calling database data every time a serial number is generated, then storing the result into a central database, generating the serial number next time and cycling is adopted. This not only increases the computer resource consumption of the data interaction process, but above all may lead to queuing of traffic under high concurrency demands.
In this embodiment, the number of serial numbers generated in one stage is set in the program memory, the program memory in each stage only calls data into the database once, and the serial values required in the stage are sequentially generated in the program memory in an accumulation mode.
In order to prevent the sequence value from repeating, the maximum sequence value generated in the stage in the program memory, namely the node value of the application, is sent to the central database, and in one stage, the sequence value is updated only once in the central database, so that the computing resource of a computer is saved. The sequence table updating sequence value and the program memory generating sequence value are independently completed, so that the generation of the sequence number can be quickened, and the data in the central database does not need to be frequently called. The method saves the computing resources of the computer, finally improves the sequence number generation efficiency, and solves the problem that the sequence numbers cannot be generated in time due to high concurrency.
The foregoing is merely exemplary of the present application, and specific technical solutions and/or features that are well known in the art have not been described in detail herein. It should be noted that, for those skilled in the art, several variations and modifications can be made without departing from the technical solution of the present application, and these should also be regarded as the protection scope of the present application, which does not affect the effect of the implementation of the present application and the practical applicability of the patent. The protection scope of the present application is subject to the content of the claims, and the description of the specific embodiments and the like in the specification can be used for explaining the content of the claims.
Claims (10)
1. A method for generating serial numbers of high concurrent payment flows of a bank distributed payment system is characterized by comprising the following steps,
S1, establishing a sequence table in a central database, wherein the sequence table comprises names of various services and sequence values corresponding to the names of the various services;
S2, according to the development type of the payment service, the sequence value corresponding to the service is called in stages from the sequence table, the sequence value is used as a starting value and is stored into a program memory, a quantity value is set in the program memory, the sum of the quantity value and the starting value is calculated to form a node value, and the node value is also stored into the program memory;
S3, acquiring a machine ID of the current application;
S4, acquiring a time stamp of the current system;
S5, when a payment task sends out a request for adding a running water serial number, in a program memory, firstly outputting a starting value as a serial value required by the running water serial number, and when the task needs a new running water serial number, accumulating one by one on the basis of the starting value to form a new serial value for outputting;
and S6, splicing the service name in the step S1, the machine ID in the step S3, the time stamp in the step S4 and the sequence value in the step S5 to form a serial number of the running water, and sending the serial number to the corresponding service for use.
2. The method of claim 1, wherein in step S1, the service name is a custom string, the sequence value is a positive integer, and the initial value of the sequence value is 1.
3. The method for generating the serial number of the high-concurrency payment stream according to claim 1, wherein the sequence list can increase or decrease service names according to service requirements, the sequence values corresponding to each service name are not interfered with each other, and the service names are not allowed to be identical character strings.
4. The method of claim 1, wherein in step S2, the number is an integer having a value of 100 x N, N≥1.
5. The method for generating a high-concurrency payment pipeline serial number according to claim 1, wherein in step S3, the machine ID of the current application is acquired through a hostname command.
6. The method for generating a serial number for high-concurrency payment according to claim 1, wherein in step S4, the current system time stamp is obtained by using a date tool DateUtil, accurate to millisecond and the date is formatted as a number.
7. The method for generating a serial number of high-concurrency payment according to claim 1, wherein in step S5, if a request for adding the serial number of the pipelining is issued by a plurality of tasks of the same business type, each task sequentially calls a sequence value from a sequence table to a respective program memory, the sequence value called by the next task is a sequence value formed by adding the number value to the sequence value called by the last task, and each task independently outputs the sequence value.
8. The method of claim 7, wherein in step S5, the sequence value in the serial number is partially a fixed number of bits, less than the fixed number of bits, 0 is added to the left of the sequence value, and when the number of bits of the sequence value exceeds the fixed number of bits, the corresponding sequence value in the database is reset to 1.
9. The method of generating a serial number for high concurrent payment according to claim 8, wherein in step S5, when a service needs a new serial number, each time a serial value is output, it is determined whether the next generated serial value is equal to a node value, and if so, the service repeats steps S2 and S3, and the new start value and the node value are cached in a program memory of the service.
10. A payment running water serial number generating device is used for executing the steps of the high-concurrency payment running water serial number generating method described in any one of 1-9, and is characterized by comprising a central database and a program memory, wherein the central database stores an ordered list, service names and sequence values corresponding to the service names are stored and changed in the ordered list, the program memory is used for calling the service names and the sequence values in the ordered list, calling a machine ID (identity) of a current payment service and calling a time stamp of the current system, and an executable program for splicing the payment running water serial numbers is stored in the program memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202510559420.1A CN120106832A (en) | 2025-04-30 | 2025-04-30 | A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202510559420.1A CN120106832A (en) | 2025-04-30 | 2025-04-30 | A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN120106832A true CN120106832A (en) | 2025-06-06 |
Family
ID=95877534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202510559420.1A Pending CN120106832A (en) | 2025-04-30 | 2025-04-30 | A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN120106832A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020112139A1 (en) * | 2001-02-13 | 2002-08-15 | Krause Michael R. | Highly available, monotonic increasing sequence number generation |
| CN112860661A (en) * | 2021-01-20 | 2021-05-28 | 上海悦易网络信息技术有限公司 | Method and device for generating data sequence identification |
| CN113722323A (en) * | 2021-08-30 | 2021-11-30 | 康键信息技术（深圳）有限公司 | Service serial number generation method, sender assembly, equipment and storage medium |
| CN114282968A (en) * | 2021-12-22 | 2022-04-05 | 中国农业银行股份有限公司 | A method, device, server and storage medium for obtaining serial number |
| CN116483892A (en) * | 2023-05-04 | 2023-07-25 | 平安付科技服务有限公司 | Method and device for generating serial numbers, computer equipment and readable storage medium |
-
2025
- 2025-04-30 CN CN202510559420.1A patent/CN120106832A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020112139A1 (en) * | 2001-02-13 | 2002-08-15 | Krause Michael R. | Highly available, monotonic increasing sequence number generation |
| CN112860661A (en) * | 2021-01-20 | 2021-05-28 | 上海悦易网络信息技术有限公司 | Method and device for generating data sequence identification |
| CN113722323A (en) * | 2021-08-30 | 2021-11-30 | 康键信息技术（深圳）有限公司 | Service serial number generation method, sender assembly, equipment and storage medium |
| CN114282968A (en) * | 2021-12-22 | 2022-04-05 | 中国农业银行股份有限公司 | A method, device, server and storage medium for obtaining serial number |
| CN116483892A (en) * | 2023-05-04 | 2023-07-25 | 平安付科技服务有限公司 | Method and device for generating serial numbers, computer equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112507027B (en) | Kafka-based incremental data synchronization method, device, equipment and medium | |
| KR101959153B1 (en) | System for efficient processing of transaction requests related to an account in a database | |
| CN108647357B (en) | Data query method and device | |
| CN106886371B (en) | Caching data processing method and device | |
| CN102968339B (en) | System and method for realizing complicated event handling based on cloud computing architecture | |
| CN111984677B (en) | Resource data checking method, device, computer equipment and storage medium | |
| CN113419823A (en) | Alliance chain system suitable for high-concurrency affairs and design method thereof | |
| WO2021139778A1 (en) | System scheduling workflow generation method, system, apparatus, and computer readable storage medium | |
| US11144536B2 (en) | Systems and methods for real-time analytics detection for a transaction utilizing synchronously updated statistical aggregation data | |
| CN112905339A (en) | Task scheduling execution method, device and system | |
| CN114283010A (en) | Multi-main-chain cross-chain method based on multi-main-chain two-layer network state tree | |
| CN112099973B (en) | Service calling method and device | |
| JP5090193B2 (en) | System, method, and program for synchronizing multi-source spread data | |
| CN111651522B (en) | Data synchronization method and device | |
| CN111400283B (en) | Data processing method, system, electronic equipment and storage medium | |
| CN115617924A (en) | Financial data processing method, device, equipment and storage medium | |
| CN109871394B (en) | Full-distributed high-concurrency calculation method and device | |
| CN114625712A (en) | Data synchronization method and device, electronic equipment and storage medium | |
| CN112182005B (en) | Method and device for generating serial numbers | |
| CN114996210A (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN120106832A (en) | A method and device for generating high-concurrency payment flow sequence numbers in a bank distributed payment system | |
| CN114168607A (en) | Global serial number generation method, apparatus, apparatus, medium and product | |
| CN114780432B (en) | Interface testing method, device, equipment and storage medium | |
| CN113886108B (en) | Dot data calling method and device, electronic equipment and storage medium | |
| CN115729978A (en) | Serial number generation method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |