CN102694878B - Sectional ID (Identity) distributing method - Google Patents
Sectional ID (Identity) distributing method Download PDFInfo
- Publication number
- CN102694878B CN102694878B CN201210150276.9A CN201210150276A CN102694878B CN 102694878 B CN102694878 B CN 102694878B CN 201210150276 A CN201210150276 A CN 201210150276A CN 102694878 B CN102694878 B CN 102694878B
- Authority
- CN
- China
- Prior art keywords
- section
- available
- preassignment
- logic
- segment
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a sectional ID (Identity) distributing method and relates to a method for distributing object IDs of logic objects in a network management system. The sectional ID distributing method comprises the following steps of: A, acquiring object data of the distributed logic objects from a database; B, according to object types of the logic objects, updating object ID information of the distributed logic objects in a buffer; C, according to the object ID information, acquiring available object ID sections; and D, distributing the object IDs in the object ID sections. The sectional ID distributing method is simple to operate when the object IDs are distributed and not only has high distributing efficiency and recovery efficiency, but also has small occupied memory and is suitable to popularize when more logic objects are managed.
Description
Technical field
The present invention relates to the distribution method of the object ID (IDentity, identify label number) of object logic in network management system, be specifically related to a kind of segmented ID distribution method.
Background technology
In network management system, for the ease of management logic object (virtual objects of the network equipment in network management system), usually all object logics are carried out Unified number and distribution, the object ID that each object logic correspondence one is unique.When data interaction or interface interchange are carried out in network management system inside, object logic is all represented by the object ID corresponding to it and identify, carrying out recognition logic object by object ID not only can all object logic of unified management, and can avoid carrying out by object properties the object properties amendment that recognition logic object brings, cause the problem of relationship change between object.But, when the object logic managed is more, if the allocative efficiency of object logic distribution object ID is not high, then the operating efficiency of network management system can be had a strong impact on.
The distribution method of the existing object logic distribution object ID of giving adopts shaping to distribute and buffering distribution two kinds of forms usually, but these two kinds of methods exist following defect:
When shaping distributes (press integer distribute), the integer of employing 4 bytes carrys out the object ID of presentation logic object, and object ID increases progressively successively and to be numbered for object logic and to distribute from 1.When object logic is more, the object ID and the deletion that increase object logic do not use the operation of the object data of object ID meeting more frequent, the object ID that object logic is corresponding may reach the maximum of integer, object ID, once reach the maximum of integer, just needs from integer, reclaim available object ID (ID be not assigned with in integer is available object ID) and carrys out the corresponding object logic that need distribute.Following two kinds of methods are generally adopted during recycle object ID:
(1) from 1, travel through all integers, verify the integer traversed and whether be assigned to object ID, if the integer traversed is not assigned to object ID, then reclaim this integer as available object ID.The operating process of the method is fairly simple, but when object logic is more, owing to all needing to travel through all integers during each recycle object ID from 1, and more object logic can make the ID value in integer larger, therefore it is more that more object logic can make to travel through all integer's order, traversal efficiency reduces, and then makes organic efficiency lower.
(2) binary search, namely (0 is verified, whether median 0x3fffffff ((0+0x7fffffff)/2) 0x7fffffff) is assigned to object ID, if 0x3fffffff is not assigned to object ID, then the ID of 0x3fffffff is available objects ID; If 0x3fffffff is assigned to object ID, then compare (0,0x3fffffff) with (0x3fffffff, 0x7fffffff) two intervals, first interval less for the object ID be assigned with is stored, then get the median in this interval and verify median and whether be assigned to object ID.The median in the less interval of distribution object ID is constantly verified, until find the ID be not assigned with namely to can be used as available objects ID according to above method.When object logic is more, corresponding to object logic, the number of object ID is more, the interval that object ID is formed is longer, therefore the median in repeatedly between check field may be needed to be recovered to available object ID, not only operating process more complicated, and removal process is longer, organic efficiency is lower.
Above-mentioned two kinds of recovery methods when reclaiming available object ID all logically the number of object reclaim, namely newly-increased object logic is one, then reclaim once; Newly-increased object logic is two, then reclaim twice.When needing the object logic of management more, because the object ID reclaiming available object ID and assignment logic object is more frequent, and above-mentioned two kinds of recovery methods once can only reclaim an available object ID, therefore adopt above-mentioned two kinds of methods repeatedly to reclaim and could obtain more available objects ID, with the object logic that correspondence is more, organic efficiency is lower, and then makes allocative efficiency lower.
The object ID that buffering is distributed by all objects of counterlogic cushions, and during newly-increased object logic, cushions all Object ID information, and obtaining one according to the object ID list of buffering does not have the integer cushioned as available object ID; When deleting object logic, cushion the object data of all object IDs, from the object ID list of buffering, delete object ID corresponding with it.Because newly-increased object logic and deletion object logic all need the object data cushioning all object IDs, therefore when object logic is more, corresponding to buffer logic object, the object data of object ID is more, and the internal memory taking network management system is larger.
In sum, there are two shortcomings when distributing more object logic in the distribution method of the existing object logic distribution object ID of giving:
(1) reclaim the operation more complicated of available objects ID, organic efficiency is lower, and then the allocative efficiency of distribution object ID is reduced;
(2) internal memory taking network management system is comparatively large, is unsuitable for promoting.
Summary of the invention
For the defect existed in prior art, the object of the present invention is to provide a kind of segmented ID distribution method, it operates fairly simple when distribution object ID, when managing more object logic not only allocative efficiency and organic efficiency higher, and the internal memory taken is less, be suitable for promoting.
For reaching above object, the technical scheme that the present invention takes is: a kind of segmented ID distribution method, is characterized in that, comprises the steps: A, from database, obtains the object data of assignment logic object; B, upgrade the Object ID information of assignment logic object in buffering according to the object type of described object logic; C, obtain available object ID section according to described Object ID information; D, in described object ID section distribution object ID.
On the basis of technique scheme, before steps A, also comprise following flow process: according to the difference of management logic object type, the every logic of class object equal preassignment preassignment section of some.
On the basis of technique scheme, the flow process upgrading the Object ID information of assignment logic object in buffering described in step B is as follows: the object ID of described object logic and the object ID of present segment in buffering are compared, if the object ID of described object logic is greater than the largest object ID that present segment has distributed, and be less than or equal to the largest object ID of present segment, then upgrade the largest object ID that present segment has distributed; If the object ID of described object logic is greater than the largest object ID of present segment, the initial ID of section then upgrading present segment and the largest object ID distributed, and judge whether the largest object ID distributed after present segment upgrades belongs to the scope of preassignment section, if not then record upgrades the information of rear dynamic I D section belonging to present segment.
On the basis of technique scheme, the flow process obtaining available object ID section described in step C is as follows: judge whether present segment can continue to distribute ID, if so, then using present segment as available object ID section, otherwise from preassignment section, obtain available object ID section; If obtain from preassignment section less than available object ID section, then reclaim available object ID section; If reclaim less than available object ID section, then from dynamic segment, obtain available object ID section.
On the basis of technique scheme, the flow process of the object ID section that described recovery is available is as follows: obtain a preassignment section, judge whether the object ID in the preassignment section obtained all is not assigned with, if, then using the preassignment section that obtains as available object ID section, otherwise reclaim object ID section that preassignment Duan Zhongwei is assigned with as available object ID section; If all object IDs in the preassignment section obtained all are assigned with, then reclaim dynamic I D section as available object ID section.
On the basis of technique scheme, reclaim in the preassignment section that the described object ID Duan Yi distribution object ID be not assigned with is minimum.
On the basis of technique scheme, described recovery dynamic I D section is as follows as the flow process of available object ID section: obtain the dynamic I D section that distribution object ID is minimum, judge whether the object ID in described dynamic I D section is not all assigned with, if, then using described dynamic I D section as exhausting section, otherwise reclaim the object ID section that is not assigned with in described dynamic I D section as available object ID section.
On the basis of technique scheme, before steps A, also comprise following flow process: the reserved section that preassignment uses for expanding newly-increased object logic.
On the basis of technique scheme, the flow process of the ID of distribution object described in step D is as follows: in object ID section, obtain ID in available section, and the segment number of ID in described section and object ID section is synthesized new object ID.
On the basis of technique scheme, in the section that described acquisition is available, ID is than the smallest positive integral that distribution object ID is large in described object ID section.
Beneficial effect of the present invention is:
(1) classification that the present invention is different according to object logic, for every logic of class object is all assigned with the preassignment section of some.When for object logic distribution object ID, according to the classification of object logic, from preassignment section, preferentially adopt the mode distribution object ID increased progressively successively.If the object ID in preassignment section is all assigned, then travel through all preassignment sections, in preassignment section, reclaim available object ID section and distribution object ID in this paragraph; If reclaim less than available object ID section from preassignment section, then need assignment logic object type with reclaiming available object ID section in dynamic I D section and distribution object ID in this paragraph; If reclaimed from dynamic ID section less than available object ID section, then from untapped dynamic segment distribution object ID.Because preassignment section and dynamic segment are equipped with a corresponding segment number, therefore the present invention can carry out reclaiming available object ID section according to segment number, and reclaiming an available object ID section needs at most the number of times of traversal to be less than or equal to preassignment section number and dynamic segment number sum.Compared with background technology, the present invention at most only need travel through preassignment section number and dynamic segment number sum just can be recovered to available object ID, not only operate fairly simple, and more available objects ID can be reclaimed (suppose that the number of preassignment section is 50 while the number of times of traversal is less, each preassignment section can distribute 0xffff object ID, then available object ID is 50*65535, and the number of times reclaiming traversal mostly is 50 times most), traversal efficiency is higher, and then makes organic efficiency higher.
(2) after the present invention reclaims an available object ID section, the object logic just distribution object ID in this section distributed is needed, until all object IDs in this section reclaim the available section of the next one after being all assigned again.Because an available object ID section can distribute at most 0xffff object ID, therefore available in this section object ID is more, and more available objects ID greatly reduces the number of times reclaiming available object ID section, avoids frequent recovery, organic efficiency is higher, and then makes allocative efficiency higher.
(3) Object ID information of the different classes of object logic of the present invention is stored in such other object ID section, when increasing object logic or deleting object logic, do not need the object ID cushioning all object logics, only need the information of the object ID section of classification corresponding to buffer logic object.Compared with background technology, the object data that the present invention cushions when distribution object ID is less, and the internal memory taking network management system is less, is suitable for promoting.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of object ID model in the embodiment of the present invention;
Fig. 2 is the schematic diagram of object ID section preassignment model in the embodiment of the present invention;
Fig. 3 is the flow chart of ID distribution method in the embodiment of the present invention;
Fig. 4 is the flow chart upgrading buffer object id information in the embodiment of the present invention;
Fig. 5 is the flow chart obtaining available objects ID section in the embodiment of the present invention;
Fig. 6 is the flow chart reclaiming available objects ID section in the embodiment of the present invention.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.
Shown in Figure 1, embodiment of the present invention integer representation object ID of 4 bytes, object ID is made up of ID two parts in segment number and section, and segment number accounts for high 2 bytes, and in section, ID accounts for low 2 bytes.
Shown in Figure 2, according to the difference of object logic classification of management, every logic of class object equal preassignment preassignment section of some.The present invention's reserved section of some that has been also all object logic preassignment, reserved section keep for after after expansion newly-increased object logic use, the object ID in reserved section can not be assigned with.Object ID preferentially distributes and reclaims from preassignment section, after the object ID in preassignment section is all assigned, then distributes from dynamic segment.
Shown in Figure 3, the segmented ID distribution method that the embodiment of the present invention provides, comprises the following steps:
Step 101: the object data obtaining assignment logic object from DB (Data Base, database), with the object ID of initialization assignment logic object.
Step 102: according to the object type obtaining object logic, compares the object ID of object logic and the object ID of this class object present segment in buffering, upgrades the Object ID information distributed in buffering.
Step 103: the object ID in buffering is managed, in buffering this class object present segment in store the largest object ID that the segment number of present segment and present segment distributed.
Step 104: according to the information of distribution object ID in buffering, obtains an available object ID section.First obtain from preassignment section when obtaining available object ID section, if obtained less than available object ID section, then reclaim available object ID section, if reclaimed less than available object ID section, then from dynamic segment, obtain available object ID section.
Step 105: distribution object ID, in available object ID section, obtain ID in an available section (in section, ID is than by the smallest positive integral that ID is large in available object ID section) according to the mode that increases progressively successively, and the segment number of ID in section and available object ID section is synthesized a new object ID.
Below the method that the embodiment of the present invention provides is described in detail.
Shown in Figure 4, step 102 comprises the following steps:
Step 201: the object ID of current logic object and the object ID of this object type present segment in buffering are compared.If the object ID of current logic object is more than or equal to the smallest object ID of present segment, and be less than or equal to the largest object ID of present segment, then this object ID belong to present segment section in ID, forward step 202 to; If the object ID of current logic object is greater than the largest object ID of present segment, then forward step 204 to; If the object ID of current logic object is less than the smallest object ID of present segment, then completes the renewal of Object ID information in buffering, and terminate.
Step 202: judge if so, then to forward the largest object ID whether object ID is greater than present segment and has distributed step 203 to, otherwise complete the renewal of Object ID information in buffering, and terminate.
Step 203: upgrade the largest object ID that present segment has distributed, the largest object ID that it can be used as the segment number of present segment and distributed, and terminate.
Step 204: upgrade the initial ID of section of present segment and the largest object ID that distributed, the segment number of present segment and the largest object ID that distributed after storage update.
Step 205: judge whether the largest object ID distributed after present segment upgrades belongs to the scope of preassignment section, if so, then completes the renewal of Object ID information in buffering and terminates; Otherwise illustrate that the present segment after present segment renewal belongs to the scope of dynamic segment, forward step 206 to.
Step 206: record the information of dynamic I D section and terminate.
Dynamic I D segment information comprises object type and the segment number of object logic, because dynamic segment can distribute the object logic of any classification, therefore need to record and corresponding with present segment belong to any logic of class object by dynamic I D section, to ensure the segment number that can obtain the dynamic segment used when reclaiming available object ID according to object type, accomplish quick recovery.
To compare with object ID in buffering and in the process that upgrades at the object ID of current logic object, need the object data of load logic object successively from database, often load the object logic of a kind, the object type different according to current logic object is needed to compare and upgrade, the segment number of present segment obtained after upgrading and the largest object ID distributed are buffered in internal memory, and as the primary data of the available object ID section of acquisition one.
Shown in Figure 5, step 104 comprises the following steps:
Step 301: judge whether present segment can continue distribution object ID, if (the largest object ID distributed in present segment is less than the largest object ID value of this section), then forwards step 305 to, otherwise forwards step 302 to.
Step 302: the segment number obtaining an object ID section from the preassignment segment number of object type belonging to current logic object, obtaining rule is: the segment number obtaining the section of larger than the segment number of present segment 1 in preassignment section.
Step 303: judge whether the segment number of the object ID section obtained belongs to preassignment segment limit (present segment in step 301 is likely last section in preassignment section), if, then using this section as present segment, later object ID will distribute from this section, until this section is all assigned, and forward step 304 to; Otherwise the object ID section obtained less than available is described in preassignment section, forwards step 306 to.
Step 304: to upgrade in buffering largest object ID in the segment number of this class object present segment and section.
Step 305: obtain present segment, terminates present segment as available object ID section.
Step 306: reclaim an available object ID section: first reclaim from preassignment section during recovery, if the object ID in preassignment section is all assigned (namely not having available object ID), then reclaim existing object data object classification use dynamic I D section.Priority reclamation preassignment section is that the object ID in order to ensure generic object logic as far as possible drops in preassignment section all as far as possible; Because the number of the preassignment section of every logic of class object is all fewer, and reclaim the number of times that preassignment section need travel through and be less than or equal to preassignment section number, the traversal number of times therefore reclaiming preassignment section is less, and organic efficiency is higher.
Step 307: judge whether there is available object ID (object ID in the object ID section of recovery may distribute) in the object ID section reclaimed, if so, forward step 308 to, otherwise forward step 310 to.
Step 308: the segment number of the object ID section of recovery and available object ID are updated in buffering.
Step 309: obtain the object ID section reclaimed, it can be used as available object ID section and terminate.
Step 310: obtain an object ID section (recording in step 106 by the information of dynamic segment) from untapped dynamic segment.
Step 311: judge whether can get an available object ID section in the object ID section obtained, if so, then forward step 312 to, otherwise judge to obtain available object ID segment fault, and terminate.
Step 312: dynamic segment information (record has used object type and the segment number of object logic) and such object logic present segment information of upgrading such object logic in buffering.
Step 313: obtain present segment, terminates present segment as available object ID section.
Shown in Figure 6, in step 306, the concrete steps of the object ID section that recovery one is available are as follows:
Step 401: obtain a preassignment segment number.
Step 402: the number obtaining the object ID that this section has been assigned with from memory object tree.
Step 403: judge that whether the object ID obtained in preassignment section is not all assigned with, and if so, then forwards step 404 to, otherwise forwards step 405 to.
Step 404: record obtains the segment number of preassignment section, this section is recovered as available object ID section and terminates.
Step 405: store obtain preassignment section segment number and this section in the number of distribution object ID, cushion the segment number of the preassignment section of distribution object ID minimum (resource is the abundantest).
Store according to the minimum value in available objects ID interval and maximum segmentation when storing the number of available objects ID.Due to frequent recovery will be avoided in the process of recycle object ID section, the section (section that available objects ID is maximum) therefore needing Resource recovery the abundantest; Owing to storing by section when object ID stores, and record the number of every section of distribution object ID, therefore can by the abundantest section of the quick Resource recovery of section during recycle object ID section.
Step 406: judge whether all to have traveled through all preassignment sections, if so, then forward step 408 to, otherwise forward step 407 to.
Step 407: obtain next segment number from preassignment segment number, and again forward step 402 to.
Step 408: judge whether there is available object ID (object ID in all preassignment sections may all be assigned with) in the preassignment section obtained, if so, then forward step 412 to, otherwise forward step 409 to.
Step 409: the dynamic I D section of traversal existing object data object classification, obtains the segment number of the section that distribution object ID is minimum in dynamic I D section.
Step 410: judge whether there is available object ID (object ID in dynamic I D section may all be assigned with) in the dynamic I D section obtained, if so, then forward step 411 to, otherwise judge recycle object ID segment fault and terminate.
Step 411: judge whether the object ID obtaining dynamic I D section is not all assigned with, if (the object ID number be assigned with in dynamic I D section is 0), then this section is recovered as available object ID section and terminates, otherwise forwarding step 412 to.
Step 412: obtain the object ID distributed from memory object tree.
Step 413: stored by section by the object ID be not assigned with, terminates the object ID section after storing as available object ID section.
For the object ID section reclaimed, the partial objects ID in its section may be the object ID be assigned with, and only has the object ID be not assigned with could as available object ID.In order to reduce the memory cost cushioning all available object IDs and bring in internal memory, in internal memory, be divided into irregular segment to store by length the available objects ID in the object ID section of recovery, not only during buffering, committed memory is less, and higher according to the allocative efficiency of the segment number distribution object ID of object ID section.
The present invention is not limited to above-mentioned execution mode, and for those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvements and modifications, these improvements and modifications are also considered as within protection scope of the present invention.The content be not described in detail in this specification belongs to the known prior art of professional and technical personnel in the field.
Claims (8)
1. a segmented ID distribution method, is characterized in that, comprises the steps:
A, difference according to management logic object type, every logic of class object equal preassignment preassignment section of some; The object data of assignment logic object is obtained from database;
B, upgrade the Object ID information of assignment logic object in buffering according to the object type of described object logic: the object ID of described object logic and the object ID of present segment in buffering are compared, if the object ID of described object logic is greater than the largest object ID that present segment has distributed, and be less than or equal to the largest object ID of present segment, then upgrade the largest object ID that present segment has distributed; If the object ID of described object logic is greater than the largest object ID of present segment, the initial ID of section then upgrading present segment and the largest object ID distributed, and judge whether the largest object ID distributed after present segment upgrades belongs to the scope of preassignment section, if not then record upgrades the information of rear dynamic I D section belonging to present segment;
C, obtain available object ID section according to described Object ID information;
D, in described object ID section distribution object ID.
2. segmented ID distribution method as claimed in claim 1, it is characterized in that, the flow process obtaining available object ID section described in step C is as follows: judge whether present segment can continue to distribute ID, if, then using present segment as available object ID section, otherwise from preassignment section, obtain available object ID section; If obtain from preassignment section less than available object ID section, then reclaim available object ID section; If reclaim less than available object ID section, then from dynamic segment, obtain available object ID section.
3. segmented ID distribution method as claimed in claim 2, it is characterized in that: the flow process of the object ID section that described recovery is available is as follows: obtain a preassignment section, judge whether the object ID in the preassignment section obtained all is not assigned with, if, then using the preassignment section that obtains as available object ID section, otherwise reclaim object ID section that preassignment Duan Zhongwei is assigned with as available object ID section; If all object IDs in the preassignment section obtained all are assigned with, then reclaim dynamic I D section as available object ID section.
4. segmented ID distribution method as claimed in claim 3, is characterized in that: reclaim in the preassignment section that the described object ID Duan Yi distribution object ID be not assigned with is minimum.
5. segmented ID distribution method as claimed in claim 3, it is characterized in that: described recovery dynamic I D section is as follows as the flow process of available object ID section: obtain the dynamic I D section that distribution object ID is minimum, judge whether the object ID in described dynamic I D section is not all assigned with, if, then using described dynamic I D section as exhausting section, otherwise reclaim the object ID section that is not assigned with in described dynamic I D section as available object ID section.
6. segmented ID distribution method as claimed in claim 1, is characterized in that, also comprise following flow process before steps A: the reserved section that preassignment uses for expanding newly-increased object logic.
7. segmented ID distribution method as claimed in claim 1, it is characterized in that, the flow process of the ID of distribution object described in step D is as follows: in object ID section, obtain ID in available section, and the segment number of ID in described section and object ID section is synthesized new object ID.
8. segmented ID distribution method as claimed in claim 7, is characterized in that: in the section that described acquisition is available, ID is than the smallest positive integral that distribution object ID is large in described object ID section.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210150276.9A CN102694878B (en) | 2012-05-16 | 2012-05-16 | Sectional ID (Identity) distributing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210150276.9A CN102694878B (en) | 2012-05-16 | 2012-05-16 | Sectional ID (Identity) distributing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102694878A CN102694878A (en) | 2012-09-26 |
| CN102694878B true CN102694878B (en) | 2015-01-14 |
Family
ID=46860159
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210150276.9A Active CN102694878B (en) | 2012-05-16 | 2012-05-16 | Sectional ID (Identity) distributing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102694878B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103034492B (en) * | 2012-12-06 | 2016-01-20 | 广东欧珀移动通信有限公司 | A kind of Android device resource ID fragmented allotment approach and system |
| CN103465750B (en) * | 2013-09-12 | 2015-07-08 | 南京奥特佳新能源科技有限公司 | Dynamic-ID-based (dynamic identity based) automobile multi-temperature-zone electric compressor operation intelligent control method |
| CN105812248A (en) * | 2016-05-09 | 2016-07-27 | 腾讯科技（深圳）有限公司 | Distribution method and device for identification value |
| CN106777178A (en) * | 2016-12-22 | 2017-05-31 | 上海大汉三通无线通信有限公司 | The storage method and querying method of a kind of phone number |
| CN108509535B (en) * | 2018-03-15 | 2020-12-01 | 烽火通信科技股份有限公司 | Resource ID management system and method based on interval |
| CN110933196B (en) * | 2019-11-26 | 2022-12-06 | 上海莉莉丝科技股份有限公司 | ID distribution method, system and storage medium for global uniform framework |
-
2012
- 2012-05-16 CN CN201210150276.9A patent/CN102694878B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| 网管系统中逻辑对象编号方法;熊胜等;《电信技术》;20120131;第64页左栏第8行-第65页左栏倒数第2段 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102694878A (en) | 2012-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102694878B (en) | Sectional ID (Identity) distributing method | |
| CN103365788B (en) | The adaptive local rubbish recovering method that real-time flash memory conversion layer uses | |
| CN102629234B (en) | Fast retrieval method for data of built-in Flash of single chip microcomputer | |
| CN103995855B (en) | The method and apparatus of data storage | |
| CN103514212B (en) | Method for writing data and system | |
| CN103116627B (en) | A kind of method and system of high concurrent SOA technology access database | |
| CN104239417A (en) | Dynamic adjustment method and dynamic adjustment device after data fragmentation in distributed database | |
| CN104238962A (en) | Method and device for writing data into cache | |
| CN111737355B (en) | Heterogeneous data source synchronization method and system based on MongoDB metadata management | |
| CN103678158B (en) | A kind of data layout optimization method and system | |
| CN103617124B (en) | Flash memory management method and device | |
| CN104156396A (en) | Method and system for improving database performance in big-data environment | |
| CN101763415A (en) | Method and device for generating B tree index of database | |
| CN105677238A (en) | Method for distributed storage based data deduplication on virtual machine system disk | |
| CN104346404A (en) | Method, equipment and system for accessing data | |
| CN106326040A (en) | Method and device for managing snapshot metadata | |
| CN101710322A (en) | Method and system for associating information | |
| CN107463333B (en) | Method, device and system for recovering network hard disk space | |
| CN103593300A (en) | Memory allocating and collecting method | |
| CN103780263B (en) | Device and method of data compression and recording medium | |
| CN101917282B (en) | Method, device and system for processing alarm shielding rules | |
| CN111752905B (en) | Large file distributed cache system based on object storage | |
| CN105930380A (en) | Chart monitor method and device based on HADOOP | |
| CN111625596A (en) | Multi-source data synchronous sharing method and system for real-time consumption scheduling of new energy | |
| CN107342944B (en) | A kind of distribution of ID mark and persistence method and system |
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 |