CN101976241A - Method and system for generating identification code - Google Patents
Method and system for generating identification code Download PDFInfo
- Publication number
- CN101976241A CN101976241A CN 201010291998 CN201010291998A CN101976241A CN 101976241 A CN101976241 A CN 101976241A CN 201010291998 CN201010291998 CN 201010291998 CN 201010291998 A CN201010291998 A CN 201010291998A CN 101976241 A CN101976241 A CN 101976241A
- Authority
- CN
- China
- Prior art keywords
- characters
- character
- length
- character string
- identification code
- 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.)
- Granted
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method for generating an identification code. The method comprises the following steps of: (S104) generating a first character string with a first length according to a universal algorithm of a universal unique identification code; (S104) removing a linking character in the first character string and changing the first character string with the first length into a second character string with a second length; and (S106) grouping and compressing characters in the second character string with the second length, and splicing the compressed characters to generate a third character string with a third length, wherein the third character string is an identification code. The invention also provides an identification code generation system. According to the technical scheme, the identification code generation system and the method can be realized, which not only can guarantee that the identification code generated in a distributed system has uniqueness, but also can effectively reduce the byte number occupied by the identification code so as to save the storage space and guarantee the data storage efficiency, and too much network flow cannot be increased.
Description
Technical field
The present invention relates to the identification code treatment technology, relate in particular to a kind of identification code and generate method and system.
Background technology
In the software systems based on the relevant database technology, usually, each tables of data need be come unique sign line item with an ID, such as each production order in the ERP system a unique sign can be arranged all.
The main method that exists two big classes to produce unique ID in the system in the software product in the market:
(1) adopt the mode of UUID (Universally Unique Identifier, general unique identifier) to produce a globally unique identification code.The advantage of this method is that disclosed algorithm has been arranged, and a lot of senior development languages itself provide corresponding kit, can guarantee that the ID that produces in distributed environment has uniqueness, and operational efficiency is also than higher.Shortcoming is that UUID is made up of 36 characters, and length is excessive, and it is more to take storage space, in large-scale Database Systems, can influence the efficient of data access, for the WEB system, it is also bigger to transmit a large amount of flows that this type of ID produced on the network, and then has influence on the speed of websites response.
(2) application program is used certain algorithm according to the customizing messages of software runtime environment, and oneself produces a unique identifier that depends on the specific run environment.The advantage of this method is the ID length controlled that produces, and shortcoming is the ID uniqueness in total system especially distributed system that is difficult to guarantee generation, needs usually during operation to consider some relevant informations, and often operational efficiency is also lower.
Therefore, need a kind of identification code generating mode, can either guarantee to have uniqueness, can effectively reduce the shared byte number of ID again at the ID that distributed system produces, conserve storage, the efficient of assurance data storage is unlikely to increase too many network traffics.
Summary of the invention
In view of more than, technical scheme of the present invention technical matters to be solved is, provide a kind of identification code to generate method and system, can either guarantee to have uniqueness at the ID that distributed system produces, can effectively reduce the shared byte number of ID again, conserve storage, the efficient of assurance data storage is unlikely to increase too many network traffics.
The invention provides a kind of identification code generating method, comprising: step S102 generates first character string of first length according to general unique identifier general-purpose algorithm; Step S 104, remove the link symbol in described first character string, described first character string of described first length become second character string of second length; Step S106 divides into groups the character in described second character string of described second length, compress, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.By this technical scheme, can generate the existing uniqueness identification code of conserve storage again, guarantee the efficient of data storage.
In technique scheme, preferably, in described step S102, described first length is 36 characters.
In technique scheme, preferably, in described step S104, described link symbol is "-".
In technique scheme, preferably, described second length is 32 characters, the 3rd length is 22 characters, and described step S106 is specially: step S1062 is divided into 11 groups with described 32 characters, wherein, the 1st group is 2 characters, and all the other 10 groups are respectively 3 characters; Step S1064 compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression; Step S1066 splices the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.By this technical scheme, can reduce the length of character string, saved storage space.
In technique scheme, preferably, described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems, described step S1064 is specially: use 64 characters to describe 64 system numerical value, wherein said 64 characters comprise: #$0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqr stuvwxyz, and described 64 characters are arranged according to the order of ASCII character; Three character development of evil in febrile disease of 16 systems are become the numeral of 10 systems, and the numerical range after the conversion is 0 to 16
3According to the numeral of above-mentioned 10 systems, producing length is the character string of 64 systems of 2 characters.
The present invention also provides a kind of identification code generation system, comprising: the first character string generation module generates first character string of first length according to general unique identifier general-purpose algorithm; The second character string generation module is removed the link symbol in described first character string, described first character string of described first length is become second character string of second length; Three-character doctrine is concatenated into module, the character in described second character string of described second length is divided into groups, compresses, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.By this technical scheme, can generate the existing uniqueness identification code of conserve storage again, guarantee the efficient of data storage.
In technique scheme, preferably, described first length is 36 characters, and described link symbol is "-"; Described second length is 32 characters, and the 3rd length is 22 characters.
In technique scheme, preferably, three-character doctrine is concatenated into module and is comprised: grouping module, described 32 characters are divided into 11 groups, and wherein, the 1st group is 2 characters, all the other 10 groups are respectively 3 characters; Compression module compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression; Concatenation module is spliced the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.By this technical scheme, can reduce the length of character string, saved storage space.
In technique scheme, preferably, described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems.
Pass through technique scheme, can realize that a kind of identification code generates method and system, can either guarantee to have uniqueness at the ID that distributed system produces, can effectively reduce the shared byte number of ID again, conserve storage, guarantee the efficient of data storage, be unlikely to increase too many network traffics.
Description of drawings
Fig. 1 is the process flow diagram of identification code generating method according to an embodiment of the invention;
Fig. 2 is the block diagram of identification code generation system according to still another embodiment of the invention; And
Fig. 3 is the processing flow chart of identification code generating method according to still another embodiment of the invention.
Embodiment
In order more to be expressly understood above-mentioned purpose of the present invention, feature and advantage, the present invention is further described in detail below in conjunction with the drawings and specific embodiments.
Set forth a lot of details in the following description so that fully understand the present invention, still, the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following public specific embodiment.
Fig. 1 is the process flow diagram of identification code generating method according to an embodiment of the invention.As shown in Figure 1, discern code generating method according to an embodiment of the invention and comprise: step S102 generates first character string of first length according to general unique identifier general-purpose algorithm; Step S104 removes the link symbol in described first character string, described first character string of described first length is become second character string of second length; Step S106 divides into groups the character in described second character string of described second length, compress, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.By such technical scheme, can generate the existing uniqueness identification code of conserve storage again, guarantee the efficient of data storage.
In technique scheme, in described step S102, described first length is 36 characters.
In technique scheme, in described step S104, described link symbol is "-".
In technique scheme, described second length is 32 characters, and the 3rd length is 22 characters, and described step S106 is specially: step S1062, described 32 characters are divided into 11 groups, and wherein, the 1st group is 2 characters, all the other 10 groups are respectively 3 characters; Step S1064 compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression; Step S1066 splices the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.Like this, just can reduce the length of character string, save storage space.
In technique scheme, described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems, described step S1064 is specially: use 64 characters to describe 64 system numerical value, wherein said 64 characters comprise: #$0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqr stuvwxyz, and described 64 characters are arranged according to the order of ASCII character; Three character development of evil in febrile disease of 16 systems are become the numeral of 10 systems, and the numerical range after the conversion is 0 to 16
3According to the numeral of above-mentioned 10 systems, producing length is the character string of 64 systems of 2 characters.
By technique scheme, can realize a kind of identification code generation system, can either guarantee to have uniqueness at the ID that distributed system produces, can effectively reduce the shared byte number of ID again, conserve storage, the efficient of assurance data storage is unlikely to increase too many network traffics.
Fig. 2 shows the block diagram of identification code generation system according to still another embodiment of the invention.As shown in Figure 2, identification code generation system 200 comprises according to an embodiment of the invention: the first character string generation module 202 generates first character string of first length according to general unique identifier general-purpose algorithm; The second character string generation module 204 is removed the link symbol in described first character string, described first character string of described first length is become second character string of second length; Three-character doctrine is concatenated into module 206, the character in described second character string of described second length is divided into groups, compresses, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.By such technical scheme, can generate the existing uniqueness identification code of conserve storage again, guarantee the efficient of data storage.
In technique scheme, described first length is 36 characters, and described link symbol is "-"; Described second length is 32 characters, and the 3rd length is 22 characters.
In technique scheme, three-character doctrine is concatenated into module 206 and is comprised: grouping module, described 32 characters are divided into 11 groups, and wherein, the 1st group is 2 characters, all the other 10 groups are respectively 3 characters; Compression module compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression; Concatenation module is spliced the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.Like this, just can reduce the length of character string, save storage space.
In technique scheme, described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems.
By technique scheme, can realize a kind of identification code generation system, can either guarantee to have uniqueness at the ID that distributed system produces, can effectively reduce the shared byte number of ID again, conserve storage, the efficient of assurance data storage is unlikely to increase too many network traffics.
Fig. 3 is the processing flow chart of identification code generating method according to still another embodiment of the invention.
At first introduce the relevant information of general unique identifier, general unique identifier (Universally Unique Identifier, UUID) be the standard of a software construction, also be FSF (Open Software Foundation, OSF) be organized in distributed computing environment (Distributed Computing Environment, DCE) some in field.
UUID can guarantee that to all aerial when same machines all be unique, and it mainly is made of three parts:
(1) current date and time;
(2) clock sequence;
(3) the unique IEEE machine recognition of the overall situation number.
UUID is a character string that comprises 36 characters, and form is xxxxxxxx-xxxx-xxxx-xxxxxx-xxxxxxxxxx (8-4-4-4-12), and wherein each x is a hexadecimal numeral in 0-9 or the a-f scope.
The identification code generating method of present embodiment has uniqueness based on the UUID technology to guarantee the ID that produces in the distributed system.In order to reduce the length of ID, the identification code generating method of present embodiment provides a kind of method of compression, and making length is the ID that the UUID of 36 characters is converted into 22 characters of equal value.
Describe the flow process of the identification code generating method of embodiments of the invention below in detail, as shown in Figure 3:
At step S302: producing length according to the UUID general-purpose algorithm is the character string A of 36 characters;
At step S304: remove 4 link symbols "-" of fixed position among the character string A, make the length of character string A become 32 characters;
At step S306: 32 characters among the character string A are divided into 11 groups, and wherein first group is 2 characters, and all the other 10 groups is 3 characters;
At step S308: second group to the 11 group character string is compressed respectively, and every group is 2 characters by 3 character compression;
At step S310: the character after the compression of 2 characters of first group and second to the 11st group is spliced, and producing length is the ID character string of 22 characters.
Wherein, the compression algorithm of step S308 mainly is the character string that the character string of 3 16 systems is converted into 2 64 systems, and transforming principle is based on following formula: 16^3=4096=64^2.
The concrete compression algorithm of step S304 is:
(1) at first 64 system numerical value is described with 64 characters, these 64 characters are " #$0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghizklmnopqr stuvwxyz ", these 64 characters are arranged according to the order of ASCII character, follow the UUID unanimity with the ID ranking results that guarantees to produce;
(2) three characters of 16 systems are converted into the numeral of 10 systems, the numerical range after the conversion is 0～16^3, promptly 0～4096.
(3) numeral that produces according to (2) step, producing length is the character string of 64 systems of 2 characters.
The specific implementation process of this algorithm is described below by an example:
The JDK1.5 version of step 1:JAVA language provides the instrument class of a general generation UUID, we produce an ID character string by this method java.util.UUID.randomUUID () .toString (), if the ID that generates is: a3797f94-4428-4a4f-b9f3-290c3dc05d7e;
Step 2: the character string that the first step produces is removed "-", produce intermediate result character string: a3797f9444284a4fb9f3290c3dc05d7e;
Step 3: the character string that second step was produced is divided into 11 groups, and group result is:
| Group number | Value |
| 1 | a3 |
| 2 | 797 |
| 3 | f94 |
| 4 | 442 |
| 5 | 84a |
| 6 | 4fb |
| 7 | 9f3 |
| 8 | 290 |
| 9 | c3d |
| 10 | c05 |
| 11 | d7e |
Step 4: the 2nd group to the 11st group character string is compressed according to algorithm noted earlier, and the result after the compression is:
| Group number | Value |
| 1 | a3 |
| 2 | SL |
| 3 | yI |
| 4 | F0 |
| 5 | V8 |
| 6 | Hv |
| 7 | bn |
| 8 | 8E |
| 9 | kx |
| 10 | k3 |
| 11 | py |
Step 5: the character string after the compression of splicing step 4, producing length is the ID:a3SLyIF0V8Hvbn8Ekxk3py of 22 characters.
It is pointed out that ID that the identification code generating method of present embodiment is produced is the capital and small letter that will distinguish letter.So the ID that the identification code generating method of present embodiment produces has certain limitation, is inapplicable for insensitive applied environment of some capital and small letters and database environment.
In addition, in the step 3 in this scheme, 32 characters are divided into 11 groups, wherein 1 group is 2 characters, and other 10 groups is three characters.This grouping scheme is not limited only to a kind of packet mode described in the present embodiment, as long as keep the order of character constant, specifically to put 2 characters all be indifferent to which group.
Below we illustrate the application mode of technical scheme of the present invention by a simple applicating example.Design a database table in the present embodiment, simultaneously the data in its table are safeguarded.
(1) at first designs a database table (demo_user), this table is used for storing subscriber information, is made up of three row, is respectively user ID (userid), subscriber-coded (usercode), user's name (username), wherein userid is the major key of this table, and the structural design of database table is as follows:
create?table?demo_user(
userid?char(22)not?null，
usercode?varchar(20)null，
username?varchar(50)null
)
(2) application program generates the userid that length is 22 characters by the identification code generating method described in the technical scheme of the present invention when table demo_user increases a record newly, if the ID that generates is a3SLyIF0V8Hvbn8Ekxk3py.Two other attribute, usercode and username are normally entered by the list typing of user interface, if be respectively user001, Zhang San.Like this, a new user record just can be saved among the database table demo_user.
(3) user normally browses the record that will delete earlier by the process of a record among the application program deletion demo_user, and the ID (at user's browser interface, userid normally hides) according to this record deletes then.Such as, we will delete that record that produces in (2) step, and we need know the major key of the record that will delete, and promptly a3SLyIF0V8Hvbn8Ekxk3py deletes by the delet method of this major key invokes application then.If the WEB system, usually in the URL address that client is submitted to, for example:
http://serverhost/deleteuser.jsp？userid＝a3SLyIF0V8Hvbn8Ekxk3py
By technique scheme, can realize that a kind of identification code generates method and system, it has following three main advantages:
First advantage is that the ID whole world that generates is unique.Globally unique characteristic makes it to be fit to very much be applied in the distributed software system, does not worry the ID collision problem;
Second advantage is that the ID length that generates is less.In the software systems based on database, shared storage space is less, and the efficient that data write and read is all than higher.In the WEB system, less storage space also can effectively reduce network traffics, promotes the performance of website.
The 3rd advantage is the efficient height that ID generates.Because this algorithm only depends on the machine of this algorithm of operation itself, need not to obtain again the related resource of other machines, operational efficiency is higher, can satisfy the demand that generates a large amount of ID in the OLTP system fast.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1. an identification code generating method is characterized in that, comprising:
Step S102 generates first character string of first length according to general unique identifier general-purpose algorithm;
Step S104 removes the link symbol in described first character string, described first character string of described first length is become second character string of second length;
Step S106 divides into groups the character in described second character string of described second length, compress, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.
2. identification code generating method according to claim 1 is characterized in that, in described step S102, described first length is 36 characters.
3. identification code generating method according to claim 2 is characterized in that, in described step S104, described link symbol is "-".
4. identification code generating method according to claim 3 is characterized in that, described second length is 32 characters, and the 3rd length is 22 characters, and described step S106 is specially:
Step S1062 is divided into 11 groups with described 32 characters, and wherein, the 1st group is 2 characters, and all the other 10 groups are respectively 3 characters;
Step S1064 compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression;
Step S1066 splices the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.
5. identification code generating method according to claim 4 is characterized in that described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems, and described step S1064 is specially:
Use 64 characters to describe 64 system numerical value, wherein said 64 characters comprise: #$0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqr stuvwxyz, and described 64 characters are arranged according to the order of ASCII character;
Three character development of evil in febrile disease of 16 systems are become the numeral of 10 systems, and the numerical range after the conversion is 0 to 16
3
According to the numeral of above-mentioned 10 systems, producing length is the character string of 64 systems of 2 characters.
6. an identification code generation system is characterized in that, comprising:
The first character string generation module generates first character string of first length according to general unique identifier general-purpose algorithm;
The second character string generation module is removed the link symbol in described first character string, described first character string of described first length is become second character string of second length;
Three-character doctrine is concatenated into module, the character in described second character string of described second length is divided into groups, compresses, and the character after will compressing splices, and generates the three-character doctrine string of the 3rd length, and wherein, described three-character doctrine string is an identification code.
7. identification code generation system according to claim 6 is characterized in that, described first length is 36 characters, and described link symbol is "-"; Described second length is 32 characters, and the 3rd length is 22 characters.
8. identification code generation system according to claim 7 is characterized in that three-character doctrine is concatenated into module and comprised:
Grouping module is divided into 11 groups with described 32 characters, and wherein, the 1st group is 2 characters, and all the other 10 groups are respectively 3 characters;
Compression module compresses the 2nd group to the 11st group character string respectively, and using compression algorithm is 2 characters with every group by 3 character compression;
Concatenation module is spliced the character after described the 1st group 2 characters and described the 2nd group to the 11st group compression, and generating length is the three-character doctrine string of 22 characters.
9. identification code generation system according to claim 8 is characterized in that described compression algorithm is specially the character string that the character string of 3 16 systems is converted into 2 64 systems.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010291998 CN101976241B (en) | 2010-09-26 | 2010-09-26 | Method and system for generating identification code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010291998 CN101976241B (en) | 2010-09-26 | 2010-09-26 | Method and system for generating identification code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101976241A true CN101976241A (en) | 2011-02-16 |
| CN101976241B CN101976241B (en) | 2013-01-09 |
Family
ID=43576127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010291998 Active CN101976241B (en) | 2010-09-26 | 2010-09-26 | Method and system for generating identification code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101976241B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102298716A (en) * | 2011-09-02 | 2011-12-28 | 北京地拓科技发展有限公司 | Identifier generation method and device and application method of identifier |
| CN102542019A (en) * | 2011-12-19 | 2012-07-04 | 北京地拓科技发展有限公司 | Identification code storage method and identification code storage system as well as identification code indexing method and identification code indexing system |
| CN103984550A (en) * | 2014-05-15 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | Serial number elongation algorithm of distributed modular system |
| CN104468098A (en) * | 2014-11-21 | 2015-03-25 | 浪潮(北京)电子信息产业有限公司 | Method and device for generating serial number |
| CN105224414A (en) * | 2015-09-25 | 2016-01-06 | 北京奇虎科技有限公司 | For realizing method of calibration and the device of the code of business task |
| CN105450712A (en) * | 2014-09-02 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Data transmission method and device |
| CN105450232A (en) * | 2014-08-28 | 2016-03-30 | 华为技术有限公司 | Encoding method, decoding method, encoding device and decoding device |
| CN106844288A (en) * | 2015-12-07 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of random string generation method and device |
| CN112232025A (en) * | 2019-06-26 | 2021-01-15 | 杭州海康威视数字技术股份有限公司 | Character string storage method and device and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6039249A (en) * | 1996-12-03 | 2000-03-21 | Szewczykowski; Jerzy | Method for identifying counterfeit negotiable instruments |
| CN101223501A (en) * | 2005-05-25 | 2008-07-16 | 高通股份有限公司 | System and method of performing two's complement operations in a digital signal processor |
| CN101533414A (en) * | 2009-04-15 | 2009-09-16 | 阿里巴巴集团控股有限公司 | A method and a device for generating unique identifier of database record |
-
2010
- 2010-09-26 CN CN 201010291998 patent/CN101976241B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6039249A (en) * | 1996-12-03 | 2000-03-21 | Szewczykowski; Jerzy | Method for identifying counterfeit negotiable instruments |
| CN101223501A (en) * | 2005-05-25 | 2008-07-16 | 高通股份有限公司 | System and method of performing two's complement operations in a digital signal processor |
| CN101533414A (en) * | 2009-04-15 | 2009-09-16 | 阿里巴巴集团控股有限公司 | A method and a device for generating unique identifier of database record |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102298716A (en) * | 2011-09-02 | 2011-12-28 | 北京地拓科技发展有限公司 | Identifier generation method and device and application method of identifier |
| CN102542019A (en) * | 2011-12-19 | 2012-07-04 | 北京地拓科技发展有限公司 | Identification code storage method and identification code storage system as well as identification code indexing method and identification code indexing system |
| CN103984550A (en) * | 2014-05-15 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | Serial number elongation algorithm of distributed modular system |
| CN103984550B (en) * | 2014-05-15 | 2018-03-27 | 浪潮电子信息产业股份有限公司 | A kind of method of elongated sequence number in distributed modular system |
| CN105450232A (en) * | 2014-08-28 | 2016-03-30 | 华为技术有限公司 | Encoding method, decoding method, encoding device and decoding device |
| CN105450712A (en) * | 2014-09-02 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Data transmission method and device |
| CN105450712B (en) * | 2014-09-02 | 2019-08-30 | 阿里巴巴集团控股有限公司 | A kind of data transmission method and device |
| CN104468098A (en) * | 2014-11-21 | 2015-03-25 | 浪潮(北京)电子信息产业有限公司 | Method and device for generating serial number |
| CN105224414A (en) * | 2015-09-25 | 2016-01-06 | 北京奇虎科技有限公司 | For realizing method of calibration and the device of the code of business task |
| CN105224414B (en) * | 2015-09-25 | 2018-01-19 | 北京奇虎科技有限公司 | For the method for calibration and device of the code for realizing business task |
| US20180285078A1 (en) * | 2015-12-07 | 2018-10-04 | Alibaba Group Holding Limited | Method and apparatus for generating random character string |
| KR20180088895A (en) * | 2015-12-07 | 2018-08-07 | 알리바바 그룹 홀딩 리미티드 | Method and apparatus for generating random string |
| WO2017097159A1 (en) * | 2015-12-07 | 2017-06-15 | 阿里巴巴集团控股有限公司 | Method and apparatus for generating random character string |
| CN106844288A (en) * | 2015-12-07 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of random string generation method and device |
| AU2016367801B2 (en) * | 2015-12-07 | 2019-10-31 | Advanced New Technologies Co., Ltd. | Method and apparatus for generating random character string |
| US10489117B2 (en) * | 2015-12-07 | 2019-11-26 | Alibaba Group Holding Limited | Method and apparatus for generating random character string |
| KR102111871B1 (en) * | 2015-12-07 | 2020-05-18 | 알리바바 그룹 홀딩 리미티드 | Method and apparatus for generating random string |
| CN106844288B (en) * | 2015-12-07 | 2022-03-22 | 创新先进技术有限公司 | Random character string generation method and device |
| CN112232025A (en) * | 2019-06-26 | 2021-01-15 | 杭州海康威视数字技术股份有限公司 | Character string storage method and device and electronic equipment |
| CN112232025B (en) * | 2019-06-26 | 2023-11-03 | 杭州海康威视数字技术股份有限公司 | Character string storage method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101976241B (en) | 2013-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101976241B (en) | Method and system for generating identification code | |
| US7865560B2 (en) | System for summarization of threads in electronic mail | |
| US8799353B2 (en) | Scope-based extensibility for control surfaces | |
| CN102184184B (en) | Method for acquiring webpage dynamic information | |
| US20080192302A1 (en) | Method and apparatus for summarization of threads in electronic mail | |
| US20040268306A1 (en) | Methods, systems and computer program products for language independent data communication and display | |
| CN109522018A (en) | Page processing method, device and storage medium | |
| CN103425644B (en) | The extracting method of picture and device in Web page text | |
| CN101382893A (en) | On-line assembling method for component based on Web service | |
| CN101464879B (en) | Method and system for implementing dynamic catalog based on regulation | |
| CN103309884A (en) | User behavior data collecting method and system | |
| CN1504925A (en) | Method and computer readable carrier designed for importing and exporting data of hierarchic structure | |
| CN106909361A (en) | Web development approaches and device based on masterplate engine | |
| CN111443901B (en) | Java reflection-based service expansion method and device | |
| CN110297636A (en) | A kind of automatic production of HTML page and parameter management method based on page configuration file, system and device | |
| CN115220773B (en) | System and method for low-code, visual generation of background data management code | |
| CN104750472A (en) | Resource bundle management method and device of terminal application | |
| CN107608669A (en) | A kind of method based on database table structure automatic generation function and the page | |
| CN113254445A (en) | Real-time data storage method and device, computer equipment and storage medium | |
| CN102508884A (en) | Method and device for acquiring hotpot events and real-time comments | |
| CN109240664A (en) | A kind of method and terminal acquiring user behavior information | |
| CN108984156A (en) | A kind of software auto generating method and system for exempting from code development based on template | |
| CN101261643A (en) | Website page information statistical method and apparatus | |
| CN102486731B (en) | Strengthen the visualization method of the call stack of software of software, equipment and system | |
| CN101588317A (en) | Method for realizing dynamic release of website messages |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: YONYOU NETWORK TECHNOLOGY CO., LTD. Free format text: FORMER NAME: UFIDA SOFTWARE CO., LTD. |
|
| CP03 | Change of name, title or address |
Address after: 100094 Haidian District North Road, Beijing, No. 68 Patentee after: Yonyou Network Technology Co., Ltd. Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Patentee before: UFIDA Software Co., Ltd. |