Method for dividing the data based on a persistent data queue

Abstract

The invention proposes a method for dividing archived data based on persistent queue (PQ), including i) dividing this stored data into persistent data queues corresponding to the time it needs to be processed in the future; ii) scheduling the processing of data that has been split into these persistent data queues corresponding to future milestones; and iii) redistribute stored data into new sustainable data queues corresponding to the next time it takes for further processing of this data.

Claims

1. A method of dividing archived data based on persistent queue (PQ) include: i) divide said archived data into persistent data queues corresponding to the time needed for processing in the future; ii) scheduling the processing of data that has been divided into these persistent data queues corresponding to future milestones; and iii) redistributing archived data into new persistent data queues corresponding to the next time it takes to process this data.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] To describe the invention more clearly, the following briefly describes the accompanying drawings required for describing the invention.

[0011] FIG. 1 is a flow diagram describing updating and dividing the data into the persistent data queue (persistent queuePQ) according to the invention.

[0012] FIG. 2 describes how to organize data by time of persistent data queue.

[0013] FIG. 3 shows the logic diagram processing method extension data distribution system based on persistent data queue according to the invention.

[0014] FIG. 4 describes the sequence diagram (Sequence Diagram) of renewal professional method data distribution system based on persistent data queue according to the invention.

[0015] FIG. 5 is a drawing describing an example implementation of the invention as has been applied in the system's real-time charging Viettel (Online Charging SystemvOCS Viettel).

A DETAILED DESCRIPTION OF INVENTIONS

[0016] Charging systems in real time, to ensure the renewed policy can be met in a flexible way without affecting the stability of the system, there is a need to renew professional use limited resources database of the system. The solution according to the invention to overcome this problem is to not use the scanner manipulating the database to retrieve a list of packages, that need to handle extended use persistent queue data to divide and store the data to be renewed since the data is created or updated, until renewal just takes the data from the persistent data queue to process.

[0017] FIG. 1 is a flow diagram describing update and divide the data into the persistent data queue (persistent queuePQ) according to the invention. As shown in FIG. 1, right from when customers register the package at the time T, the data package will be stored in the database, and, based on the requirements of cyclical renewal package (renewed each month, renew every 30 days, renewed every 7 days, renewed every 24 hours or every 1 hour), the moment the package to be renewed will be determined before T.sub.next=f(T,data).

[0018] A data division block will determine the time T.sub.next (corresponding to which persistent data queue) to store the key of data in that queue_T.sub.next package in line.

[0019] FIG. 2 describes how to organize data by time of persistent data queue. As shown in FIG. 2, when customers register the package at the time of 10 hours 15 minutes, 05 th day of the month, data of package1 (data1) corresponding with key of package1 (key1) is saved to the database. Under the policy, that package should be extended once every 24 hours. Meanwhile, the key of data1 is key1 will be stored in a data queue persistent named RecurringMsgQueue_06_10h15m corresponding time of 10 hours 15 minutes, 06th day of the month (after 24 hours from the time of registration).

[0020] Also at that time, another customer registration package2 (data2) with key is key2, policies to be renewed every 3 hours, then key of data2 is key2 is stored in queue persistent data RecurringMsgQueue_05_13h15m relative corresponding to the time of 13 hours 15 minutes on the same day (after 3 hours from the time of registration).

[0021] FIG. 3 shows the logic diagram processing method extension data distribution system based on persistent data queue according to the invention. As shown in FIG. 3, at each time of launch renewed business cycles, data need extended availability has been split into a persistent data queue is read out and handle extended.

[0022] Based on the time of the renewal process, corresponding to the time T, determine the corresponding persistent data queue containing the key list of packages to be extended.

[0023] For example, the runtime renewal T is 10h13 on Thursday, 6 in May, identified queue persistent data contains information of data to be processed renew RecurringMsgQueue_06_13h15m (corresponding period of the queue near the time processing time to run the most extended).

[0024] The key of the data package to handle the extension will be read from the data queue persistent. The renewal unit retrieves the package information from the database based on the keys it receives and processes the package renewal. After processing the renewal done per package, this data will be transferred to the data division block to continue dividing into the next persistent data queues to serve the problem of renewal in the future time T.sub.next. The method of determining when T.sub.next is similar to determining the time to renew when customers register the package. Thus, the problem of renewal are met in a flexible manner without using more resources database. At the same time, the amount of data to check for renewal is much less, helping the renewal process to be processed faster, ensuring system performance as well as meeting the extended renewal problems in short period.

[0025] FIG. 4 depicts the sequence diagram (Sequence Diagram) of the business processing by the method of dividing the system based on persistent data queue according to the invention. As shown in FIG. 4, the data that has been retrieved from the persistent data queue is obsolete, the renewal business unit needs to interact with the database to retrieve the latest data to ensure accurate handling of renewal operations.

EXAMPLE OF IMPLEMENTATION INVENTION

[0026] A method according to the invention has been applied to the problem of accurate billing hourly billing system in real time vOCS. The problem of charging the exact time requested a group of subscribers enjoying promotion policy A, within the period of 20 hours-21 hours, subscriber can enjoy the policy of using free data, be notified and sent to the promotion time frame and accurately charged at the time of 20 hours and 21 hours if you are accessing update data at that time. As shown in FIG. 5, details the steps as follows:

Step 1:

[0027] When customers are registered for promotion A on the 6th of the month, the Provisioning application will store customer information in the persistent data queue RecurringMsgQueue_20H_00m.

Step 2:

[0028] At the right time 20h00, the Recurring applications will read data from this RecurringMsgQueue 06_20H_00m queue, retrieve the subscribers that need to be extended at this time and process renewal, send messages, split charges due to the changes of policy.

Step 3:

[0029] After the renewal process is completed, the Recurring application will store the newly processed customer information into the RecurringMsgQueue_06_21H_00m queue.

Step 4:

[0030] Recurring applications running at the time of 21h00 will handle messaging, separating charges by policy changes at 21h00 to subscribers, and push back in RecurringMsgQueue_07_20H_00m to schedule time for renewal on the next day 20h00 further processing operations.

Evaluation of the Processing Time:

[0031] If you use the solution of scanning all data of 80 million subscribers to search for qualified subscribers to send messages and split rates, the processing time will range from 45 minutes to over 1 hour, in which, database scan time takes up to over 40 minutes.

[0032] Whereas if using the solution mentioned in the invention, the implementation time is less than 5 minutes (due to the number of subscribers satisfying the handling conditions is not much).

[0033] The proposed solution does not require database scanning, so shortening the time to handle the extended problem to 5 minutes (only including the time to perform the operation).

Evaluation of the Impact the System:

[0034] Scanning databases greatly affects online transactions such as making calls, sending SMS messages, accessing data by using a lot of system resources, especially during rush hour from 20:00 until 21:00.

[0035] Meanwhile, the solution proposed according to the invention does not perform database scanning, so it does not affect the online services.

THE ACHIEVED EFFECT OF THE INVENTION

[0036] The effectiveness of the invention is to divide the system data based on a persistent data queue to meet the flexibility of flexibly processing short-term renewal problems:

[0037] Solve renewal problems without dealing with database scans.

[0038] Help the system handle the extension problem faster, minimize the impact of the renewal operation on the performance and stability of the system.

[0039] Flexibly support handling short-term renewal problems.