CN102036211A - Charging processing method and device - Google Patents
Charging processing method and device Download PDFInfo
- Publication number
- CN102036211A CN102036211A CN200910180128XA CN200910180128A CN102036211A CN 102036211 A CN102036211 A CN 102036211A CN 200910180128X A CN200910180128X A CN 200910180128XA CN 200910180128 A CN200910180128 A CN 200910180128A CN 102036211 A CN102036211 A CN 102036211A
- Authority
- CN
- China
- Prior art keywords
- information
- function
- internal memory
- charging
- binary tree
- 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 provides a charging processing method and a charging processing device. The method comprises the following steps of: loading fee suite information to a memory; representing the fee suite information by using a memory binary tree; and traversing the memory binary tree according to user ticket information to acquire a charging result. By the method, the fee suite information is converted into the memory binary tree, and the memory binary tree is traversed according to the user ticket information to realize superposition of the fee suite and flexible expression of related information among suites and solve the problem of error superposition of the suites.
Description
Technical field
The present invention relates to the business support field, be specifically related to a kind of charge processing method and device.
Background technology
Along with carrying out of business, operator is in order to improve the various tariff packages of the numerous and confused release of the market share.A user may apply for a plurality of tariff packages, and the stack of enjoying a plurality of rate is preferential.For example after the user applies M-ZONE main flow set meal (give this locality, preceding 30 minutes local calls expense back dial in the mobile network 0.20 yuan/minute), may apply for the set meal that some are additional, as certain set meal (this locality dial between mobile network phone 0.30 yuan/minute).The charging processing mode of set meal stack is taked the processed mode usually, promptly define every charge information data and its priority of tariff package, system is according to the tariff package of user applies then, read the charge information data of each tariff package, after the prioritization according to charge information, judge whether to satisfy the condition of charge information item by item, if satisfy then carry out preferential, the charging result of all tariff packages is relatively got minimum value as final preferential expense at last.
There is following deficiency in existing charging processing mode:
(1) only expresses the related information of each favor information in the tariff package with priority, multiple related information between a plurality of tariff packages is beyond expression, as related information arranged side by side and nested related information etc., therefore can not embody the multiple stack requirement of business department flexibly to tariff package.
(2) during the set meal overlap-add procedure, if to get minimum value as charging result between a plurality of set meals, preferential mistake can appear.
(3) can't solve the preferential problem of critical ticket, promptly the user ticket can be enjoyed the preferential of two or more set meals simultaneously.
Summary of the invention
First purpose of the present invention is the charge processing method that proposition is a kind of flexibly, accuracy rate is high.
Second purpose of the present invention is the billing treatment plant that proposition is a kind of flexibly, accuracy rate is high.
For realizing above-mentioned first purpose, the invention provides a kind of charge processing method, may further comprise the steps: tariff package information is loaded into internal memory; Utilize internal memory class binary tree to characterize tariff package information; According to user's ticket information, traversal internal memory class binary tree obtains charging result.
For realizing above-mentioned second purpose, the invention provides a kind of billing treatment plant, comprising: the data load unit is used for tariff package information is loaded into internal memory, and utilizes internal memory class binary tree to characterize tariff package information; Charging processing unit is used for according to user's ticket information, and traversal internal memory class binary tree obtains charging result.
Among each embodiment of the present invention, by the tariff package information translation being become internal memory class binary tree, and then according to user's ticket information, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, realized the flexible expression of related information between each set meal and solved set meal stack Problem-Error.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of specification, is used to explain the present invention in the lump with embodiments of the invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is embodiment one flow chart of charge processing method of the present invention;
Fig. 2 is embodiment two flow charts of charge processing method of the present invention;
Fig. 3 is embodiment three flow charts of charge processing method of the present invention;
Fig. 4 is embodiment one schematic diagram of class binary tree in the charge processing method of the present invention;
Fig. 5 is embodiment four signaling diagrams of charge processing method of the present invention;
Fig. 6 is the example structure figure of billing treatment plant of the present invention.
Embodiment
Below in conjunction with accompanying drawing the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, and be not used in qualification the present invention.
Method embodiment
Fig. 1 is embodiment one flow chart of charge processing method of the present invention.As shown in Figure 1, present embodiment comprises:
Step S102: tariff package information is loaded into internal memory, and wherein, this tariff package information comprises the related information between each tariff package and internal accounting information thereof, each tariff package, and the related information between each tariff package internal accounting information;
During concrete operations, step S102 can comprise:
At first, utilize nested binary function to characterize this tariff package information, this nested binary function characterizes detailed process the explaining referring to step S201 among Fig. 2 of this tariff package information;
Secondly, the tariff package information that nested binary function is characterized is loaded into internal memory;
Step S104: utilize internal memory class binary tree to characterize tariff package information; Specifically referring to explaining to Fig. 2;
Step S106: according to user's ticket information, traversal internal memory class binary tree obtains charging result; Specifically referring to explaining among Fig. 3.
Those skilled in the art should be appreciated that, above-mentioned for step S102 adoptable step when the concrete operations, promptly at first utilize nested binary function to characterize this tariff package information, setting up internal memory class binary tree according to this tariff package information that this nested binary function characterized again is a kind of preferred scheme, can also adopt other mode according to the design needs, as characterizing this tariff package information with the mode of vertical table, wherein, the field of table is designed to charge information in charge information in coding, incidence relation, the set meal/set meal X, the set meal/set meal Y etc.
In the present embodiment, by the tariff package information translation being become internal memory class binary tree, and then, travel through the overlap-add procedure that this internal memory class binary tree is realized tariff package according to user's ticket information, realize the flexible expression of related information between each set meal and solved set meal stack Problem-Error.
Fig. 2 is embodiment two flow charts of charge processing method of the present invention.The step S104 that Fig. 2 is mainly used among the above-mentioned Fig. 1 that explains utilizes nested binary function to characterize under the situation of tariff package information at step S102, makes up the process of internal memory class binary tree.So, when understanding charge processing method of the present invention, also should be in conjunction with explaining to step S102 and step S106 among Fig. 1.As shown in Figure 2, present embodiment comprises:
Step S201: judge in nested binary function, whether can find comma, if can not find, execution in step S202 then, otherwise, execution in step S203.
Before understanding the concrete implication of step S201, the explanation that need make an explanation to the nested binary function that defines among each embodiment among the present invention specifies as follows:
Binary function Z=f (X Y) is meant the function with two independent variable X, Y, and nested binary function is meant that the variable of binary function also is a binary function, for example Z1=g (f (and X, Y), A); Generally speaking, tariff package is made up of charge information (also can be called favor information), there is priority relationship between the charge information, among each embodiment of the present invention, utilize the single argument of nested binary function, as above-mentioned variable X, Y, A, characterize charge information, utilize the function variable of nested binary function,, characterize the related information between the tariff package internal accounting information as above-mentioned g, f.In addition, the related information between the tariff package also utilizes function variable to characterize, for example Z=e (Z1, Z2), wherein, Z1, Z2 all represent tariff package, related information between the tariff package is function variable e, further, supposes Z2=h (B, C), then Z can be expanded into Z=e (Z1, Z2)=e (g (f (X, Y), A), h (B, C)).
Table 1 illustrated the related information between several tariff packages and the charge information, promptly nested binary function, the nested binary function that can also define other according to actual needs is to satisfy the needs that rate charge and handle.
The nested binary function definition list of table 1
Wherein, the concrete implication of subitem function and piecewise function is explained as follows:
The subitem comparison function is to each fee item of two charging results comparison of itemizing, as, the fee item of charging bill has basic expense, toll fee, information charge.If certain set meal has two charge informations: one is that basic expense is made a call to 3 foldings, toll fee is made a call to 4 foldings; Another is that basic expense is made a call to 4 foldings, toll fee is made a call to 3 foldings, the two priority is the same, then use the detailed process of subitem function to be: to utilize two charge informations respectively telephone expenses subitems (being fee item) to be chargeed, each subitem is compared, get optimal value, the optimal value of determining respectively to itemize and be final charging result.
Piecewise function is that the same fee item to two charging results carries out segmentation relatively.For example, certain set meal requires 8:00-10:00 to take substantially and makes a call to 5 foldings, another set meal requires 9:00-11:00 to take substantially and makes a call to 6 foldings, then can use piecewise function this moment, specific operation process is as follows: if existing ticket dials into the 11:00 point from 8:00 always, 3 sections have been divided into by previous set meal requirement so: 8:00-9:00 (5 folding), 9:00-10:00 (5 folding), 10:00-11:00 (not giving a discount); 3 sections also have been divided into by a back set meal requirement: 8:00-9:00 (not giving a discount), 9:00-10:00 (6 folding), 10:00-11:00 (6 folding), charging result is compared in each segmentation piecemeal then, get every section optimum charging result: 8:00-9:00 (5 folding), 9:00-10:00 (5 folding), 10:00-11:00 (6 folding) is aggregated into final charging result.
Explain as can be known by above-mentioned, owing to use comma between the variable in the nested binary function; " separate, so, can judge that promptly this nested binary function comprises that function variable still only comprises single argument by judging in nested binary function, whether can find comma;
Step S202: show it is single argument, be concrete charge information, generate leafy node, the process of setting up of the class binary tree of whole nested binary function is finished, and finishes; Realized utilizing the leafy node of internal memory class binary tree to characterize the charge information of each tariff package inside by step S202.
Step S203: show it is function expression, isolate left variable and right variable in function variable, the function variable.
Step S204: generate intermediate node with function variable, utilize the intermediate node of internal memory class binary tree to characterize related information between each tariff package and the related information between each tariff package internal accounting information.
Step S205: the left subtree that makes up intermediate node according to left variable, concrete building process is as follows: at first be back to step S201 left variable is analyzed, promptly, change the analytic target of step S201 into left variable by nested binary function, again according to judged result execution in step S202 and step S203-step S206.
Step S206: the right subtree that makes up intermediate node according to right variable, concrete building process is as follows: at first be back to step S201 right variable is analyzed, promptly, change the analytic target of step S201 into right variable by nested binary function, again according to judged result execution in step S202 and step S203-step S206.
Need to prove that the execution sequence of step S205 and step S206 can design as required, no strict regulations.
In the present embodiment, become internal memory class binary tree by the tariff package information translation that will utilize nested binary function to characterize, because various informativeization of nested binary function, but also can be provided with flexibly according to actual needs, therefore make that related information can be expressed more neatly between each set meal.
Fig. 3 is embodiment three flow charts of charge processing method of the present invention.Fig. 3 is mainly used in the step S106 among the above-mentioned Fig. 1 that explains, thus when understanding charge processing method of the present invention, also should in conjunction with among Fig. 1 to step S102 and step S104, and explaining to Fig. 2.By explaining as can be known among above-mentioned Fig. 2, internal memory class binary tree has mainly characterized the charge information in each tariff package and each tariff package, that is to say according to these charge informations the general expenses in user's ticket is specifically chargeed when handling, preferential in order to finish stack better, can also define leaf node and carry out the preferential object of rate, be called for short preferential object, and then utilize the cost information in this preferential object carrying user ticket, the process information of preferential process etc.The content of preferential object can comprise:
1. communication cost sign is used to characterize fee item such as basic expense, first section toll fee, second section toll fee and information charge, comprises that each fee item communication cost preferential before and preferential identifies.
2. be used to characterize the duration of call and flow the call-information sign, be used to characterize the charging of handling unit of chargeing and jump time unit, for example the charging of voice ticket is jumped time unit and was generally 60 seconds.
3. be used to characterize the charging that the preferential charging of each fee item is jumped time and the user at most can be preferential charging jumps time and jump time sign.
4. expense segmental structure chained list: whether each node of chained list comprises chargeing jumps time side-play amount, charges and jump time step-length, expense, chargeed and handled four fields; The segmental structure chained list is a list structure, and each node on the chained list is represented the segmentation of a time.For example, certain preferential set meal requires: 5 foldings when 8:00-18:00 is busy, 6 foldings when 18:00-8:00 is not busy.If the air time of a ticket is 17:50, duration is 30 minutes, then the step portion dot interlace by set meal is 18:00, the segmental structure chained list has two nodes: it is 0 that time side-play amount is jumped in the charging of a node, charge that to jump time step-length be 10 minutes (characterizing 17:50-18:00), and it is 11 that time side-play amount is jumped in the charging of another node, charge that to jump time step-length be 20 minutes (characterizing 18:00-18:20).
5. add up sign and aggregate-value, the effect of the two is to give the quantity of having given when preferential for recording user.For example, certain set meal of user was given 1000 minutes, the corresponding accumulative total of this set meal identifies S001, the corresponding value of this accumulative total sign is 0 when the beginning of the month, when having 10 minutes ticket, the user given, then the corresponding value of this accumulative total sign increases to 10, and system can judge in view of the above whether the user can also continue to give thus.
As shown in Figure 3, present embodiment comprises:
Step 1: when ticket is handled beginning (when internal memory class binary tree begins to travel through), be that preferential object is given initial value at first according to the information in user's ticket; Once more, judge whether internal memory class binary tree is empty, if sky does not then process, finishes, if be not empty, execution in step 2;
Step 2: whether the node of judging internal memory class binary tree is intermediate node, if then execution in step 3, if not, then execution in step 4;
Step 3:, travel through the subtree of this intermediate node according to traversal mode according to the pairing function variable of predefined intermediate node; The traversal mode of predefined each function variable is as shown in table 2 below:
The traversal mode table of table 2 function variable
With respect to the traversal mode of various function variables in the above-mentioned table 2, the transfer mode of preferential object is also different, but every kind of transfer mode is corresponding one by one with the traversal mode.The mode that preferential object transmits is as shown in table 3 below:
The preferential object transfer mode table of each function variable of table 3
Step 4: whether the node of judging internal memory class binary tree is leaf node, if then execution in step 5, if not, finishes;
Step 5: according to the charge information that single argument characterized of leafy node correspondence, it is preferential to carry out rate, to the processing of chargeing of rate object identity;
During concrete operations, step 5 can comprise:
At first, jump inferior unit, calculate the charging that needs charging and jump inferior according to the duration of call/flow and charging;
Secondly, carry out preferential after, upgrade that the preferential charging of each fee item is jumped time, preferential expense, if run into when giving class preferential, also upgrade accumulative total sign and aggregate-value.
In the concrete processing procedure, also can run into critical preferential situation.The critical preferential expense/duration ladder that is meant that expense/duration of having handled requires less than set meal, but add the expense/duration ladder situation that just requires behind the current ticket expense/duration handled that will charge greater than set meal.The local expense substantially of 8:00-18:00 made a call to 8 foldings when for example certain set meal requirement was busy, and local the expense substantially of 18:00-8:00 made a call to 5 foldings during the spare time.Here 8:00,18:00 are step values.If the call start time of certain ticket is 17:50 minute, converse 20 minutes, the duration of ticket has just been crossed over this step values of 18:00 so, just need carry out the division of duration, and formation expense segmentation chained list is critical preferential to the processing of this ticket.Therefore, handle correct in order to guarantee overlap-add procedure and critical charging, in execution cost/when the duration ladder is preferential, when if the expense/duration of ticket has been crossed over a plurality of step values, need carry out the division of expense/duration by step values, formation expense segmentation chained list merges the expense of each segmentation object at last, forms that preferential charging is jumped time and preferential expense.
According to the adaptation situation of segmentation optimal function Mad is the processing when not overlapping of step values that two set meals require, therefore, if when running into segmentation optimal function Mad, also need the expense segmentation chained list in the preferential object of left and right subtree node is compared, segmentation with minimum splits big segmentation object, and is identical up to the segmentation of the preferential object in the left and right sides, compares each segmentation object of two preferential objects again, get optimal value, merge in the expense object.For example, the local expense substantially of 8:00-18:00 made a call to 8 foldings when set meal A requirement was busy, and local the expense substantially of 18:00-8:00 made a call to 5 foldings during the spare time; The local expense substantially of 7:30-17:30 made a call to 7 foldings when set meal B requirement was busy, and local the expense substantially of 17:30-7:30 made a call to 6 foldings during the spare time.Just need segmentation optimal function Mad to carry out overlap-add procedure between these two set meals.Call start time for certain bar ticket is 17:40, and the air time is that 30 minutes processing procedure is as follows:
At first, step values by set meal A is separated, and its corresponding expense segmentation chained list A1 has two segmentation nodes: one is 17:40-18:00 (charge and jumped time step-length 20 minutes, expense 8 foldings), another is 18:00-18:10 (charges and jumped time step-length 10 minutes, expense 5 foldings);
Secondly, separate by the step values of set meal B, its corresponding expense segmentation chained list B1 has a segmentation node, is 17:40-18:10 (charge and jumped time step-length 30 minutes, expense 6 foldings);
Once more, the expense segmentation chained list A1 little with segmentation splits expense segmentation chained list B1, expense segmentation chained list B1 after the fractionation has two segmentation nodes: one is that (chargeing and jumping time step-length is 20 minutes to 17:40-18:00, expense 6 foldings), one is 18:00-18:10 (chargeing and jumping time step-length is 10 minutes, expense 6 foldings);
At last, relatively each segmentation node is got expense 6 foldings for 17:40-18:00, gets expense 5 foldings for 18:00-18:10, and the segmentation node is merged expense, obtains final charging result.
Step 6: return the charging result.
Because the subtree ergodic algorithm to middle node is nested, that is to say, if the subtree of intermediate node is still the words of intermediate node, to continue traversal, up to having run into leafy node (returning the charging result), all turn back to intermediate node after like this subtree traversal of each intermediate node being finished, and obtain final charging result, promptly behind the leafy node and intermediate node that have traveled through internal memory class binary tree, obtain charging result.
With the example of the tariff package of a plurality of stacks of user applies, describe the idiographic flow of charge processing method below.The tariff package example of user applies is: give preceding 30 minutes local call expenses, give 0.20 yuan/minute of the interior call rate of back local network, call rate is 0.30 yuan/minute between local network.
At first, use nested binary function to represent user's tariff package, concrete operations are as follows:
Above-mentioned tariff package is split into three sub-rate, as, the sub-rate of A represent to give preceding 30 minutes local call expenses, and the sub-rate of B are represented in the local network 0.20 yuan/minute of call rate, and the sub-rate of C are represented between local network 0.30 yuan/minute of call rate; Related information between sub-rate B and the rate C utilizes function Mut to represent, the result of calculation of function Mut and the related information of A utilize function Add to represent, so the result who represents with nested binary function is: charging result Z=Add (A, Mut (B, C));
Secondly, will above-mentioned nested binary function load in the internal memory, and be converted to internal memory class binary tree as shown in Figure 4, finish user's charging processing by traveling through this internal memory class binary tree; Wherein, the process of conversion is as follows:
A. the node of decision tree is the intermediate node of Add function variable correspondence, therefore earlier left subtree A is traveled through;
B. the node of judging left subtree is a leaf node, i.e. the leafy node A of charge information correspondence, the processing thereby antithetical phrase rate A charges;
C. return a, on the charging result basis of antithetical phrase rate A, travel through the right subtree of the intermediate node of Add function variable correspondence again;
D. the node of judging this right subtree is the intermediate node of Mut function variable correspondence, travel through the left subtree B of the intermediate node of Mut function variable correspondence earlier, if left subtree B does not carry out and charge to handle, then travel through the right subtree C of the intermediate node of Mut function variable correspondence, to the C processing of chargeing.
Below with above-mentioned tariff package example Z=add (A, max (B, C)) is an example, and the processing procedure of each sub-rate node of the ticket of conversing between a local network of 56 seconds (preferential before expense 0.40 yuan) is described:
(1) before the processing, the duration of call is 56 seconds, and the preferential preceding expense of each fee item is 0.40 yuan, 0 yuan, and 0 yuan, 0 yuan;
(2) through after the sub-rate node A processing, because it is full that the local call expense is not sent, so preferentially fall 1 and charge and jump time unit, expense is also corresponding preferentially falls 0.40 yuan, it is that 1 unit, preferential expense are 0.40 yuan that preferential charging after the processing is jumped inferior, 0 yuan, and 0 yuan, 0 yuan, accumulative total sign and aggregate-value are A001,1;
(3) through sub-rate node B the time, because conversation does not meet the favourable condition of this sub-rate node between local network, so do not carry out preferential;
(4) through sub-rate node C the time, owing to do not need preferential expense (before preferential expense deduct preferential expense equal 0) in the preferential object, so also do not carry out preferentially, therefore, the preferential back expense of each fee item is 0 yuan, 0 yuan, and 0 yuan, 0 yuan.
The following describes the local call expense that the user gave 29 minutes, the processing procedure of each the sub-rate node the when user dials conversation ticket in 2 minutes 50 seconds the local network (1.20 yuan of preferential preceding expenses):
(1) before the processing, 3 jumping time units that charge are arranged in the ticket, the preferential preceding expense of each fee item is 1.20 yuan, and 0 yuan, 0 yuan, 0 yuan, the accumulative total in the preferential object identifies and aggregate-value is A001,29;
(2) through after the sub-rate node A processing, because it is full that the local call expense is not sent, so preferentially fall 1 and charge and jump time unit, expense is also corresponding preferentially falls 0.40 yuan, it is that 1 unit, preferential expense are 0.40 yuan that preferential charging after the processing is jumped inferior, 0 yuan, and 0 yuan, 0 yuan, accumulative total sign and aggregate-value are A001,30;
(3) through sub-rate node B the time, need preferential duration (2 minutes) owing to have in the preferential object, therefore carry out in the local network 0.20 yuan/minute of call rate.It is that 2 units, preferential expense are 0.40 yuan that preferential charging after the processing is jumped inferior, and 0 yuan, 0 yuan, 0 yuan, accumulative total sign and aggregate-value are A001,30, and therefore, the preferential back expense of each fee item is 0.40 yuan, 0 yuan, and 0 yuan, 0 yuan.
In the present embodiment, by the rate object identity concrete according to user's ticket information architecture, and according to this rate object identity, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, guaranteed accuracy rate in the set meal overlap-add procedure process better, further avoided preferential Problem-Error, particularly guaranteed critical charging processing accuracy, realized that user's a ticket can be enjoyed the preferential of two or more set meals simultaneously.
Fig. 5 is embodiment four signaling diagrams of charge processing method of the present invention, Fig. 5 is mainly used in conjunction with executive agent, be that data load unit, data center unit, ticket reading unit, charging processing unit, ticket output unit and data are preserved the unit, each charge processing method among above-mentioned Fig. 1-Fig. 4 is described.The detailed description of each executive agent is referring to explaining to Fig. 6.As shown in Figure 5, present embodiment comprises:
Step 501: the data load unit will comprise that the data file of nested binary function is loaded into internal memory;
Step 502: the data load unit converts nested binary function to internal memory class binary tree, and this internal memory class binary tree is kept in the data center unit;
Step 503: the ticket reading unit reads user's CDR file;
Step 504: the ticket reading unit passes to charging processing unit with user's CDR file;
Step 505: charging processing unit traversal internal memory class binary tree obtains charging result with the processing of chargeing;
Step 506: ticket and charging result outputed in the physical file before the ticket output unit will be handled;
Step 507: data such as the accumulative total sign of data center unit and aggregate-value are preserved the unit by data and are outputed in the physical file, finish.
In the present embodiment, the tariff package information translation of utilizing nested binary function to characterize is become internal memory class binary tree, and then according to user's ticket information, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, realized the flexible expression of related information between each set meal and solved set meal stack Problem-Error; Because various informativeization of nested binary function, but also can be provided with flexibly according to actual needs, therefore make that related information can be expressed more neatly between each set meal; In addition, by the rate object identity concrete according to user's ticket information architecture, and according to this rate object identity, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, guaranteed accuracy rate in the set meal overlap-add procedure process better, further avoided preferential Problem-Error, particularly guaranteed critical charging processing accuracy, realized that user's a ticket can be enjoyed the preferential of two or more set meals simultaneously.
Device embodiment
Fig. 6 is the example structure figure of billing treatment plant of the present invention.Each embodiment of above-mentioned Fig. 1-Fig. 5 method invention all can realize in the device of structure shown in Fig. 6 structure chart.As shown in Figure 6, this system comprises data load unit 61, is used for tariff package information is loaded into internal memory, and utilizes internal memory class binary tree to characterize tariff package information; Charging processing unit 65 is used for according to user's ticket information, and traversal internal memory class binary tree obtains charging result.
Data load unit 61 can comprise:
Function carrier unit 611 is used to utilize nested binary function to characterize tariff package information;
Load subelement 612, be used for the tariff package information that nested binary function characterizes is loaded into internal memory;
Binary tree carrier unit 613, be used to utilize the leafy node of internal memory class binary tree to characterize the charge information of each tariff package inside, and utilize the intermediate node of internal memory class binary tree to characterize related information between each tariff package and the related information between each tariff package internal accounting information.
Charging processing unit 65 can comprise:
Make up subelement 651, be used for, make up the rate object identity according to user's ticket information;
Traversal subelement 652 is used for when traversing the intermediate node of internal memory class binary tree, according to the traversal mode of predefined related information, and the subtree of traversal intermediate node; When traversing the leafy node of internal memory class binary tree, the charge information that characterizes according to leafy node is to the processing of chargeing of user's ticket information; And behind the leafy node and intermediate node that have traveled through internal memory class binary tree, obtain charging result, export the expense after preferential.
This billing treatment plant can also comprise:
Data center unit 62, be used to store user's preferential relevant data of chargeing, comprise nested binary function, internal memory class binary tree, user's ticket information, subscriber data, the preferential needed user's Familiarity Number of sub-rate, customer group etc. have also been preserved the user and have been chargeed the metering data that produces in the processing procedure as accumulative total sign, aggregate-value etc.Data in the data center unit 62 are loaded by data load unit 61, and offer charging processing unit 65 uses;
Data are preserved unit 63, and the data that are used for charging processing unit 65 charging processing procedures are produced are saved in the physical file as accumulative total sign, aggregate-value etc., and preserve the data in the data center 62;
Ticket acquiring unit 64 is used for obtaining from data center unit 62 user's ticket information, and sends user's ticket information to charging processing unit 65;
Ticket output unit 66 is used for the charging result that charging processing unit 65 is obtained and handles preceding ticket exporting physical file to.
It will be appreciated by those skilled in the art that: this device comprises that data load unit 61 and charging processing unit 65 get final product, and this device comprises that it is preferred scheme that data center unit 62, data are preserved unit 63, ticket acquiring unit 64 and ticket output unit 66.
In the present embodiment, the tariff package information translation that data load unit 61 utilizes nested binary function to characterize becomes internal memory class binary tree, charging processing unit 65 and then according to user's ticket information, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, realized the flexible expression of related information between each set meal and solved set meal stack Problem-Error; Because various informativeization of nested binary function, but also can be provided with flexibly according to actual needs, therefore make that related information can be expressed more neatly between each set meal; In addition, by the rate object identity concrete according to user's ticket information architecture, and according to this rate object identity, travel through this internal memory class binary tree and realize the overlap-add procedure of tariff package, guaranteed accuracy rate in the set meal overlap-add procedure process better, further avoided preferential Problem-Error, particularly guaranteed critical charging processing accuracy, realized that user's a ticket can be enjoyed the preferential of two or more set meals simultaneously.
It should be noted that at last: above only is the preferred embodiments of the present invention, be not limited to the present invention, although the present invention is had been described in detail with reference to previous embodiment, for a person skilled in the art, it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. a charge processing method is characterized in that, may further comprise the steps:
Tariff package information is loaded into internal memory;
Utilize internal memory class binary tree to characterize described tariff package information;
According to user's ticket information, travel through described internal memory class binary tree and obtain charging result.
2. charge processing method according to claim 1 is characterized in that, the described operation that tariff package information is loaded into internal memory comprises:
Utilize nested binary function to characterize described tariff package information, wherein, the single argument of described nested binary function characterizes the charge information in each tariff package in the described tariff package information, and the function variable of described nested binary function characterizes the related information between each tariff package in related information between the described charge information and the described tariff package information;
The tariff package information that described nested binary function is characterized is loaded into internal memory.
3. charge processing method according to claim 1 and 2 is characterized in that, the described operation that utilizes internal memory class binary tree to characterize described tariff package information comprises:
Utilize the leafy node of internal memory class binary tree to characterize the interior charge information of described each tariff package;
Utilize the intermediate node of internal memory class binary tree to characterize related information between described each tariff package and the related information between the described charge information.
4. charge processing method according to claim 3 is characterized in that, and is described according to user's ticket information, travels through the operation that described internal memory class binary tree obtains charging result and comprises:
According to user's ticket information, make up the rate object identity;
When traversing the intermediate node of described internal memory class binary tree,, travel through the subtree of described intermediate node according to the traversal mode of predefined described related information;
When traversing the leafy node of described internal memory class binary tree, the charge information that characterizes according to described leafy node is to the processing of chargeing of described rate object identity;
Behind the leafy node and intermediate node that have traveled through described internal memory class binary tree, obtain described charging result.
5. charge processing method according to claim 4 is characterized in that, the function variable that characterizes described related information comprises:
The mutual exclusion function is used for priority or sequence of positions according to two variablees, and one of them variable is come into force; The traversal mode of described mutual exclusion function is: the earlier left subtree or the right subtree of its corresponding intermediate node of traversal, and do not carry out at the described left subtree that has traveled through or right subtree and to charge when handling, travel through another subtree in described left subtree and the right subtree;
Superpositing function is used for priority or sequence of positions according to first variable and second variable, makes the input of the output of described first variable as described second variable; The traversal mode of described superpositing function is: the earlier left subtree or the right subtree of its corresponding intermediate node of traversal travel through another subtree in described left subtree and the right subtree again on the described left subtree that has traveled through or right subtree charge the basis of handling;
Optimal function, the charging that is used for carrying out respectively according to two variablees is handled, and chooses minimum charging result; The traversal mode of described optimal function is: travel through the left subtree and the right subtree of its corresponding intermediate node, the charging result of more described left subtree and right subtree is chosen minimum charging result;
Difference function, the charging that is used for carrying out respectively according to two variablees is handled, and chooses the largest account result; The traversal mode of described difference function is: travel through the left subtree and the right subtree of its corresponding intermediate node, the charging result of more described left subtree and right subtree is chosen the largest account result;
The subitem function is used for two variablees are calculated respectively the charging result of rate, and two charging results are relatively item by item got every optimum charging result again, are superimposed as final charging result; The traversal mode of described subitem function is: travel through the left subtree and the right subtree of its corresponding intermediate node, subitem is the charging result of two variablees relatively;
Piecewise function is used for two variablees are calculated respectively the charging result of rate, and two charging results are relatively piecemeal got every section optimum charging result again, are superimposed as final charging result; The traversal mode of described piecewise function is: travel through the left subtree and the right subtree of its corresponding intermediate node, segmentation is the charging result of two variablees relatively.
6. charge processing method according to claim 5 is characterized in that, described rate object identity comprises:
The communication cost sign is used to characterize every communication cost;
The call-information sign is used to characterize the duration of call and flow;
Charge and jump time step-length, be used to characterize charging bound-time unit;
Charge and jump time unit, be used for characterizing chargeing and handle unit;
Expense segmental structure chained list is used for characterizing the segment information of described piecewise function.
7. a billing treatment plant is characterized in that, this device comprises:
The data load unit is used for tariff package information is loaded into internal memory, and utilizes internal memory class binary tree to characterize described tariff package information;
Charging processing unit is used for according to user's ticket information, travels through described internal memory class binary tree and obtains charging result.
8. billing treatment plant according to claim 7 is characterized in that, described data load unit comprises:
Function carrier unit, be used to utilize nested binary function to characterize described tariff package information, wherein, the single argument of described nested binary function characterizes the charge information in each tariff package in the described tariff package information, and the function variable of described nested binary function characterizes the related information between each tariff package in related information between the described charge information and the described tariff package information;
Load subelement, be used for the tariff package information that described nested binary function characterizes is loaded into internal memory;
Binary tree carrier unit, be used to utilize the leafy node of internal memory class binary tree to characterize charge information in described each tariff package, and utilize the intermediate node of internal memory class binary tree to characterize related information between described each tariff package and the related information between the described charge information.
9. according to claim 7 or 8 described billing treatment plant, it is characterized in that described charging processing unit comprises:
Make up subelement, be used for, make up the rate object identity according to user's ticket information;
The traversal subelement is used for when traversing the intermediate node of described internal memory class binary tree, according to the traversal mode of predefined described related information, travels through the subtree of described intermediate node; When traversing the leafy node of described internal memory class binary tree, the charge information that characterizes according to described leafy node is to the processing of chargeing of described rate object identity; And behind the leafy node and intermediate node that have traveled through described internal memory class binary tree, obtain charging result.
10. billing treatment plant according to claim 9 is characterized in that, also comprises:
The data center unit is used to store described nested binary function, described internal memory class binary tree, described user's ticket information and described rate object identity;
The ticket acquiring unit is used for obtaining from described data center unit described user's ticket information, and sends described user's ticket information to described charging processing unit.
11. billing treatment plant according to claim 10 is characterized in that, also comprises:
Data are preserved the unit, are used for the data that described charging processing unit charging processing procedure produces are saved in the physical file;
The ticket output unit is used for exporting the charging result that described charging processing unit obtains to physical file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910180128.XA CN102036211B (en) | 2009-09-29 | 2009-09-29 | Charging processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910180128.XA CN102036211B (en) | 2009-09-29 | 2009-09-29 | Charging processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102036211A true CN102036211A (en) | 2011-04-27 |
| CN102036211B CN102036211B (en) | 2014-08-06 |
Family
ID=43888386
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910180128.XA Active CN102036211B (en) | 2009-09-29 | 2009-09-29 | Charging processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102036211B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083045A (en) * | 2009-11-30 | 2011-06-01 | 中国移动通信集团安徽有限公司 | Method and device for processing service charging |
| CN104407839A (en) * | 2014-10-31 | 2015-03-11 | 北京思特奇信息技术股份有限公司 | Complex calculation logic analytical method and device |
| CN104751287A (en) * | 2015-03-30 | 2015-07-01 | 浪潮通信信息系统有限公司 | IDC electric quantity charging method |
| CN106878031A (en) * | 2017-01-23 | 2017-06-20 | 北京思特奇信息技术股份有限公司 | Accelerate the method and system for the treatment of telecom service plan user bill |
| CN110111134A (en) * | 2019-04-10 | 2019-08-09 | 口碑(上海)信息技术有限公司 | Movable creation method and device based on association mode |
| CN116015991A (en) * | 2022-12-30 | 2023-04-25 | 中国联合网络通信集团有限公司 | Method, device and equipment for testing charging result of charging system |
| CN116015991B (en) * | 2022-12-30 | 2024-04-30 | 中国联合网络通信集团有限公司 | Method, device and equipment for testing charging result of charging system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5832069A (en) * | 1995-11-17 | 1998-11-03 | Sprint Communications Co L.P. | Object oriented system for modeling telecommunications circuits to estimate the access cost for leasing selected circuits |
| CN1674517A (en) * | 2004-03-24 | 2005-09-28 | 华为技术有限公司 | Method and apparatus for realizing charge metering |
| CN101030871A (en) * | 2007-04-11 | 2007-09-05 | 华为技术有限公司 | Charging system and method |
| CN101345636A (en) * | 2008-08-21 | 2009-01-14 | 中国移动（深圳）有限公司 | Transmitting and receiving method of charging document based on content charging, and charging server |
-
2009
- 2009-09-29 CN CN200910180128.XA patent/CN102036211B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5832069A (en) * | 1995-11-17 | 1998-11-03 | Sprint Communications Co L.P. | Object oriented system for modeling telecommunications circuits to estimate the access cost for leasing selected circuits |
| CN1674517A (en) * | 2004-03-24 | 2005-09-28 | 华为技术有限公司 | Method and apparatus for realizing charge metering |
| CN101030871A (en) * | 2007-04-11 | 2007-09-05 | 华为技术有限公司 | Charging system and method |
| CN101345636A (en) * | 2008-08-21 | 2009-01-14 | 中国移动（深圳）有限公司 | Transmitting and receiving method of charging document based on content charging, and charging server |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083045A (en) * | 2009-11-30 | 2011-06-01 | 中国移动通信集团安徽有限公司 | Method and device for processing service charging |
| CN102083045B (en) * | 2009-11-30 | 2014-06-04 | 中国移动通信集团安徽有限公司 | Method and device for processing service charging |
| CN104407839A (en) * | 2014-10-31 | 2015-03-11 | 北京思特奇信息技术股份有限公司 | Complex calculation logic analytical method and device |
| CN104751287A (en) * | 2015-03-30 | 2015-07-01 | 浪潮通信信息系统有限公司 | IDC electric quantity charging method |
| CN106878031A (en) * | 2017-01-23 | 2017-06-20 | 北京思特奇信息技术股份有限公司 | Accelerate the method and system for the treatment of telecom service plan user bill |
| CN106878031B (en) * | 2017-01-23 | 2020-03-27 | 北京思特奇信息技术股份有限公司 | Method and system for accelerating processing of telephone bill of telecommunication package user |
| CN110111134A (en) * | 2019-04-10 | 2019-08-09 | 口碑(上海)信息技术有限公司 | Movable creation method and device based on association mode |
| CN116015991A (en) * | 2022-12-30 | 2023-04-25 | 中国联合网络通信集团有限公司 | Method, device and equipment for testing charging result of charging system |
| CN116015991B (en) * | 2022-12-30 | 2024-04-30 | 中国联合网络通信集团有限公司 | Method, device and equipment for testing charging result of charging system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102036211B (en) | 2014-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102036211B (en) | Charging processing method and device | |
| Nicolle et al. | Impact of competition, investment, and regulation on prices of mobile services: evidence from France | |
| CN102595364A (en) | Charging system, device and method | |
| CN1330164C (en) | Hand set charging and fee-deducting method | |
| CN109743700A (en) | The charging method and message accounting of shared service | |
| CN105721174A (en) | Charging method, charging system and charging terminal | |
| CN106372886A (en) | Distributed payment system, method and device based on payment routing | |
| CN101540986B (en) | Charging method and system of prepaid service | |
| EP1104158A4 (en) | Communication control system and communication control method | |
| US8094795B2 (en) | Method for handling accounts in a network | |
| CN102958030B (en) | Charging method and charge system | |
| CN102083045B (en) | Method and device for processing service charging | |
| CN101668098A (en) | Value-added service charging method and charging system | |
| CN105246063B (en) | Charging method, device and system | |
| CN106982126A (en) | A kind of resource-sharing charging method and message accounting, memory bank | |
| US9838862B2 (en) | Mobile digital cellular telecommunication system with advanced functionality for rating correction | |
| EP1163791A1 (en) | Bill image generation | |
| US20110313903A1 (en) | Method and system facilitating an end-to-end solution for one or more service offerings | |
| CN101163179A (en) | Method and system of implementing real-time charging | |
| CN107786956A (en) | A kind of determination method and apparatus of set meal real-time priority | |
| CN105848128A (en) | Telephone bill processing method and system | |
| US7925558B2 (en) | System and method for commoditizing browsing time in a self-service store | |
| CN102461216A (en) | A method, a telecommunication system and a network node for sponsoring a communication service | |
| US7873152B1 (en) | System, method, and computer program product for rating based on a receiver offer | |
| CN113992457B (en) | Configuration method and system for converged service model in telecommunication industry |
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 |