CN113239043B - Method and apparatus for efficient generation of unique values in a distributed system - Google Patents
Method and apparatus for efficient generation of unique values in a distributed system Download PDFInfo
- Publication number
- CN113239043B CN113239043B CN202110534496.0A CN202110534496A CN113239043B CN 113239043 B CN113239043 B CN 113239043B CN 202110534496 A CN202110534496 A CN 202110534496A CN 113239043 B CN113239043 B CN 113239043B
- Authority
- CN
- China
- Prior art keywords
- value
- data
- configuration rule
- coded data
- data structure
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000004891 communication Methods 0.000 claims description 3
- 230000006870 function Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 241000533950 Leucojum Species 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000023597 hemostasis Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2291—User-Defined Types; Storage management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24564—Applying rules; Deductive queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a method and equipment for efficiently generating unique values in a distributed system, wherein the method comprises the following steps: a request to generate a unique value is received, the request including encoded data. Obtaining a corresponding configuration rule in a data structure server or a relational database according to the coded data, wherein the configuration rule at least comprises: step size, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value. And configuring the coded data according to the configuration rule, so that the coded data obtains an initial value, increases the step length, and obtains a new prefix, a new suffix or a new middle special character. And then judging whether to output the configured value of the encoded data as a unique value according to the comparison result of the configured value of the encoded data and the value of the data structure server after the step size is increased. In the application, the high performance of the data structure server is integrated, the self-defined configuration rule is supported, the prefix, the suffix, the step length and the initial value are given to the unique value according to the configuration rule, the supported scene is wider and more flexible, and the usability and the stability are higher.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and apparatus for efficiently generating a unique value in a distributed system.
Background
At present, in the age of high concurrency and big data, the generation of global unique values in a distributed system scene is more and more important, and meanwhile, the requirements on efficiency and usability are also higher and higher. In the prior art, a Redis (data structure server) generates self-increment value, a self-increment primary key (sequence of Oracle and the like) of a database and ZK ordered nodes. Among them, the snowflake algorithm has the disadvantages: depending on the current currentTimeMillis values of the system, this requires that all machines must stay time consistent, or else ID collisions will occur; in the case of the distributed type, the distributed IDs cannot be sequentially generated, and are not suitable for being used as the primary key value of the database. Redis generates a self-added value disadvantage: limitation of persistence means may lead to loss of data; the added step length, initial value and ending value can not be configured, and the use is inconvenient. Disadvantages of the self-increasing primary key of the database: only the generated numerical value can not contain other special characters; the performance is relatively low compared to Redis. Disadvantages of ZK ordered nodes: only ordered consecutive values can be generated, other special characters cannot be contained, step sizes cannot be set, etc.
Disclosure of Invention
In order to overcome the problem that the global unique value cannot be generated in the distributed system to a certain extent in the related art at least, the application provides a method and equipment for generating the unique value in the distributed system.
The scheme of the application is as follows:
according to a first aspect of an embodiment of the present application, there is provided a method of efficiently generating a unique value in a distributed system, including:
Receiving a request for generating a unique value; the request comprises encoded data;
Acquiring corresponding configuration rules from a data structure server or a relational database according to the coded data; the configuration rule at least comprises: step length, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value;
configuring the coded data according to the configuration rule, so that the coded data obtains an initial value, increases a step length, and obtains a newly added prefix, a newly added suffix or a newly added middle special character;
Judging whether the value of the configured coded data is larger than the value of the data structure server after the step size is increased by the initial value;
If the value of the configured encoded data is not greater than the value of the data structure server initial value after the step length is increased, initializing the data structure server initial value to the value of the configured encoded data;
judging whether the value of the configured coded data is larger than the maximum value in the configuration rule, and if the value of the configured coded data is not larger than the maximum value in the configuration rule, returning to the value of the coded data after the current configuration and ending;
And if the configured value of the coded data is larger than the value obtained by increasing the step length of the initial value of the data structure server, returning to the current configured value of the coded data and ending.
Preferably, in an implementation manner of the present application, the obtaining, according to the encoded data, a corresponding configuration rule in a data structure server or a relational database specifically includes:
inquiring a corresponding configuration rule in the data structure server according to the coded data;
and if the data structure server does not have the corresponding configuration rule, inquiring and acquiring the corresponding configuration rule in the relational database.
Preferably, in one implementation manner of the present application, the method further includes:
and caching the configuration rules acquired in the relational database into the data structure server.
Preferably, in one implementation manner of the present application, the method further includes:
if the value of the configured coded data is larger than the maximum value in the configuration rule, the current operation is exited, the current operation is recorded as a special service, and then a special service processing prompt is carried out.
Preferably, in an implementation manner of the present application, the specific service processing reminding manner includes: mail and staples.
Preferably, in one implementation of the present application, after the returning the value of the encoded data after the current configuration, the method further includes:
Synchronizing the value of the encoded data after the current configuration to the relational database.
Preferably, in one implementation manner of the present application, the method further includes:
and updating the configuration rule in the relational database according to the value of the coded data after the current configuration.
Preferably, in one implementation manner of the present application, the method further includes:
If the corresponding configuration rule cannot be inquired and obtained in the relational database, directly ending
According to a second aspect of an embodiment of the present application, there is provided a method of efficiently generating a unique value in a distributed system, including:
A processor and a memory;
The processor is connected with the memory through a communication bus:
The processor is used for calling and executing the program stored in the memory;
The memory is configured to store a program for performing at least one of the methods of generating unique values in a distributed system.
The technical scheme provided by the application can comprise the following beneficial effects: the application discloses a method for efficiently generating unique values in a distributed system, which comprises the following steps: a request to generate a unique value is received, the request including encoded data. Acquiring corresponding configuration rules from a data structure server or a relational database according to the coded data; the configuration rules at least comprise: step size, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value. And configuring the coded data according to the configuration rule, so that the coded data obtains an initial value, increases the step length, and obtains a new prefix, a new suffix or a new middle special character. Comparing the configured value of the encoded data with the value of the data structure server after the initial value is increased by the step length, and initializing the initial value of the data structure server as the configured value of the encoded data if the configured value of the encoded data is not greater than the value of the data structure server after the initial value is increased by the step length; judging whether the configured value of the coded data is larger than the maximum value in the configuration rule, and if the configured value of the coded data is not larger than the maximum value in the configuration rule, returning the current configured value of the coded data as a unique value, outputting and ending. If the configured value of the encoded data is larger than the value of the data structure server after the initial value is increased by the step, returning the value of the encoded data after the current configuration as a unique value, outputting and ending. In the application, the high performance of the data structure server is integrated, the self-defined configuration rule is supported, the prefix, the suffix, the step length and the initial value are given to the unique value according to the configuration rule, the supported scene is wider and more flexible, and the usability and the stability are higher.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
FIG. 1 is a flow chart of a method for efficiently generating unique values in a distributed system according to one embodiment of the present application;
FIG. 2 is a flow chart of a method for efficiently generating unique values in a distributed system according to another embodiment of the present application;
FIG. 3 is a schematic diagram of an apparatus for efficiently generating unique values in a distributed system according to an embodiment of the present application.
Reference numerals: a processor-21; and a memory 22.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the accompanying claims.
A method of efficiently generating unique values in a distributed system, referring to fig. 1-2, comprising:
s11: receiving a request for generating a unique value; the request includes encoded data;
S12: acquiring corresponding configuration rules from a data structure server or a relational database according to the coded data; the configuration rules at least comprise: step length, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value;
the method comprises the steps of obtaining corresponding configuration rules from a data structure server or a relational database according to coded data, wherein the configuration rules comprise the following specific steps:
Inquiring a corresponding configuration rule in a data structure server according to the coded data;
if the data structure server does not have the corresponding configuration rule, inquiring and acquiring the corresponding configuration rule in the relational database.
If the corresponding configuration rule cannot be inquired and obtained in the relational database, the method is directly finished.
S13: configuring the coded data according to a configuration rule, so that the coded data obtains an initial value, increases a step length, and obtains a new prefix, a new suffix or a new middle special character;
for example, the rule for configuration is sku_% s_zto (where sku_ is prefix;%s is placeholder, indicating the last value plus the value after the step; ZTO is suffix).
S14: judging whether the value of the configured coded data is larger than the value of the data structure server after the step size is increased by the initial value;
S151: if the configured value of the encoded data is not greater than the value of the data structure server after the initial value is increased by the step length, initializing the initial value of the data structure server to be the configured value of the encoded data;
The initialization of the data structure server to the configured encoded data values is performed at the Redis data structure server primarily because the Redis data structure server is faster in performance than the relational database.
S16: judging whether the configured value of the coded data is larger than the maximum value in the configuration rule, and if the configured value of the coded data is not larger than the maximum value in the configuration rule, returning to the current configured value of the coded data and ending;
the maximum value (end value) is the maximum value configured in the configuration rule, and if the maximum value is larger than the end value, the rule needs to be reconfigured.
S152: if the configured value of the encoded data is larger than the value of the data structure server after the initial value is increased by the step length, returning to the current configured value of the encoded data and ending.
The application discloses a method for efficiently generating unique values in a distributed system, which comprises the following steps: a request to generate a unique value is received, the request including encoded data. Acquiring corresponding configuration rules from a data structure server or a relational database according to the coded data; the configuration rules at least comprise: step size, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value. And configuring the coded data according to the configuration rule, so that the coded data obtains an initial value, increases the step length, and obtains a new prefix, a new suffix or a new middle special character. Comparing the configured value of the encoded data with the value of the data structure server after the initial value is increased by the step length, and initializing the initial value of the data structure server as the configured value of the encoded data if the configured value of the encoded data is not greater than the value of the data structure server after the initial value is increased by the step length; judging whether the configured value of the coded data is larger than the maximum value in the configuration rule, and if the configured value of the coded data is not larger than the maximum value in the configuration rule, returning the current configured value of the coded data as a unique value, outputting and ending. If the configured value of the encoded data is larger than the value of the data structure server after the initial value is increased by the step, returning the value of the encoded data after the current configuration as a unique value, outputting and ending. In the application, the high performance of the data structure server is integrated, the self-defined configuration rule is supported, the prefix, the suffix, the step length and the initial value are given to the unique value according to the configuration rule, the supported scene is wider and more flexible, and the usability and the stability are higher.
The method for efficiently generating unique values in a distributed system in some embodiments further comprises:
And caching the configuration rules acquired in the relational database into a data structure server.
When the method is executed, the corresponding configuration rules are firstly queried in the data structure server according to the coded data, and the relationship database is queried only when no corresponding configuration rules exist in the data structure server, so that in the embodiment, the configuration rules acquired in the relationship database are cached in the data structure server, and the corresponding configuration rules are conveniently queried in the data structure server directly.
A method of efficiently generating unique values in a distributed system in some embodiments, referring to fig. 2, further comprises:
s17: if the configured value of the coded data is larger than the maximum value in the configuration rule, the current operation is exited, the current operation is recorded as a special service, and then special service processing reminding is carried out. And (5) carrying out special service processing reminding to directly finish.
Preferably, the special service processing reminding mode comprises the following steps: mail and staples. That is, the current operation will be recorded as a special service, which is sent to the worker's terminal through mail or nail.
Preferably, the special service processing reminding is performed asynchronously.
In some embodiments, a method for efficiently generating a unique value in a distributed system, referring to fig. 2, after returning a value of encoded data after current configuration, the method further includes:
And synchronizing the value of the coded data after the current configuration to a relational database.
Further, the configuration rules in the relational database are updated according to the values of the coded data after the current configuration.
Preferably, the values of the coded data after the current configuration are synchronized to the relational database, and the configuration rules in the relational database are updated to be performed asynchronously according to the values of the coded data after the current configuration.
Compared with the method for generating the global unique value by only using Redis and ZK in the prior art, the method for generating the unique value in the distributed system in high efficiency has higher availability. And can dynamically add prefix, suffix or some special characters in some positions in the middle, more configurable, the scene supported is wider, more flexible. Through the combination of the non-relational database, the relational database and the abnormal reminding, higher usability and configurability are ensured, hemostasis can be performed rapidly, and higher stability is also possessed.
A method of efficiently generating unique values in a distributed system, comprising:
A processor 21 and a memory 22;
The processor 21 is connected to the memory 22 via a communication bus:
Wherein the processor 21 is used for calling and executing the program stored in the memory 22;
a memory 22 for storing a program for performing at least one of the methods of any of the above embodiments for efficiently generating unique values in a distributed system.
It is to be understood that the same or similar parts in the above embodiments may be referred to each other, and that in some embodiments, the same or similar parts in other embodiments may be referred to.
It should be noted that in the description of the present application, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Furthermore, in the description of the present application, unless otherwise indicated, the meaning of "plurality" means at least two.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and further implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present application.
It is to be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.
Claims (9)
1. A method for efficiently generating unique values in a distributed system, comprising:
Receiving a request for generating a unique value; the request comprises encoded data;
Acquiring corresponding configuration rules from a data structure server or a relational database according to the coded data; the configuration rule at least comprises: step length, newly added prefix, newly added suffix, newly added middle special character, initial value, current length and maximum value;
configuring the coded data according to the configuration rule, so that the coded data obtains an initial value, increases a step length, and obtains a newly added prefix, a newly added suffix or a newly added middle special character;
Judging whether the value of the configured coded data is larger than the value of the data structure server after the step size is increased by the initial value;
If the value of the configured encoded data is not greater than the value of the data structure server initial value after the step length is increased, initializing the data structure server initial value to the value of the configured encoded data;
judging whether the value of the configured coded data is larger than the maximum value in the configuration rule, and if the value of the configured coded data is not larger than the maximum value in the configuration rule, returning to the value of the coded data after the current configuration and ending;
And if the configured value of the coded data is larger than the value obtained by increasing the step length of the initial value of the data structure server, returning to the current configured value of the coded data and ending.
2. The method according to claim 1, wherein the obtaining the corresponding configuration rule in the data structure server or the relational database according to the encoded data specifically includes:
inquiring a corresponding configuration rule in the data structure server according to the coded data;
and if the data structure server does not have the corresponding configuration rule, inquiring and acquiring the corresponding configuration rule in the relational database.
3. The method as recited in claim 2, further comprising:
and caching the configuration rules acquired in the relational database into the data structure server.
4. The method as recited in claim 1, further comprising:
if the value of the configured coded data is larger than the maximum value in the configuration rule, the current operation is exited, the current operation is recorded as a special service, and then a special service processing prompt is carried out.
5. The method of claim 4, wherein the special service handling alert mode comprises: mail and staples.
6. The method of claim 1, wherein after said returning the value of the encoded data after the current configuration, the method further comprises:
Synchronizing the value of the encoded data after the current configuration to the relational database.
7. The method as recited in claim 6, further comprising:
and updating the configuration rule in the relational database according to the value of the coded data after the current configuration.
8. The method of claim 2, further comprising:
If the corresponding configuration rule cannot be inquired and obtained in the relational database, the method is directly finished.
9. A method for efficiently generating unique values in a distributed system, comprising:
A processor and a memory;
The processor is connected with the memory through a communication bus:
The processor is used for calling and executing the program stored in the memory;
The memory for storing a program for performing at least one method of efficiently generating unique values in a distributed system according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110534496.0A CN113239043B (en) | 2021-05-17 | 2021-05-17 | Method and apparatus for efficient generation of unique values in a distributed system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110534496.0A CN113239043B (en) | 2021-05-17 | 2021-05-17 | Method and apparatus for efficient generation of unique values in a distributed system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113239043A CN113239043A (en) | 2021-08-10 |
| CN113239043B true CN113239043B (en) | 2024-05-03 |
Family
ID=77134673
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110534496.0A Active CN113239043B (en) | 2021-05-17 | 2021-05-17 | Method and apparatus for efficient generation of unique values in a distributed system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113239043B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114564739A (en) * | 2022-02-14 | 2022-05-31 | 浙江惠瀜网络科技有限公司 | Method and device for preventing illegal acquisition of index source code of coded file |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110457059A (en) * | 2019-06-28 | 2019-11-15 | 苏宁云计算有限公司 | A kind of sequence number generation method and device based on redis |
| CN110874308A (en) * | 2018-08-31 | 2020-03-10 | 北京京东尚科信息技术有限公司 | Method and device for generating unique value |
| CN111225073A (en) * | 2018-11-26 | 2020-06-02 | 北京京东尚科信息技术有限公司 | Service code distribution method and device, storage medium and computer system |
| CN111680103A (en) * | 2020-05-29 | 2020-09-18 | 成都新希望金融信息有限公司 | Method and device for generating ordered unique value by distributed database self-increment field |
| WO2021052029A1 (en) * | 2019-09-17 | 2021-03-25 | 苏宁云计算有限公司 | Data object identifier generation method and apparatus, computer device, and storage medium |
-
2021
- 2021-05-17 CN CN202110534496.0A patent/CN113239043B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110874308A (en) * | 2018-08-31 | 2020-03-10 | 北京京东尚科信息技术有限公司 | Method and device for generating unique value |
| CN111225073A (en) * | 2018-11-26 | 2020-06-02 | 北京京东尚科信息技术有限公司 | Service code distribution method and device, storage medium and computer system |
| CN110457059A (en) * | 2019-06-28 | 2019-11-15 | 苏宁云计算有限公司 | A kind of sequence number generation method and device based on redis |
| WO2021052029A1 (en) * | 2019-09-17 | 2021-03-25 | 苏宁云计算有限公司 | Data object identifier generation method and apparatus, computer device, and storage medium |
| CN111680103A (en) * | 2020-05-29 | 2020-09-18 | 成都新希望金融信息有限公司 | Method and device for generating ordered unique value by distributed database self-increment field |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113239043A (en) | 2021-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8189912B2 (en) | Efficient histogram storage | |
| CN113239043B (en) | Method and apparatus for efficient generation of unique values in a distributed system | |
| CN105264490A (en) | Apparatus and method to accelerate compression and decompression operations | |
| JP7494190B2 (en) | Techniques for updating files | |
| KR20030040567A (en) | Method of performing huffman decoding | |
| CN114253979B (en) | Message processing method and device and electronic equipment | |
| CN112702167B (en) | Cluster feature code obtaining method and device and electronic equipment | |
| JP5873925B2 (en) | Compression match enumeration | |
| WO2020024446A1 (en) | Data storage method and apparatus, storage medium, and computer device | |
| WO2011015199A1 (en) | Compression of bitmaps and values | |
| WO2024131990A1 (en) | Internet of things platform-based mass rule processing method, system and storage medium | |
| CN107798117B (en) | Data storage and reading method and device | |
| CN111651424B (en) | Data processing method, device, data node and storage medium | |
| CN104063377A (en) | Information processing method and electronic equipment using same | |
| US20200403850A1 (en) | Facilitating resilient and fault tolerant asynchronous messaging | |
| CN112929424A (en) | Gateway load balancing method, device, equipment and storage medium | |
| US9673836B1 (en) | System level testing of entropy encoding | |
| US11157189B2 (en) | Hybrid data reduction | |
| US9455742B2 (en) | Compression ratio for a compression engine | |
| CN116074308A (en) | Method, system, equipment and readable storage medium for downloading vehicle-end upgrade package | |
| CN110990640B (en) | Data determination method, device, equipment and computer readable storage medium | |
| CN113778948A (en) | Message persistent storage method and device | |
| CN113645261A (en) | Session data processing method, device, storage medium and computer equipment | |
| CN114756444A (en) | Calculation graph optimization method and device | |
| JPH07146810A (en) | Computer system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |