CN101976241B - Method and system for generating identification code - Google Patents
Method and system for generating identification code Download PDFInfo
- Publication number
- CN101976241B CN101976241B CN 201010291998 CN201010291998A CN101976241B CN 101976241 B CN101976241 B CN 101976241B CN 201010291998 CN201010291998 CN 201010291998 CN 201010291998 A CN201010291998 A CN 201010291998A CN 101976241 B CN101976241 B CN 101976241B
- Authority
- CN
- China
- Prior art keywords
- characters
- character
- length
- character string
- group
- 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
Images
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 RDBMS, usually, each tables of data need to be come unique sign line item with an ID, such as each production order in the ERP system a unique sign can be arranged.
The main method that exists two large 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 the 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 higher.Shortcoming is that UUID is comprised of 36 characters, and length is excessive, and it is more to take storage space, in large-scale Database Systems, can affect the efficient of data access, for the WEB system, the flow that this type of a large amount of ID of transmission produces on the network is also larger, 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 the method is that the ID length that produces is controlled, and shortcoming is the ID uniqueness in whole system especially distributed system that is difficult to guarantee generation, usually needs 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 at the ID that distributed system produces, can effectively reduce again the shared byte number of ID, conserve storage guarantees the efficient that data are stored, and 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 again the shared byte number of ID, conserve storage guarantees the efficient that data are stored, and is unlikely to increase too many network traffics.
The invention provides a kind of identification code generating method, comprising: step S102 generates the first character string of the first length according to general unique identifier general-purpose algorithm; Step S 104, remove the link symbol in described the first character string, described first character string of described the first length become the second character string of the second length; Step S106 divides into groups the character in described second character string of described the 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 identification code.By this technical scheme, can generate the again identification code of conserve storage of existing uniqueness, guarantee the efficient of data storage.
In technique scheme, preferably, in described step S102, described the first length is 36 characters.
In technique scheme, preferably, in described step S104, described link symbol is "-".
In technique scheme, preferably, described the 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: describe 64 system numerical value with 64 characters, wherein said 64 characters comprise: # $ 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrst uvwxyz, 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 the first character string of the first length according to general unique identifier general-purpose algorithm; The second character string generation module is removed the link symbol in described the first character string, described first character string of described the first length is become the second character string of the second length; Three-character doctrine is concatenated into module, the character in described second character string of described the 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 identification code.By this technical scheme, can generate the again identification code of conserve storage of existing uniqueness, guarantee the efficient of data storage.
In technique scheme, preferably, described the first length is 36 characters, and described link symbol is "-"; Described the 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 again the shared byte number of ID, 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 clearly to understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments the present invention is further described in detail.
Set forth in the following description a lot of details 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, identify according to an embodiment of the invention code generating method and comprise: step S102 generates the first character string of the first length according to general unique identifier general-purpose algorithm; Step S104 removes the link symbol in described the first character string, described first character string of described the first length is become the second character string of the second length; Step S106 divides into groups the character in described second character string of described the 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 identification code.By such technical scheme, can generate the again identification code of conserve storage of existing uniqueness, guarantee the efficient of data storage.
In technique scheme, in described step S102, described the first length is 36 characters.
In technique scheme, in described step S104, described link symbol is "-".
In technique scheme, described the 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: describe 64 system numerical value with 64 characters, wherein said 64 characters comprise: # $ 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrst uvwxyz, 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 again the shared byte number of ID, conserve storage guarantees the efficient that data are stored, and 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 the first character string of the first length according to general unique identifier general-purpose algorithm; The second character string generation module 204 is removed the link symbol in described the first character string, described first character string of described the first length is become the second character string of the second length; Three-character doctrine is concatenated into module 206, the character in described second character string of described the 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 identification code.By such technical scheme, can generate the again identification code of conserve storage of existing uniqueness, guarantee the efficient of data storage.
In technique scheme, described the first length is 36 characters, and described link symbol is "-"; Described the 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 again the shared byte number of ID, conserve storage guarantees the efficient that data are stored, and 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.
Paper is the relevant information of general unique identifier once, general unique identifier (Universally Unique Identifier, UUID) be the standard of a software construction, also be FSF (Open Software Foundation, OSF) the some that is organized in distributed computing environment (Distributed Computing Environment, DCE) 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.
The below describes the flow process of the identification code generating method of embodiments of the invention 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 with 64 characters 64 system numerical value is described, these 64 characters are " # $ 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghizklmnopqrst uvwxyz ", these 64 characters are arranged according to the order of ASCII character, and are consistent with UUID 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, namely 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 tool-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 is 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 produces 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 the 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 in the present embodiment a database table, 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, formed by three row, be 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
)
When (2) application program is to the newly-increased record of table demo_user, generate the userid that length is 22 characters by the identification code generating method described in the technical scheme of the present invention, 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 Consumers record just can be saved among the database table demo_user.
(3) user normally browses first the record that will delete by the process of a record among the application program deletion demo_user, and then the ID (at user's browser interface, userid normally hides) according to this record deletes.Such as, we will delete that record that produces in (2) step, and we need to know the major key of the record that will delete, and namely then a3SLyIF0V8Hvbn8Ekxk3py deletes by the delet method of this major key invokes application.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 of based on database, shared storage space is less, and the efficient that data write and read is all 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 fast a large amount of ID in the OLTP system.
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 modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. identify code generating method for one kind, be used for the tables of data of sign relevant database, it is characterized in that, comprising:
Step S102 generates the first character string of the first length according to general unique identifier general-purpose algorithm, and described the first length is 36 characters;
Step S104 removes the link symbol in described the first character string, described first character string of described the first length is become the second character string of the second length;
Step S106 divides into groups the character in described second character string of described the 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 identification code;
Wherein, described the 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.
2. identification code generating method according to claim 1 is characterized in that, in described step S104, described link symbol is "-".
3. identification code generating method according to claim 1 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:
Describe 64 system numerical value with 64 characters, wherein said 64 characters comprise: # 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrst uvwxyz, 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.
4. identification code generation system is used for the tables of data of sign relevant database, it is characterized in that, comprising:
The first character string generation module, described the first length of the first character string that generates the first length according to general unique identifier general-purpose algorithm is 36 characters;
The second character string generation module is removed the link symbol in described the first character string, described first character string of described the first length is become the second character string of the second length;
Three-character doctrine is concatenated into module, the character in described second character string of described the 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 identification code;
Wherein, three-character doctrine is concatenated into module and is 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.
5. identification code generation system according to claim 4 is characterized in that, described link symbol is "-"; Described the second length is 32 characters, and the 3rd length is 22 characters.
6. identification code generation system 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.
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 CN101976241A (en) | 2011-02-16 |
| CN101976241B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102298716B (en) * | 2011-09-02 | 2014-05-07 | 北京地拓科技发展有限公司 | 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 |
| 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 |
| 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 |
| CN105224414B (en) * | 2015-09-25 | 2018-01-19 | 北京奇虎科技有限公司 | For the method for calibration and device of the code for realizing business task |
| CN106844288B (en) * | 2015-12-07 | 2022-03-22 | 创新先进技术有限公司 | Random character string generation method and device |
| CN112232025B (en) * | 2019-06-26 | 2023-11-03 | 杭州海康威视数字技术股份有限公司 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101976241A (en) | 2011-02-16 |
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 | |
| CN104657451B (en) | The processing method and processing device of the page | |
| CN102184184B (en) | Method for acquiring webpage dynamic information | |
| CN101609399A (en) | Intelligent website development system and method based on modeling | |
| CN104268082B (en) | The method for testing pressure and device of browser | |
| CN103425644B (en) | The extracting method of picture and device in Web page text | |
| CN109522018A (en) | Page processing method, device and storage medium | |
| US20080192302A1 (en) | Method and apparatus for summarization of threads in electronic mail | |
| CN101464879B (en) | Method and system for implementing dynamic catalog based on regulation | |
| CN111666490A (en) | Information pushing method, device, equipment and storage medium based on kafka | |
| CN103309884A (en) | User behavior data collecting method and system | |
| CN101382893A (en) | On-line assembling method for component based on Web service | |
| CN102779063A (en) | Method for providing application invocation and server | |
| CN106909361A (en) | Web development approaches and device based on masterplate engine | |
| CN103823811A (en) | Method and system for processing journals | |
| CN111443901B (en) | Java reflection-based service expansion method and device | |
| CN102508884A (en) | Method and device for acquiring hotpot events and real-time comments | |
| CN104679493A (en) | Improved method for process event handling mechanism | |
| CN113254445A (en) | Real-time data storage method and device, computer equipment and storage medium | |
| WO2021088350A1 (en) | Script-based web service paging data acquisition system | |
| CN102486731B (en) | Strengthen the visualization method of the call stack of software of software, equipment and system | |
| CN110716913B (en) | Mutual migration method of Kafka and Elasticissearch database data | |
| 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. |