Mass toll-ticket fast cross rearrangement based on memory

Abstract

The invention uses the memory multi level storage mechanism, the index technique of the digital search tree based on the binary balance tree (AVL tree)and the process of combining the compression technique based on the BCD code and the RLC(Run-Length Coding) algorithm with the cross and rearrange approach based on the time slice. Said multi level storage mechanism uses three -levels storage mechanism comprising a first level used as the widow of working set, a second level used as the compression and rearrange information and a third level used as the storage disc; the exchange between the first level and the second level is for encoding and decoding, and the data saving in first and second level is implemented using memory mapping approach; the index approach of the digital search tree based on the binary balance tree (AVL tree) is used for the cross and rearrangement.

Description

Technical field [0001] The invention belongs to the technical category of large-scale and accurate data processing applications for telecommunication operators. Background technique [0002] As the current telecom operator billing system mostly adopts the centralized mode of the whole province, the number of bills is extremely large. For example, a provincial telecom company has 1 billion bills in a month. According to the telecommunications practice, it is necessary to exclude repeated calls within three months. Therefore, the technical requirements for filtering repeated bills are very high. [0003] Originally repeated bills were only limited to completely repeated bills. Completely repeated bills means that the composite primary keys of two bills are exactly the same. For example, the calling number, called number, and call start time of the A bill and the B bill are exactly the same. . Now with the improvement of service quality of telecom operators, re...

AI Technical Summary

Problems solved by technology

The processing efficiency of cross sorting is not ideal for some ultra-long bills. For roaming bills, the time jump is large, and the efficiency of cross sorting is not ideal.

[0006] After years of practice, it can be concluded that using a database for cross-ranking is very inefficient, and cross-ranking must be based on memory

[0007] Existing telecommunications billing service performance bottleneck: duplicate order elimination and customer data search in billing, study their deficiencies. Combined with key tree index technology, the data organization method based on key tree index technology in telecom services can effectively improve billing The real-time performance effectively solves the contradiction between the accuracy and performance of real-time billing, and meets the needs of the development of telecom services. However, simple cross-ranking based on the database cannot solve the problem.

Images