CN101350869A - Method and apparatus for removing repeat of telecom charging based on index and hash - Google Patents
Method and apparatus for removing repeat of telecom charging based on index and hash Download PDFInfo
- Publication number
- CN101350869A CN101350869A CNA2007101370078A CN200710137007A CN101350869A CN 101350869 A CN101350869 A CN 101350869A CN A2007101370078 A CNA2007101370078 A CN A2007101370078A CN 200710137007 A CN200710137007 A CN 200710137007A CN 101350869 A CN101350869 A CN 101350869A
- Authority
- CN
- China
- Prior art keywords
- key assignments
- ticket
- file
- internal memory
- index 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides an index array and linked list-based key value document organization method: a 'index-linked list' way; a method of de-duplication for telecom call tickets on key value documents based on the 'index-linked list' way and a key value elimination method on key value documents based on the 'index-linked list' way.
Description
Technical field
The invention belongs to the telecom charging field, relate in particular in the telecom charging support system repeating the elimination method of ticket.
Background technology
Go heavily to be meant and in the charging support system of telecommunications industry, find out repetition ticket the ticket in certain business, certain specified scope, and reject and repeat ticket to keep the process of single ticket with identical charging feature.Briefly, the uniqueness process that guarantees charging bill is gone heavily exactly.
Owing to the limitation of program controlled switch technology, the otherness that charging point is selected, the reasons such as diversity of class of business, it is inevitable that the repetition ticket is arranged in the Original CDR of charging support system collection.If do not reject repeating ticket, will cause to the user repeat charge, to the business income repeat serious problems such as statistics, therefore, in the charging support system, must be in time repeating the ticket rejecting.
It is exactly that fields such as the time of giving orders or instructions with the effect of uniqueness sign, calling number, called number, ticket type in all tickets in the selected certain limit are removed heavy element as charging that ticket goes heavy basic ideas, when handling new ticket, go the charging of new ticket heavy element and the ticket that has write down to mate, if the identical list of then attaching most importance to.It is pointed out that charges goes heavy element to be not limited to here to be spelt out.
In actual applications, detect and reject the repetition ticket and need expend a large amount of system resource from the ticket of magnanimity, comprise CPU, internal memory, hard drive space etc., this often becomes the bottleneck of systematic function.Therefore, the rejecting of repetition ticket is the key technology in the charging support system, also is difficult point wherein.
The current heavy technology of going in telecommunication charging system mainly contains following three kinds:
1. the text based on ordering goes heavily: going heavy ticket to put together, go the heavy element ordering by charging, reject out repeating ticket by the text comparison between the adjacent ticket then.
The shortcoming of this method is heavy will putting together ticket static state before, so do not support real-time ticket processing mode; When traffic carrying capacity increased, treatment effeciency descended rapidly, and it heavily is unpractiaca using the method to go in the charge system of high traffic.
2. utilize the unique key index of database to go heavily: detailed single warehouse-in, to remove to set up on the heavy element unique key index, guarantee the uniqueness of ticket to realize that ticket removes weight by the unique constraints of DBMS (data base management system) in the charging in detailed single storehouse.
The weak point of this method is that deduplicated efficiency depends critically upon performance of database, database is very big to the expense that the unique key index upgrades during bill storage, when putting in storage after the call bill data amount acquires a certain degree, the decline of exponential form can appear in bill storage efficient, thereby drag the treatment effeciency of slow whole charge system and make systematic function become unstable, can not satisfy the requirement of charge system; Under hundred million grades high traffic, detailed single warehouse-in means that database space takies the disk storage of huge amount, and is all very difficult to management, the maintenance of database.
3. time slip-window removing repeat method: the method only is applicable to charge goes to include in the heavy element business of the time of giving orders or instructions, and the prerequisite of using the method is that charge system is the acquisition order charging bill that increases progressively according to the time of giving orders or instructions.To safeguard a time window in system, the ticketing that has write down in this time window in one period of giving orders or instructions goes heavy element information.When handling ticket, check at first whether the time of giving orders or instructions of ticket drop within the time window scope, if, just in time window, search the ticket that whether has identical charge information, if any just representing this ticket list of attaching most importance to, as do not have, just the charge information with this ticket is updated into time window, simultaneously whole time window is moved backward, the charge information of the ticket of throughput time window scope is abandoned automatically.
This method treatment effeciency is higher, but weak point also clearly: it goes not comprise in the heavy element the professional inapplicable of the time of giving orders or instructions to charging, and to the ticket of the time of giving orders or instructions before time window, because charge information is dropped, so can't go heavily, need be aided with other and go heavy means, be not a kind of comprehensive solution.
The telecom charging support system is a kind of than the special computers system, and its data volume to be processed is huge, the handling process complexity, require very high to systematic function, for satisfying customer requirement and market competition needs, charge system generally develops towards the real time implementation direction, and is higher to the requirement in process limited.And three kinds of removing repeat methods generally using in charge system at present exist and do not support variety of issues such as real-time processing, inefficiency, performance shakiness, solution be not comprehensive.Therefore, the objective of the invention is to solve the problem that exists in the present charge system removing repeat method, for going to bring up again for efficient, method in common.
Summary of the invention
The technical problem to be solved in the present invention is, at the prior art defective, designs that efficient, general repetition ticket is searched, recognition methods and to the recording method of the charge information of handling ticket.
For achieving the above object, the invention provides a kind of key assignments file organization mode: " index-chained list " mode based on array of indexes and chained list; A kind of ticket removing repeat method and a kind of key assignments removing method based on " index-chained list " mode key assignments file based on " index-chained list " mode key assignments file.
Description of drawings
Introduce the present invention in detail below with reference to accompanying drawing, wherein
Fig. 1 shows the structural representation according to " index-chained list " of the present invention mode key assignments file;
Fig. 2 shows the flow chart according to the ticket removing repeat method based on " index-chained list " mode key assignments file of the present invention;
Fig. 3 shows the flow chart according to the key assignments removing method based on " index-chained list " mode key assignments file of the present invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with the referenced drawings preferred embodiment.
At first introduce according to the key assignments file organization mode based on array of indexes and chained list of the present invention, i.e. " index-chained list " mode with reference to figure 1.Figure 1 illustrates structural representation according to " index-chained list " of the present invention mode key assignments file.As shown in Figure 1, a key assignments file comprises index area and chain list area two parts, and the index area is the array of a regular length, and each element of array is a head pointer that points to a single-track link table.
In the method according to the invention, the function of index area in the key assignments file and chain list area is as follows: the length of establishing the index area array is N, then one or more chargings in the charging bill are gone heavy element to be mapped as the integer value of a value between 0 to N-1 by certain calculation, this integer value is called as index value, and this index value is exactly the subscript of array in the index area; Go the charging in the charging bill heavy element to calculate an integer value by hash function, this integer value is called as the Multiple Bonds value, element in the chain list area in each chained list is stored be exactly the identical ticket of index value go the Multiple Bonds value, each linked list element is deposited one and is gone the Multiple Bonds value.
Introduce according to the ticket removing repeat method based on " index-chained list " mode key assignments file of the present invention in detail below with reference to Fig. 2.Before introducing, define three parameters earlier according to the ticket removing repeat method based on " index-chained list " mode key assignments file of the present invention:
Parameter A: the classifying mode of removing Multiple Bonds value file.Select to charge and to go the component that granularity is bigger in the heavy element to sort out the key assignments file, for example can sort out by the time of giving orders or instructions, each hour a key assignments file, also sort out for preceding four of available calling number;
B parameter: the computing function of index value.Setting array of indexes length is N, selects one to two charging to go heavy element to obtain index value with simple calculations;
Parameters C: remove the computing function of Multiple Bonds value, use a kind of ashing technique to go charging heavy element to be converted to an integer value.For example general hash function be can use, CRC cyclic redundancy check (CRC), MD5 etc. comprised.
Fig. 2 shows the flow chart according to the ticket removing repeat method based on " index-chained list " mode key assignments file of the present invention.As shown in Figure 2, the ticket removing repeat method based on " index-chained list " mode key assignments file according to the present invention may further comprise the steps:
100 according to the classifying mode of removing Multiple Bonds value file (parameter A), judges the key assignments file that ticket belonged to;
101 computing functions according to index value (B parameter) calculate the index value of ticket, and go the Multiple Bonds value according to what the computing function that goes the Multiple Bonds value (parameters C) calculated ticket;
102 judge the key assignments file whether in internal memory, if in internal memory, then advance to step 103; On the contrary, if not in internal memory, then advance to step 105;
103 navigate to and remove Multiple Bonds value file accordingly, navigate to the linked list head pointer according to index value;
104 search the Multiple Bonds value in chained list, if can find identical key assignments, judge that then this ticket is heavy single, and method finishes; If can not find, judge that then this ticket is not heavy single, and going Multiple Bonds value chain to go into the chained list end, method finishes;
105 judge whether there is this key assignments file in the disk file system, if exist, then advance to step 106; Otherwise,, then advance to step 109 if do not exist;
106 judge whether the internal memory Free Region is enough for this key assignments file, if not enough, then advance to step 107; If enough, then advance to step 108;
107 according to " least recently used " principle the key assignments file that meets the exchange condition in the internal memory to changing to disk file system, to discharge enough region of memorys;
The key assignments file of 108 ticket correspondences is called in the internal memory clear area, connects step 103 then;
109 judge whether the internal memory Free Region is enough, if not enough, then advance to step 1010; If enough, then advance to step 1011;
1010 according to " least recently used " principle the key assignments file that meets the exchange condition in the internal memory to changing to disk file system, to discharge enough region of memorys;
Internal memory clear area of 1011 initialization;
1012 in initialized region of memory, navigates to the linked list head pointer according to index value, key assignments is inserted in this chained list, and judges that this ticket is not heavy single, and method finishes.
On the other hand, in telecommunication charging system, through regular meeting because of a variety of causes; need carry out " negative operation " to a collection of ticket; promptly eliminate this batch ticket all results in charge system, the system that makes is returned to the state of untreated this batch ticket, and this is called as rollback.Rollback corresponds to heavily and handles, and is exactly the key assignments that will remove ticket in the key assignments file.Below with reference to Fig. 3 introduction according to the key assignments removing method based on " index-chained list " mode key assignments file of the present invention.
Fig. 3 shows the flow chart according to the key assignments removing method based on " index-chained list " mode key assignments file of the present invention.As shown in Figure 3, the key assignments removing method based on " index-chained list " mode key assignments file according to the present invention may further comprise the steps:
200 according to the classifying mode of removing Multiple Bonds value file (parameter A), judges the key assignments file that ticket belonged to;
201 computing functions (B parameter) computation index value according to index value, and calculate according to the computing function that goes the Multiple Bonds value (parameters C) and to go the Multiple Bonds value;
202 judge the key assignments file whether in internal memory, if in internal memory, then advance to step 203; If not in internal memory, then connect step 205;
203 navigate to ticket and remove Multiple Bonds value file accordingly, and navigate to the linked list head pointer according to index value;
204 search the Multiple Bonds value in chained list, if can find identical key assignments, then the identical chained list node of Multiple Bonds value that goes that contains that finds is removed, and method finishes; If can not find, judge that then the key assignments of this ticket does not generate, method finishes;
205 judge whether there is this key assignments file in the disk file system, if exist, then connect step 206; If do not exist, judge that then the key assignments of this ticket does not generate, method finishes;
206 judge whether the internal memory Free Region is enough for this key assignments file, if not enough, then connect step 207; If enough, then connect step 208;
207 according to " least recently used " principle the key assignments file that meets the exchange condition in the internal memory to changing to disk file system, to discharge enough region of memorys;
The key assignments file of 208 ticket correspondences is called in the internal memory clear area, advances to step 203 then.
Below describe in detail with reference to the accompanying drawings according to ticket removing repeat method and the key assignments removing method based on " index-chained list " mode key assignments file of the present invention.According to technique scheme as can be known, the present invention combines by hash calculating, index search and chained list are searched, and greatly having improved charges goes the efficient heavily handled.And, just can remove weight, and not be subjected to the restriction of method any ticket as long as the key assignments file has preservation.And method of the present invention can be supported the mode handled in real time, is a general and comprehensive charging bill removing repeat method.
Compare the method according to this invention have the following advantages (for ease of carrying out the comparison of algorithm complex, establishing the ticket total amount in the argumentation below is M) with ticket removing repeat method of the prior art:
1. the algorithm complex average case based on the text removing repeat method that sorts is O (Mlog in the prior art
2M), i.e. the complexity of algorithm and Mlog
2M is linear, and it does not support real-time processing.And the method according to this invention, it all is O (1) that the algorithm complex of Multiple Bonds value and index value is removed in calculating, be that algorithm complex and M are irrelevant, but constant, if and the quantity of key assignments file is K, the maximum of array of indexes is N, and then the algorithm complex average case on chained list is searched is O (M/ (NK)).Usually, the N value is 10
5～10
6Between, so pass through more as can be seen, the complexity of the method according to this invention greatly reduces, and the method according to this invention support is handled in real time;
2. utilize the algorithm complex of unique key index removing repeat method of database relevant in the prior art with the design of DBMS, but no matter adopt which kind of DBMS, rearrangement to the unique key index tree under the situation of mass data is the very big work of expense all the time, and this complexity is determined that by DBMS the designer of charge system and user are difficult to take effective measures and intervene and improvement; In addition, the maintenance of data and cleaning are the comparatively work of difficulty in the high-volume database.And the method according to this invention provides very big flexibility for the user: go classifying mode, the index value of Multiple Bonds value file computing function, to remove the computing function of Multiple Bonds value all be the parameter of algorithm, the user can be according to business characteristic, host memory capacity, I/O performance etc., by setting, come the complexity of control algolithm and to the requirement of I/O to these parameters.And, in the method according to the invention, go the Multiple Bonds value to deposit with document form clocklike, safeguard easily;
3. in the time slip-window removing repeat method in the prior art,,,, go heavy means and need be aided with other so can't go heavily because charge information is dropped for the ticket of the time of giving orders or instructions before time window; In addition, go not comprise in the heavy element situation of the time of giving orders or instructions for the charging of business, this algorithm is inapplicable, so it is not a kind of comprehensive solution.And the method according to this invention to the business that is suitable for without limits, and as long as the key assignments file has preservation, just can remove weight to any ticket.
Ticket removing repeat method based on " index-chained list " mode key assignments file according to the present invention can be applicable to various telecommunication service charging support systems.Below introduce three concrete embodiment that use of the method according to this invention.
Embodiment 1:200 card business charge system
This service billing is that a kind of common talk business is chargeed.The feature of the actual conversation of telecommunication service traffic is evenly to distribute by the time of giving orders or instructions basically, and also to be the charging of this business remove one of heavy element the time of giving orders or instructions, so the selected foundation of time as the computation index value of giving orders or instructions.Simultaneously, in realization, in order to increase the hash degree of index value, and control remove Multiple Bonds value file size, last two occurrence probabilities of considering the regular phone number are balanced, so append last two foundations as the computation index value of called number, it is as follows concrete parameter to be set:
Parameter A (going the classifying mode of Multiple Bonds value file): sort out by the time of giving orders or instructions, per hour a key assignments file;
B parameter (computing function of index value): array of indexes length N=3.6X10
5, computing formula is last two of ((time the number of minutes X60 gives orders or instructions)+number second time of giving orders or instructions) X100+ called number;
Parameters C (removing the computing function of Multiple Bonds value): go the character string combination of heavy element " calling number ", " called number ", " card number " to carry out the CRC cyclic redundancy to charging and calculate.
Embodiment 2: the prepayment service charge system
The characteristics of prepayment service are various tickets such as comprise conversation, supplement with money, deduct fees, and wherein the monthly rent withholding carries out at every month synchronization, and the time of giving orders or instructions of this type of ticket deducts fees the time exactly, and identical ticket of time therefore can occur giving orders or instructions in a large number.When using the method according to this invention, if only with the Time Calculation index value of giving orders or instructions, the index value that a large amount of tickets just may occur is identical, and the order that need carry out chained list compares, and has a strong impact on treatment effeciency.Therefore, this method can use the time of giving orders or instructions and fee-based number to combine the computation index value in the enforcement of this charge system, thereby increases the hash degree, obtains high processing efficient, and it is as follows that concrete parameter can be set:
Parameter A (going the classifying mode of Multiple Bonds value file): sort out by the time of giving orders or instructions, per hour a key assignments file;
B parameter (computing function of index value): array of indexes length N=10
6, the intercepting fee-based number remove after the area code the 2nd to the 7th as index value;
Parameters C (removing the computing function of Multiple Bonds value): go the character string combination of heavy element " calling number ", " called number ", " fee-based number ", " giving orders or instructions the time ", " ticket classification " to carry out the MD5 hash to charging and calculate.
Embodiment 3:11808 toll message accountion system
In 11808 toll message accountion systems, require to handle ticket for the ease of minute local network, go Multiple Bonds value file must divide local network to deposit.For this reason, the method according to this invention adds the factor of local network to the classification of removing Multiple Bonds value file in the enforcement of this system, so just cause Multiple Bonds value quantity of documents to increase, and key assignments file scheduling frequency increases.For fear of therefore influencing treatment effeciency, be the length setting of array of indexes less value in force, i.e. the size that Multiple Bonds value file is removed in control reduces the I/O of system amount, and it is as follows that concrete parameter can be set:
Parameter A (going the classifying mode of Multiple Bonds value file): sort out by " the local network code of giving orders or instructions+give orders or instructions the time ", each local network is a key assignments file per hour;
B parameter (computing function of index value): array of indexes length N=3600, computing formula: (time the number of minutes X60 gives orders or instructions)+number second time of giving orders or instructions;
Parameters C (removing the computing function of Multiple Bonds value): to charging go heavy element " calling number ", " called number ", the character string combination carry out the MD5 hash and calculate.
Though below describe the present invention in conjunction with the preferred embodiments in detail, the present invention is not limited to the concrete introduction of the foregoing description.The present invention can further upgrade, and perhaps new in addition to feature disclosed in this invention combination comprises any relevant claim and accompanying drawing, also can upgrade or newly makes up any method disclosed in this invention or process.
Claims (32)
1. method that produces ticket key assignments file comprises:
Generating length is the array of N, and the head pointer of a single-track link table is pointed in each element storage of wherein said array;
Go heavy element to determine the index value of described ticket according to one or more chargings of ticket, wherein said index value is the integer of value between 0 to N-1;
Go heavy element to determine the key assignments of described ticket according to the charging of described ticket;
With the key assignments of described ticket store in the described array with the corresponding element of the index value of described ticket chained list pointed in.
2. according to the method for the generation ticket key assignments file of claim 1, wherein determine the key assignments of described ticket by the hash function computing of the charging of described ticket being removed heavy element.
3. according to the method for the generation ticket key assignments file of claim 1 or 2, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
4. ticket removing repeat method comprises:
Key assignments file determining step is determined the key assignments file that ticket belongs to;
Index value and key assignments determining step go heavy element to determine the index value and the key assignments of described ticket according to the charging of described ticket;
Positioning step navigates to a linked list head pointer of determined key assignments file based on the index value of described ticket;
Determining step is searched the key assignments of described ticket in described head pointer chained list pointed, if find identical key assignments, then judge the described ticket list of attaching most importance to; If do not find identical key assignments, judge that then described ticket is not heavy single, and the key assignments chain of described ticket is gone into described chained list end.
5. according to the ticket removing repeat method of claim 4, wherein determine the key assignments of described ticket by the hash function computing of the charging of described ticket being removed heavy element.
6. according to the ticket removing repeat method of claim 4, before the wherein said positioning step, judge that determined key assignments file is whether in internal memory:
If described key assignments file in internal memory, then continues described positioning step and determining step in internal memory;
If described key assignments file not in internal memory, judges then whether described key assignments file exists:
If described key assignments file exists, then described key assignments file is called in the internal memory, in internal memory, continue described positioning step and determining step then;
If described key assignments file does not exist, then in internal memory, generate determined key assignments file, insert in the chained list of the key assignments file that is generated according to the index value of described ticket key assignments, and judge that described ticket is not heavy single described ticket.
7. according to the ticket removing repeat method of claim 6, wherein before the key assignments file is called in internal memory, judge whether the Free Region of internal memory is enough for described key assignments file:
If the Free Region of internal memory is enough for described key assignments file, then described key assignments file is called in the Free Region of internal memory;
If the Free Region of internal memory is for described key assignments file deficiency, then with the specific key assignments file in the internal memory to changing to disk file system, to discharge enough internal memory Free Regions, then described key assignments file is called in the Free Region of internal memory.
8. according to the ticket removing repeat method of claim 6, wherein in internal memory, generate before the determined key assignments file, judge whether the Free Region of internal memory is enough for generating determined key assignments file:
If enough, then generate determined key assignments file;
If not enough, then with the specific key assignments file in the internal memory to changing to disk file system, to discharge enough region of memorys, generate determined key assignments file then.
9. according to the ticket removing repeat method of claim 7 or 8, wherein will meet the key assignments file of exchange condition in the internal memory to changing to disk file system according to " least recently used " principle.
10. according to the ticket removing repeat method of claim 4, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
11. a method of removing key assignments from ticket key assignments file comprises:
Key assignments file determining step is determined the key assignments file that ticket belongs to;
Index value and key assignments determining step go heavy element to determine the index value and the key assignments of described ticket according to the charging of described ticket;
Positioning step navigates to a linked list head pointer of determined key assignments file based on the index value of described ticket;
Remove step, in described head pointer chained list pointed, search the key assignments of described ticket,, then from described chained list, remove the node of the storage key assignments identical with the key assignments of described ticket if find identical key assignments; If do not find identical key assignments, then judge the key assignments that does not generate described ticket.
12., wherein determine the key assignments of described ticket by the hash function computing of the charging of described ticket being removed heavy element according to the method for claim 11.
13., wherein before described positioning step, judge that determined key assignments file is whether in internal memory according to the method for claim 11:
If described key assignments file in internal memory, then continues described positioning step and removes step in internal memory;
If described key assignments file not in internal memory, judges then whether described key assignments file exists:
If described key assignments file exists, then described key assignments file is called in the internal memory, in internal memory, continue described positioning step then and remove step;
If described key assignments file does not exist, then judge the key assignments that does not generate described ticket.
14., wherein before the key assignments file is called in internal memory, judge whether the Free Region of internal memory is enough for described key assignments file according to the method for claim 13:
If the Free Region of internal memory is enough for described key assignments file, then described key assignments file is called in the Free Region of internal memory;
If the Free Region of internal memory is for described key assignments file deficiency, then with the specific key assignments file in the internal memory to changing to disk file system, to discharge enough internal memory Free Regions, then described key assignments file is called in the Free Region of internal memory.
15., wherein will meet the key assignments file of exchange condition in the internal memory to changing to disk file system according to " least recently used " principle according to the method for claim 14.
16. according to the method for claim 11, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
17. an equipment that produces ticket key assignments file comprises:
The array generating apparatus is used to generate the array that length is N, and the head pointer of a single-track link table is pointed in each element storage of wherein said array;
Index value is determined device, is used for going heavy element to determine the index value of described ticket according to one or more chargings of ticket, and wherein said index value is the integer of value between 0 to N-1;
Key assignments is determined device, is used for going heavy element to determine the key assignments of described ticket according to the charging of described ticket;
Storage device is used for key assignments with described ticket and stores in described array and the corresponding element of the index value of the described ticket chained list pointed.
18. according to the equipment of claim 17, wherein said key assignments determines that device determines the key assignments of described ticket by hash function.
19. according to the equipment of claim 17 or 18, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
20. a ticket goes to reset and is equipped with, and comprising:
Storage device is used for memory ticket key assignments file; With
Processing unit is used to carry out ticket and goes heavily to handle, and comprising:
Key assignments file determining unit is used for the key assignments file of determining that ticket is belonged to;
Index value and key assignments determining unit are used for going heavy element to determine the index value and the key assignments of described ticket according to the charging of described ticket;
Positioning unit is used for navigating to based on the index value of described ticket a linked list head pointer of determined key assignments file;
Judging unit is used for searching the key assignments of described ticket at described head pointer chained list pointed, if find identical key assignments, then judges the described ticket list of attaching most importance to; If do not find identical key assignments, judge that then described ticket is not heavy single, and the key assignments chain of described ticket is gone into described chained list end.
21. the ticket according to claim 20 goes to reset fully, also comprises reading device, is used for the ticket key assignments file that is stored in described storage device is called in the internal memory;
Wherein said positioning unit and judging unit are carried out location and decision operation at the ticket key assignments in the internal memory.
Be equipped with 22. go to reset, also comprise the key assignments file creating apparatus, be used for when internal memory and storage device all do not have the key assignments file of described ticket, in internal memory, generating the key assignments file of described ticket, and judging that described ticket is not heavy single according to the ticket of claim 21.
23. the ticket according to claim 22 goes to reset fully, comprise that also file is to changing device, be used at the Free Region of internal memory will meeting the key assignments file of exchange condition in the internal memory to changing to disk file system, to discharge enough region of memorys for calling in or generate described key assignments file when not enough.
24. the ticket according to claim 23 goes to reset fully, wherein said file will meet the key assignments file of exchange condition to changing to disk file system to changing device according to " least recently used " principle in the internal memory.
25. the ticket according to claim 20 goes to reset fully, wherein said index value and key assignments determining unit are determined the key assignments of described ticket by hash function.
26. the ticket according to claim 20 goes to reset fully, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
27. an equipment of removing key assignments from ticket key assignments file comprises:
Storage device is used for memory ticket key assignments file; With
Processing unit is used to carry out key assignments and removes processing, comprising:
Key assignments file determining unit is used for the key assignments file of determining that ticket is belonged to;
Index value and key assignments determining unit are used for going heavy element to determine the index value and the key assignments of described ticket according to the charging of described ticket;
Positioning unit is used for navigating to based on the index value of described ticket a linked list head pointer of determined key assignments file;
Clearing cell is used for searching the key assignments of described ticket at described head pointer chained list pointed, if find identical key assignments, then removes the node of the storage key assignments identical with the key assignments of described ticket from described chained list; If do not find identical key assignments, then judge the key assignments that does not generate described ticket.
28. according to the equipment of claim 27, also comprise reading device, be used for the ticket key assignments file that is stored in described storage device is called in the internal memory;
Wherein said positioning unit and clearing cell are carried out location and clear operation at the ticket key assignments in the internal memory.
29. equipment according to claim 28, comprise that also file is to changing device, be used at the Free Region of internal memory will meeting the key assignments file of exchange condition in the internal memory to changing to disk file system, to discharge enough region of memorys for calling in described key assignments file when not enough.
30. according to the equipment of claim 29, wherein said file will meet the key assignments file of exchange condition to changing to disk file system to changing device according to " least recently used " principle in the internal memory.
31. according to the equipment of claim 27, wherein said index value and key assignments determining unit are determined the key assignments of described ticket by hash function.
32. according to the equipment of claim 27, wherein said charging goes heavy element to comprise the time of giving orders or instructions, calling number, called number, ticket type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101370078A CN101350869B (en) | 2007-07-19 | 2007-07-19 | Method and apparatus for removing repeat of telecom charging based on index and hash |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101370078A CN101350869B (en) | 2007-07-19 | 2007-07-19 | Method and apparatus for removing repeat of telecom charging based on index and hash |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101350869A true CN101350869A (en) | 2009-01-21 |
| CN101350869B CN101350869B (en) | 2011-08-24 |
Family
ID=40269437
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101370078A Active CN101350869B (en) | 2007-07-19 | 2007-07-19 | Method and apparatus for removing repeat of telecom charging based on index and hash |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101350869B (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065192A (en) * | 2009-11-18 | 2011-05-18 | 中国移动通信集团安徽有限公司 | Call ticket de-duplication method and device |
| CN102129473A (en) * | 2011-04-19 | 2011-07-20 | 北京神州数码思特奇信息技术股份有限公司 | Method for searching static data |
| CN102169499A (en) * | 2011-04-18 | 2011-08-31 | 北京神州数码思特奇信息技术股份有限公司 | Repeated ticket removing method |
| CN102591792A (en) * | 2012-01-13 | 2012-07-18 | 广州从兴电子开发有限公司 | Storage method for memory data |
| CN102591855A (en) * | 2012-01-13 | 2012-07-18 | 广州从兴电子开发有限公司 | Data identification method and data identification system |
| CN102591946A (en) * | 2010-12-28 | 2012-07-18 | 微软公司 | Using index partitioning and reconciliation for data deduplication |
| CN103136204A (en) * | 2011-11-23 | 2013-06-05 | 北大方正集团有限公司 | Client information duplication checking method and client information duplication checking system |
| CN104205743A (en) * | 2012-03-20 | 2014-12-10 | 华为技术有限公司 | Method and apparatus for content delivery in radio access networks |
| CN104268272A (en) * | 2014-10-14 | 2015-01-07 | 青岛海尔软件有限公司 | Method and device for checking uniqueness of data |
| US8935487B2 (en) | 2010-05-05 | 2015-01-13 | Microsoft Corporation | Fast and low-RAM-footprint indexing for data deduplication |
| US9053032B2 (en) | 2010-05-05 | 2015-06-09 | Microsoft Technology Licensing, Llc | Fast and low-RAM-footprint indexing for data deduplication |
| CN105138546A (en) * | 2015-07-10 | 2015-12-09 | 国家电网公司 | Dom4J based IMS information equipment ledger duplicate elimination method |
| CN105426131A (en) * | 2015-12-03 | 2016-03-23 | 成都华为技术有限公司 | KV (Key Value) storage implementation method and device |
| US9298604B2 (en) | 2010-05-05 | 2016-03-29 | Microsoft Technology Licensing, Llc | Flash memory cache including for use with persistent key-value store |
| CN105930396A (en) * | 2016-04-15 | 2016-09-07 | 北京思特奇信息技术股份有限公司 | Database based duplicate removal method and system |
| CN109522305A (en) * | 2018-12-06 | 2019-03-26 | 北京千方科技股份有限公司 | A kind of big data De-weight method and device |
| CN109976896A (en) * | 2019-04-09 | 2019-07-05 | 中国联合网络通信集团有限公司 | Business re-scheduling treating method and apparatus |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI634514B (en) * | 2016-11-22 | 2018-09-01 | 中華電信股份有限公司 | Rate allocation system based on dynamic weight |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1322707C (en) * | 2003-06-24 | 2007-06-20 | 华为技术有限公司 | Call ticket repetition removing method |
| CN1809108A (en) * | 2006-02-20 | 2006-07-26 | 南京联创科技股份有限公司 | Filter based call ticket memory repetition elimination method |
| CN100452043C (en) * | 2006-09-06 | 2009-01-14 | 南京中兴软创科技有限责任公司 | A storage and search method of multiple index hash table |
-
2007
- 2007-07-19 CN CN2007101370078A patent/CN101350869B/en active Active
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065192A (en) * | 2009-11-18 | 2011-05-18 | 中国移动通信集团安徽有限公司 | Call ticket de-duplication method and device |
| US9053032B2 (en) | 2010-05-05 | 2015-06-09 | Microsoft Technology Licensing, Llc | Fast and low-RAM-footprint indexing for data deduplication |
| US9436596B2 (en) | 2010-05-05 | 2016-09-06 | Microsoft Technology Licensing, Llc | Flash memory cache including for use with persistent key-value store |
| US9298604B2 (en) | 2010-05-05 | 2016-03-29 | Microsoft Technology Licensing, Llc | Flash memory cache including for use with persistent key-value store |
| US8935487B2 (en) | 2010-05-05 | 2015-01-13 | Microsoft Corporation | Fast and low-RAM-footprint indexing for data deduplication |
| CN102591946B (en) * | 2010-12-28 | 2018-06-12 | 微软技术许可有限责任公司 | It is divided using index and coordinates to carry out data deduplication |
| US9785666B2 (en) | 2010-12-28 | 2017-10-10 | Microsoft Technology Licensing, Llc | Using index partitioning and reconciliation for data deduplication |
| CN102591946A (en) * | 2010-12-28 | 2012-07-18 | 微软公司 | Using index partitioning and reconciliation for data deduplication |
| US9110936B2 (en) | 2010-12-28 | 2015-08-18 | Microsoft Technology Licensing, Llc | Using index partitioning and reconciliation for data deduplication |
| CN102169499A (en) * | 2011-04-18 | 2011-08-31 | 北京神州数码思特奇信息技术股份有限公司 | Repeated ticket removing method |
| CN102129473B (en) * | 2011-04-19 | 2016-09-14 | 北京思特奇信息技术股份有限公司 | A kind of method for searching static data |
| CN102129473A (en) * | 2011-04-19 | 2011-07-20 | 北京神州数码思特奇信息技术股份有限公司 | Method for searching static data |
| CN103136204A (en) * | 2011-11-23 | 2013-06-05 | 北大方正集团有限公司 | Client information duplication checking method and client information duplication checking system |
| CN102591792B (en) * | 2012-01-13 | 2015-04-29 | 从兴技术有限公司 | Storage method for memory data |
| CN102591855A (en) * | 2012-01-13 | 2012-07-18 | 广州从兴电子开发有限公司 | Data identification method and data identification system |
| CN102591792A (en) * | 2012-01-13 | 2012-07-18 | 广州从兴电子开发有限公司 | Storage method for memory data |
| CN104205743A (en) * | 2012-03-20 | 2014-12-10 | 华为技术有限公司 | Method and apparatus for content delivery in radio access networks |
| CN104268272A (en) * | 2014-10-14 | 2015-01-07 | 青岛海尔软件有限公司 | Method and device for checking uniqueness of data |
| CN105138546A (en) * | 2015-07-10 | 2015-12-09 | 国家电网公司 | Dom4J based IMS information equipment ledger duplicate elimination method |
| CN105138546B (en) * | 2015-07-10 | 2018-11-06 | 国家电网公司 | IMS information equipment accounts based on Dom4J disappear weighing method |
| CN105426131A (en) * | 2015-12-03 | 2016-03-23 | 成都华为技术有限公司 | KV (Key Value) storage implementation method and device |
| CN105930396A (en) * | 2016-04-15 | 2016-09-07 | 北京思特奇信息技术股份有限公司 | Database based duplicate removal method and system |
| CN105930396B (en) * | 2016-04-15 | 2019-04-09 | 北京思特奇信息技术股份有限公司 | A kind of repetition removing method and system based on database |
| CN109522305A (en) * | 2018-12-06 | 2019-03-26 | 北京千方科技股份有限公司 | A kind of big data De-weight method and device |
| CN109976896A (en) * | 2019-04-09 | 2019-07-05 | 中国联合网络通信集团有限公司 | Business re-scheduling treating method and apparatus |
| CN109976896B (en) * | 2019-04-09 | 2021-06-29 | 中国联合网络通信集团有限公司 | Service re-ranking processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101350869B (en) | 2011-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101350869B (en) | Method and apparatus for removing repeat of telecom charging based on index and hash | |
| US9934233B2 (en) | Searchable data archive | |
| US6396913B1 (en) | System and method for processing call detail records | |
| CN102662988B (en) | Method for filtering redundant data of RFID middleware | |
| CN105095223A (en) | Method for classifying texts and server | |
| EP2095272A1 (en) | System and method for optimizing changes of data sets | |
| WO2015039478A1 (en) | Method and apparatus for recognizing junk messages | |
| CN100421101C (en) | Data checking apparatus and checking method | |
| CN104298736A (en) | Method and device for aggregating and connecting data as well as database system | |
| CN109086289A (en) | A kind of media data processing method, client, medium and equipment | |
| CN103258389B (en) | The method of self-aided terminal upload file, system and self-aided terminal | |
| CN109377206B (en) | Payment limit system, method, device and storage medium | |
| CN101751397A (en) | Method and device for importing files into database | |
| CN110245155A (en) | Data processing method, device, computer readable storage medium and terminal device | |
| CN109783481A (en) | Data processing method and device | |
| CN106485521A (en) | User credit degree appraisal procedure and device | |
| US9398441B2 (en) | Method and apparatus for identifying re-subscribed user | |
| CN103823761B (en) | Method for increasing blacklist terminal capacity and retrieval speed | |
| CN101799803B (en) | Method, module and system for processing information | |
| CN102143471A (en) | Processing method and device of unusual telephone charge | |
| CN101827175A (en) | Method and system for storing sorted call bills by catalog | |
| CN1322707C (en) | Call ticket repetition removing method | |
| CN105868197B (en) | A kind of statistical method and statistic device of call bill data | |
| CN105468603A (en) | Data selection method and apparatus | |
| CN115454356B (en) | Data file processing method, device and equipment based on recognition and aggregation algorithm |
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 |