CN103294694A - Method and device for comparing sizes of keywords in database - Google Patents
Method and device for comparing sizes of keywords in database Download PDFInfo
- Publication number
- CN103294694A CN103294694A CN201210045641XA CN201210045641A CN103294694A CN 103294694 A CN103294694 A CN 103294694A CN 201210045641X A CN201210045641X A CN 201210045641XA CN 201210045641 A CN201210045641 A CN 201210045641A CN 103294694 A CN103294694 A CN 103294694A
- Authority
- CN
- China
- Prior art keywords
- byte arrays
- size
- converted
- arrays
- numerical value
- 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
Abstract
The invention is applicable to the technical field of data processing, and provides a method and a device for comparing sizes of keywords in a database. The method includes steps as follows: to-be-compared keywords are converted into corresponding byte arrays, and the keywords comprise character strings and numerical values; when the byte arrays are obtained through conversion of the numerical values, the byte arrays are restored into corresponding numerical values, and the sizes of the byte arrays are determined by comparing sizes of the restored numerical values; otherwise, the sizes of the byte arrays are directly compared; and the sizes of the keywords are determined according to the sizes of the compared byte arrays. With the adoption of the method and the device, the problem that the sizes of the converted byte arrays and the sizes of actual numerical values are inconsistent during comparison of the numerical values of the keywords can be effectively solved.
Description
Technical field
The invention belongs to technical field of data processing, relate in particular to key word size method and device relatively in a kind of database.
Background technology
In existing non-relational database based on key word/value, when needs compare key word, the type of considering key word may be different, for example character string type, numeric type etc., therefore after needing to convert key word to unified byte arrays (ASCII character) earlier, again byte arrays is compared.
Comparison for byte arrays, prior art as shown in Figure 1, judge the size of byte arrays by the size of the more every bit byte array value of recycle ratio (array index is identical), be that the identical array value of subscript is when all equating, byte arrays size to be compared is identical, otherwise determines the size of byte arrays to be compared according to the comparative result of first unequal array value.Yet prior art only is applicable to the comparison of character string, and for the comparison of numerical value, as shown in Figure 2, earlier numerical value is converted to corresponding byte arrays (2147483605 corresponding first byte arrays; 6488064 corresponding second byte arrays;-2147483600 corresponding the 3rd byte arrays), be sign pattern to be arranged relatively when (Signed Compare) when what carry out, the first figure place class value (65) of first byte arrays is greater than the first figure place class value (63) of the 3rd byte arrays, the second figure place class value (33) of first byte arrays is again less than the second figure place class value (88) of second byte arrays, therefore these three byte arrays putting in order from small to large is the 3rd byte arrays, first byte arrays, second byte arrays, and actual numerical value putting in order from small to large is-2147483600,6488064,2147483605.Be that unsigned type is relatively when (Unsigned Compare) when what carry out, the first figure place class value (65) of first byte arrays is less than the first figure place class value of the 3rd byte arrays (63 be converted to unsigned type then be 193), the second figure place class value of first byte arrays (33 be converted to unsigned type then be 223) is greater than the second figure place class value (88) of second byte arrays, therefore these three byte arrays putting in order from small to large is second byte arrays, first byte arrays, the 3rd byte arrays, and actual numerical value putting in order from small to large is-2147483600,6488064,2147483605.
From as can be seen above-mentioned, prior art is carrying out key word relatively the time, for the byte arrays after the numerical value conversion in the key word, occurs byte arrays size and actual numerical value situation about causing not of uniform size after the conversion easily.
Summary of the invention
The purpose of the embodiment of the invention is to provide key word size method relatively in a kind of database, to solve prior art when carrying out the key word comparison, for the byte arrays after the numerical value conversion in the key word, byte arrays size and the actual numerical value problem that causes not of uniform size after occurring easily changing.
The embodiment of the invention is achieved in that key word size method relatively in a kind of database, and described method comprises:
Convert key word to be compared to corresponding byte arrays, described key word comprises character string and numerical value;
When described byte arrays is converted to by numerical value, described byte arrays is reduced into value corresponding, determine described byte arrays size by the numerical values recited after relatively reducing; Otherwise, the direct size of more described byte arrays;
Size by the certain described key word of the size of the byte arrays after the comparison.
Another purpose of the embodiment of the invention is to provide key word size device relatively in a kind of database, and described device comprises:
Converting unit is used for converting key word to be compared to corresponding byte arrays, and described key word comprises character string and numerical value;
Comparing unit is used for when described byte arrays is converted to by numerical value described byte arrays being reduced into value corresponding, determines described byte arrays size by the numerical values recited after relatively reducing; Otherwise, the direct size of more described byte arrays;
Determining unit is used for the size by the certain described key word of byte arrays size after comparing.
From technique scheme as can be seen, the embodiment of the invention is when carrying out the comparison of key word size, for the byte arrays after the numerical value conversion in the key word, need earlier this byte arrays to be reduced into value corresponding, determine described byte arrays size by the numerical values recited after relatively reducing, thereby after can effectively solving numerical value and converting byte arrays to, byte arrays size and the actual numerical value problem that causes not of uniform size make that the comparative result of key word size is more accurate.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the byte arrays size process flow diagram relatively that prior art provides;
Fig. 2 is the byte arrays size exemplary plot relatively that prior art provides;
Fig. 3 is the realization flow figure of key word size comparative approach in the database that provides of the embodiment of the invention;
Fig. 4 is the particular flow sheet of the byte arrays size comparative approach that provides of the embodiment of the invention;
Fig. 5 is the composition structural drawing of key word size comparison means in the database that provides of the embodiment of the invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below the contrast accompanying drawing is further elaborated to the present invention also in conjunction with the embodiments.Should be appreciated that specific embodiment described herein only in order to explaining the present invention, and be not used in restriction the present invention.
For technical solutions according to the invention are described, describe below by specific embodiment.
Fig. 3 shows the realization flow of key word size comparative approach in the database that the embodiment of the invention provides, and specifically details are as follows:
In step S301, convert key word to be compared to corresponding byte arrays, described key word comprises character string and numerical value.
In the present embodiment, numerical value converts byte arrays (but being not limited to this) realization in the following way to, for example: byte[] bytes=BitConverter.GetBytes (201805978); Character string converts byte arrays (but being not limited to this) realization in the following way to, for example: String a=new String (" character string "); Byte[] bytes=a.getBytes ().
In step S302, judge whether current byte arrays to be compared is converted to by numerical value, when being "Yes" as if judged result, execution in step S304, when being "No" as if judged result, execution in step S303.
In the present embodiment, judging whether current byte arrays to be compared is converted to specifically by numerical value comprises:
Whether the array length of judging current byte arrays to be compared is identical, when inequality, execution in step S302, when identical, continue to judge the sign pattern of current byte arrays to be compared, if sign pattern is arranged, then judge described have in sign pattern (array value-128-127 between) byte arrays whether exist at least one array value less than zero, if exist, execution in step S304 then, otherwise execution in step S303; If unsigned type then judges in the described unsigned type byte arrays whether exist at least one array value greater than 127, if exist, execution in step S304 then, otherwise execution in step S303.
Byte arrays to be compared in the present embodiment is at least two.
In step S303, the direct size of more described byte arrays, be specially by subscript is identical in the more described byte arrays of recycle ratio array value (for example byteA[1] and byteB[1], byteA[1 wherein] and byteB[1] be designated as 1 array value down among expression byte arrays A and the B) size determine the size of described byte arrays.
In the present embodiment, recycle ratio number of times is less than or equal in the byte arrays length to be compared minimum length, for example number of times i＜=min of recycle ratio (byteA.length, byteB.length).When the identical array value of subscript all equated, byte arrays size to be compared was identical, otherwise determined the size of byte arrays to be compared, for example byteA[2 according to the comparative result of first unequal array value]＞byteB[2], byteA＞byteB then.
In step S304, described byte arrays is reduced into value corresponding, determine described byte arrays size by the numerical values recited after relatively reducing.
Concrete is, converts the rule of byte arrays to according to numerical value, with described regular regurgitation, by described contrary rule described byte arrays is reduced into value corresponding.For example: byte[] bytes=BitConverter.GetBytes (201805978) (numerical value converts byte arrays to), int i=BitConverter.ToInt32 (bytes, 0) (byte arrays is reduced into value corresponding).
In the present embodiment, because the numerical value after the reduction is corresponding one by one with described byte arrays, so can determine described byte arrays size by the numerical values recited after relatively reducing, effectively solve prior art after numerical value converts byte arrays to, byte arrays size and the actual numerical value problem that causes not of uniform size.And present embodiment does not need to limit character types, and NULI character type and the byte arrays that sign pattern is arranged all are suitable for.
In step S305, by the size of the certain described key word of the size of the byte arrays after the comparison.
In the present embodiment, during the byte arrays that in participating in byte arrays relatively, has the byte arrays that converted by numerical value and converted by character string, after relatively finishing the byte arrays that is converted by numerical value and the byte arrays that is converted by character string, also need be by the mode that directly compares, maximum byte array in minimum byte arrays in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, perhaps the minimum byte arrays in the maximum byte array in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, obtaining the size order of whole participation byte arrays relatively, and then the size order of key word in definite entire database.
Illustrate as follows, as the byte arrays of supposing to participate in comparison is A, B, C, E, F, G, A wherein, B, the byte arrays of C for being converted by numerical value, E, F, the byte arrays of G for being converted by character string, then for A, B, C, need be with A, B, C compares after being reduced into numerical value, obtain comparative result A＞B＞C, for E, F, G, then direct compare byte array obtains comparative result E＞F＞G, and then direct compare byte array G and A, perhaps the size of byte arrays C and E is determined whole byte arrays A, B, C, E, F, size order between the G, and then determine whole key word size order.
Fig. 4 shows the idiographic flow of the byte arrays size comparative approach that the embodiment of the invention provides, and process is as follows:
1. obtain current byte arrays: byte[] byteA, byte[] byteB;
2. judge whether byteA is empty, if, execution in step 3, otherwise execution in step 4;
3. judge whether byteB is empty, if, execution in step 5, otherwise execution in step 6;
4. judge whether byteB is empty, if, execution in step 7, otherwise execution in step 8;
5. export comparative result byteA=byteB;
6. export comparative result byteA＜byteB;
7. export comparative result byteA＞byteB;
8. obtain in the current byte arrays length minimum length, namely length=min (byteA.length, byteB.length);
9. initialization makes byte arrays subscript i=0, and zone bit is false;
10. according to the subscript of byte arrays, obtain corresponding array value among byteA, the byteB;
11. give i after i added 1;
Whether equal the array length of byteB 12. judge the array length of byteA, if, execution in step 13, otherwise execution in step 14;
13. judge the sign pattern of byte arrays, whether for sign pattern is arranged, if execution in step 15 if not, illustrates that then described byte arrays is unsigned type, execution in step 16;
14. judge byte number class value byteA[i] with byteB[i] whether identical, if return step 10 and continue to carry out, otherwise execution in step 17;
15. judge byteA[i] or byteB[i] whether less than zero, if execution in step 20 continues to carry out otherwise return step 10;
16. judge byteA[i] or byteB[i] whether greater than 127, if execution in step 20 continues to carry out otherwise return step 10;
17. judge byteA[i] whether greater than byteB[i], if execution in step 18, otherwise execution in step 19;
18. output comparative result byteA[i]＞byteB[i];
19. output comparative result byteA[i]＜byteB[i];
20. zone bit is set to true;
21. whether judge byte arrays subscript i more than or equal to length l ength minimum in the current byte arrays length, if execution in step 22 continues to carry out otherwise return step 10;
22. whether the judgement symbol position is true, if execution in step 23, otherwise execution in step 27;
23. byteA, byteB are reduced into value corresponding numA, numB;
24. whether judge numA greater than numB, if execution in step 25, otherwise execution in step 26;
25. output comparative result byteA＞byteB;
26. output comparative result byteA＜byteB;
Whether equal the array length of byteB 27. judge the array length of byteA, if execution in step 28, otherwise execution in step 29;
28. output comparative result byteA=byteB;
29. judge that the array length of byteA whether greater than the array length of byteB, if return execution in step 25, otherwise returns execution in step 26.
Need to prove that the concrete numeral in the present embodiment just illustrates, and does not constitute the restriction to essence of the present invention.
Fig. 5 shows the composition structure of key word size comparison means in the database that the embodiment of the invention provides, and for convenience of explanation, only shows the part relevant with present embodiment.
Key word size comparison means 5 can be to run on the unit that software unit, hardware cell or software and hardware in each distributed data base system combine in this database.
Key word size comparison means 5 comprises converting unit 51, comparing unit 52 and determining unit 53 in this database, and its concrete function is as follows:
Converting unit 51 is used for converting key word to be compared to corresponding byte arrays, and described key word comprises character string and numerical value;
Comparing unit 52 is used for when described byte arrays is converted to by numerical value described byte arrays being reduced into value corresponding, determines described byte arrays size by the numerical values recited after relatively reducing; Otherwise, the direct size of more described byte arrays;
Determining unit 53 is used for the size by the certain described key word of byte arrays size after comparing.
Further, described device 5 also comprises judging unit 54, is used for judging whether described byte arrays is converted to by numerical value.Wherein, described judging unit 53 also comprises:
Further, described comparing unit 52 also comprises first comparison module 521 and second comparison module 522:
Described first comparison module 521 is used for when described byte arrays is converted to by numerical value, the contrary rule that converts byte arrays according to numerical value to is reduced into value corresponding with described byte arrays, determines described byte arrays size by the numerical values recited after relatively reducing;
Described second comparison module 522 be used for when described byte arrays be not when being converted to by numerical value, determine the size of described byte arrays by the size of the array value that subscript is identical in the more described byte arrays of recycle ratio.
Further, when described determining unit 53 specifically comprises for the byte arrays that has the byte arrays that converted by numerical value when described byte arrays and converted by character string, mode by direct compare byte array size, maximum byte array in minimum byte arrays in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, perhaps the minimum byte arrays in the maximum byte array in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, obtain the size of whole byte arrays, and determine the size of whole key words according to the size of the whole byte arrays that obtain.
Key word size comparison means can use in the database of aforementioned correspondence in the key word size comparative approach in the database that present embodiment provides, and details do not repeat them here referring to the associated description of key word size comparative approach embodiment in the above-mentioned database.
One of ordinary skill in the art will appreciate that to key word size comparison means in the described database included each unit and module are to divide according to function logic, but be not limited to above-mentioned division, as long as can realize corresponding function; In addition, the concrete title of each functional unit and module also just for the ease of mutual differentiation, is not limited to protection scope of the present invention.
In sum, the embodiment of the invention is when carrying out the comparison of key word size, for the byte arrays after the numerical value conversion in the key word, need earlier described byte arrays to be reduced into value corresponding, because the numerical value after the reduction is corresponding one by one with described byte arrays, so can determine described byte arrays size by the numerical values recited after relatively reducing, effectively solve prior art after numerical value converts byte arrays to, byte arrays size and the actual numerical value problem that causes not of uniform size, thus the more accurate of key word size made.And the embodiment of the invention does not need to limit character types, and NULI character type and the byte arrays that sign pattern is arranged all are suitable for.
Those of ordinary skills it is also understood that, realize that all or part of step in above-described embodiment method is to instruct relevant hardware to finish by program, described program can be in being stored in a computer read/write memory medium, described storage medium comprises ROM/RAM, disk, CD etc.
The above only is preferred embodiment of the present invention, not in order to limiting the present invention, all any modifications of doing within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. key word size method relatively in the database is characterized in that described method comprises:
Convert key word to be compared to corresponding byte arrays, described key word comprises character string and numerical value;
When described byte arrays is converted to by numerical value, described byte arrays is reduced into value corresponding, determine described byte arrays size by the numerical values recited after relatively reducing; Otherwise, the direct size of more described byte arrays;
Size by the certain described key word of the size of the byte arrays after the comparison.
2. the method for claim 1 is characterized in that,, described byte arrays is reduced into before the step of value corresponding when described byte arrays is converted to by numerical value described, also comprises:
Judge whether described byte arrays is converted to by numerical value.
3. method as claimed in claim 2 is characterized in that, describedly judges whether described byte arrays is converted to specifically by numerical value and comprises:
When the length of described byte arrays identical and have exist in the sign pattern byte arrays at least one array value less than zero or the unsigned type byte arrays in exist at least one array value greater than 127 the time, judge that described byte arrays is converted to by numerical value;
Inequality when the length of described byte arrays, have do not exist in the sign pattern byte arrays at least one array value less than zero or the unsigned type byte arrays in do not exist at least one array value greater than 127 the time, judge that described byte arrays is not to be converted to by numerical value.
4. the method for claim 1 is characterized in that, described size by the certain described key word of the size of the byte arrays after the comparison specifically comprises:
When the byte arrays that has the byte arrays that converted by numerical value in the described byte arrays and converted by character string, mode by direct compare byte array size, maximum byte array in minimum byte arrays in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, perhaps the minimum byte arrays in the maximum byte array in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, obtain the size of whole byte arrays, and determine the size of whole key words according to the size of the whole byte arrays that obtain.
5. as claim 1 or 4 described methods, it is characterized in that the size of described direct compare byte array specifically comprises:
Determine the size of described byte arrays by the size of the array value that subscript is identical in the more described byte arrays of recycle ratio.
6. the method for claim 1 is characterized in that, describedly described byte arrays is reduced into value corresponding specifically comprises:
The contrary rule that converts byte arrays according to numerical value to is reduced into value corresponding with described byte arrays.
7. key word size device relatively in the database is characterized in that described device comprises:
Converting unit is used for converting key word to be compared to corresponding byte arrays, and described key word comprises character string and numerical value;
Comparing unit is used for when described byte arrays is converted to by numerical value described byte arrays being reduced into value corresponding, determines described byte arrays size by the numerical values recited after relatively reducing; Otherwise, the direct size of more described byte arrays;
Determining unit is used for the size by the certain described key word of byte arrays size after comparing.
8. device as claimed in claim 7 is characterized in that, also comprises:
Judging unit is used for judging whether described byte arrays is converted to by numerical value.
9. device as claimed in claim 8 is characterized in that, described judging unit comprises:
First determination module, be used for length when described byte arrays identical and have the sign pattern byte arrays exist at least one array value less than zero or the unsigned type byte arrays at least one array value of existence greater than 127 the time, judge that described byte arrays is converted to by numerical value;
Second determination module, be used for inequality when the length of described byte arrays, have the sign pattern byte arrays not exist at least one array value less than not existing at least one array value greater than 127 the time in zero or the unsigned type byte arrays, judge that described byte arrays is not to be converted to by numerical value.
10. device as claimed in claim 7 is characterized in that, described comparing unit comprises:
First comparison module is used for when described byte arrays is converted to by numerical value, and the contrary rule that converts byte arrays according to numerical value to is reduced into value corresponding with described byte arrays, determines described byte arrays size by the numerical values recited after relatively reducing;
Second comparison module, be used for when described byte arrays be not when being converted to by numerical value, determine the size of described byte arrays by the size of the array value that subscript is identical in the more described byte arrays of recycle ratio.
11. device as claimed in claim 7 is characterized in that, described determining unit specifically comprises:
During the byte arrays that is used for the byte arrays that converted by numerical value when described byte arrays existence and converted by character string, mode by direct compare byte array size, maximum byte array in minimum byte arrays in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, perhaps the minimum byte arrays in the maximum byte array in the described byte arrays that is converted by numerical value and the described byte arrays that is converted by character string is compared, obtain the size of whole byte arrays, and determine the size of whole key words according to the size of the whole byte arrays that obtain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210045641.XA CN103294694B (en) | 2012-02-27 | 2012-02-27 | The method and device that in a kind of data base, keyword size compares |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210045641.XA CN103294694B (en) | 2012-02-27 | 2012-02-27 | The method and device that in a kind of data base, keyword size compares |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103294694A true CN103294694A (en) | 2013-09-11 |
| CN103294694B CN103294694B (en) | 2016-09-14 |
Family
ID=49095586
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210045641.XA Expired - Fee Related CN103294694B (en) | 2012-02-27 | 2012-02-27 | The method and device that in a kind of data base, keyword size compares |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103294694B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101136035A (en) * | 2007-10-15 | 2008-03-05 | 金蝶软件（中国）有限公司 | Ordering method and system for different attribute haracter |
| US20090319511A1 (en) * | 2008-06-18 | 2009-12-24 | Neelakantan Sundaresan | Desirability value using sale format related factors |
| CN101751416A (en) * | 2008-11-28 | 2010-06-23 | 中国科学院计算技术研究所 | Method for ordering and seeking character strings |
| CN102158582A (en) * | 2011-04-25 | 2011-08-17 | 惠州Tcl移动通信有限公司 | Mobile terminal and number matching method thereof |
-
2012
- 2012-02-27 CN CN201210045641.XA patent/CN103294694B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101136035A (en) * | 2007-10-15 | 2008-03-05 | 金蝶软件（中国）有限公司 | Ordering method and system for different attribute haracter |
| US20090319511A1 (en) * | 2008-06-18 | 2009-12-24 | Neelakantan Sundaresan | Desirability value using sale format related factors |
| CN101751416A (en) * | 2008-11-28 | 2010-06-23 | 中国科学院计算技术研究所 | Method for ordering and seeking character strings |
| CN102158582A (en) * | 2011-04-25 | 2011-08-17 | 惠州Tcl移动通信有限公司 | Mobile terminal and number matching method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103294694B (en) | 2016-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101515298B (en) | Inserting method based on tree-shaped data structure node and storing device | |
| WO2020147488A1 (en) | Method and device for identifying irregular group | |
| CN109710405B (en) | Block chain intelligent contract management method and device, electronic equipment and storage medium | |
| CN100394393C (en) | Information system data consistency detection | |
| CN102231693A (en) | Method and apparatus for managing access authority | |
| CN105653554A (en) | File data comparison method and system | |
| CN105095287A (en) | LSM (Log Structured Merge) data compact method and device | |
| CN104424256B (en) | Bloom filter generation method and device | |
| CN100383788C (en) | Method for realizing system resources management | |
| CN105740337A (en) | Rapid event matching method in content-based publishing subscription system | |
| CN105320654A (en) | Dynamic bloom filter and element operating method based on same | |
| CN105045350A (en) | PCIE (Peripheral Component Interface Express) extension method and PCIE extension system | |
| CN103647850A (en) | Data processing method, device and system of distributed version control system | |
| CN103618744A (en) | Intrusion detection method based on fast k-nearest neighbor (KNN) algorithm | |
| CN101714166B (en) | Method and system for testing performance of large-scale multi-keyword precise matching algorithm | |
| Zhao et al. | Stabilization of jump linear systems with mode‐dependent time‐varying delays | |
| CN111046624A (en) | Method, device, equipment and medium for constructing chip module interface clock structure | |
| CN111813515A (en) | Multi-process-based task scheduling method and device, computer equipment and medium | |
| CN111813517A (en) | Task queue allocation method and device, computer equipment and medium | |
| CN111327492B (en) | Full link monitoring processing method | |
| CN104883394A (en) | Method and system for server load balancing | |
| US11409646B2 (en) | Method for releasing memory | |
| CN104010004A (en) | Method and system for establishing data transmission network | |
| CN103294694A (en) | Method and device for comparing sizes of keywords in database | |
| CN116457751A (en) | Write data access structure and chip |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160914 Termination date: 20190227 |