KR20000039983A - Method for implementing database in intelligent network scp system - Google Patents

Abstract

PURPOSE: A method for implementing a database in an intelligent network SCP system is provided to decrease a searching time by composing the method as a distributed tree structure. CONSTITUTION: A tree figure witch wants to be distributed is determined when constructing a database of an intelligent network service control system(ST1). A key value is divided and a share is collected to form a group of a key for having a number of desired tree, and then a tree is distributed using the group of the key as an index of the tree(ST2,ST3). An index by the group of the key is searched to search a tree, and data is read(ST4).

Description

Database Implementation Method of Intelligent Network Recipe System

The present invention relates to an SCP (Service Control Point) system of an intelligent network system, and more particularly, to a method for implementing an SCP database for fast information search and stable management.

In general, the intelligent network has been introduced to realize a flexible communication network structure, provide a standardized network access function, and perform a quick service.

1 is a block diagram of a general intelligent network system.

As shown therein, reference numeral 1 recognizes a dialed digit that can identify a particular service, and inquires it to the centralized database SCP (5) and receives a response to perform a service routing function (SSP) Point, service performing exchange), 2 is Intelligent Peripheral (IP), which is an intelligent peripheral system connected to the SSP 1, and 3 is a VFN connected to the SSP 1 and an Integrated Services Digital Network (ISDN). (Vender Feature Node, Device Provider Feature Node), and 4 is STP (Signal Transfer) which is connected to the SSP 1 and performs a function of delivering a large number of signal messages generated at all signal points of an intelligent network without error in a very short time. Point, a signal relay switch), and 5 has information related to data and procedures necessary for performing an intelligent network service, and S performs overall service control using the same. CP, 6 is a service management system (SMS) that manages the database used by the SCP (5), and efficiently manages and manages subscriber data necessary for service control.

Where Com.Inf stands for Communication Interface and Pgm.Inf stands for Program Interface.

Such intelligent network services include virtual private network services (VPNs), prepaid card services, and freephone services.

For the intelligent network service, each service-specific database is operated inside SCP (5). Therefore, the present invention can be applied to all service-specific database implementations when a new intelligent network service is developed.

In the past, since such an intelligent network service was not built, there was no need to manage a database.

Accordingly, the present invention has been proposed to solve the above conventional problems, and an object of the present invention is to use a tree structure to construct a database, and to eliminate instability that may occur when one tree structure is formed. In order to provide a database implementation method of an intelligent SCP system that can construct a database consisting of a plurality of trees with a large number of indexes, to quickly search for information and build it stably.

Database implementation method of the intelligent network SCP system according to the present invention to achieve the above object,

When constructing database of intelligent network service control system, determine the number of tree to be distributed, divide the key value and take quotient to form the number of tree to get the desired number of trees, and then form the tree with the key group as the index of the tree. After the distribution, the index of each key group is searched and the tree is retrieved to obtain data.

1 is a block diagram of a general intelligent network system,

2 is a flow chart showing a database implementation method of the intelligent network SCP system according to the present invention,

Figure 3 is a database structure diagram for the VPN service of the intelligent network SCP system according to an embodiment of the present invention,

Figure 4 is a database structure diagram for the prepaid card service of the intelligent network SCP system according to an embodiment of the present invention,

5 is a database structure diagram for an incoming billing service of an intelligent network SCP system according to an embodiment of the present invention.

Explanation of symbols for the main parts of the drawings

1: SSP 2: IP

3: VFN 4: STP

5: SCP 6: SMS

Hereinafter, an embodiment according to the technical idea of the database implementation method of the present invention intelligent network SCP system will be described in detail with reference to the accompanying drawings.

First, the present invention uses a tree structure to construct a database, and indexes a plurality of indexes to remove data anomaly that may occur when a pointer to a tree that is unstable that may occur when one tree structure is broken is broken. Composed of multiple trees with, it is possible to quickly search for information and build a stable database.

The intelligent network service includes virtual private network service, prepaid card service, and forwarding billing service.Virtual private network service consists of virtual private network among subscribers in our network (New Century mobile network, SKT mobile network, etc.) and 3 ~ 4 digits This service allows you to make calls only to your extension. In other words, the software implements the function of calling an extension number in the existing PABX (Private Automatic Branch Exchange) network.

Prepaid card service is a service in which a random subscriber of our network purchases a prepaid card issued by a network operator and makes a call using a purchased card. In the case of using a prepaid card that was previously settled monthly after the call, the billing settlement is performed by updating the balance of the prepaid card immediately after the call. Therefore, there is an advantage that you can check the call charge immediately. Another method is to register the terminal with the purchased prepaid card and settle the excess from the amount of the prepaid card purchased at the time of monthly billing settlement. This is convenient for presenting.

Incoming billing service is a service that allows the user to charge the charge of the call that is received to his terminal. At this time, you can deny call charges for situations you do not want by registering options such as time limit or regional limit.

To implement these services, SCP (5), an intelligent network element, manages a database for each service. The contents of the database include the actual subscriber's MIN information for the extension number in the case of the virtual private network service database, the balance information of the card in the case of the prepaid card service database, and the time and region restriction information in the case of the call forwarding service database. Etc.

2 is a flow chart showing a database implementation method of the intelligent network SCP system according to the present invention.

As shown therein, determining the number of trees to be distributed in the database construction of the intelligent network service control system (ST1); Dividing the key values to obtain the desired number of trees, taking a quotient to form a group of keys, and then distributing the tree using the key group as an index of the tree (ST2) (ST3); In step ST4, the index is searched for the key group to search the tree.

Thus, the basic structure of the SCP (5) database constructed by the present invention is a balance tree. The biggest advantage of the balance tree is its fast search time. On the contrary, it is a stability problem. Therefore, the present invention uses multiple distributed tree structures to have faster search time and stability.

A distributed tree does not mean storing the entire subscriber in one tree, but rather distributing it into several trees. The way in which the tree is distributed depends on the characteristics of the keys, the most important being the grouping of the keys.

Thus, in the VPN service of FIG. 3, each extension information is grouped into a VPN group to distribute a tree for each VPN group. In the prepaid card service of FIG. 4, a 12-digit prepaid card number is grouped and distributed into the first 4 digits. In the incoming billing service of 5, keys are grouped by station number and distributed to a tree by station number.

And the most important thing when building a database is the key of information. The characteristics (number of digits) of the keys determine how they can be grouped. So you decide how many trees you want to distribute (the square of 10), and you divide the key values so that you get the number of trees you want, so you have a group of keys. The tree is distributed with this group as the index of the tree.

Creating a key group in this way looks like this:

When distributing a database with n (n: arbitrary integer) numeric keys (K _i ) into 10 ^m trees,

q = (10 ^(nm) )

g (key group) = K _i / q

Equations 1 and 2 are generated as shown in FIG. That is, a key group is made by taking the quotient by dividing the value of the key (K _i) in equation (1).

The obtained key group g is an index of the tree. Thus any key K _i is stored in a tree whose tree index is g.

For example, suppose you want to distribute a database with keys of seven digits to 1000 (10 ³ ) trees.

q = 10 ^(7-3) = 10000

Keys: 1234567, 1237744, 7312501, 7312345, 4431234, 1234568, 4437890, etc.

Key Group: 1234567/10000 = 123, 1237749/10000 = 123, 7312501/10000 = 731,

7312345/10000 = 731, 4431234/10000 = 443, 1234568/10000 = 123,

4437890/10000 = 443

Here, the key group is obtained by dividing the key value by the key and obtaining only the quotient.

Thus, the keys 1234567, 1237744, and 1234568 are the same group and are stored in the tree pointed to by the same tree index 123.

Keys 7312501 and 7312345 are also stored in the tree indicated by the tree index 731.

In addition, the keys 4431234 and 4437890 are stored in the tree indicated by the tree index 443.

So if you want to access the database, you will find the index by key group and search the tree to get the data.

Figure 3 is a database structure diagram for the VPN service of the intelligent network SCP system according to an embodiment of the present invention.

The database is largely composed of two elements. The first is an index organized by VPN group, and the second is a tree structure data area with the extension number as the key.

The tree index is an index composed of VPN group numbers. It is used to find the tree. The tree node can be thought of as a tuple. The four-digit extension number is defined as a key and subscriber number (DN). It consists of subscriber information with other information.

So, if you go to the index of each group, you access the data area of the tree structure with the extension number consisting only of the group.

For example, if the user finds the extension number 1234 in the group m, the user goes to the tree indicated by the index m number and finds the desired extension number 1234 by the tree search method. The data is retrieved from the node having 1234 as the key.

Figure 4 is a database structure diagram for the prepaid card service of the intelligent network SCP system according to an embodiment of the present invention.

The database is largely composed of two elements. The first is an index consisting of the first four digits of the card, and the second is a tree-structured data area with the remaining eight digits as key (prepaid card number consists of 12 digits).

The tree index is an index consisting of four digits of the card number and used to find the tree. The tree node's attributes consist of key and subscriber information. The key is an 8-digit number excluding the first 4 digits of the 12-digit card number, and the subscriber information is composed of the subscriber balance information Remains, the subscriber registration date reg_data, and other information.

So, if you go to the index by card number, you access the data structure of the tree structure where the first four digits consist of the same number.

For example, if the user finds 123456789012, the user goes to the tree indicated by the index 1234 and finds the 56789012 number that is the desired extension number by the tree search method. The data is then retrieved from the node with the desired 56789012 as the key.

5 is a database structure diagram for an incoming billing service of an intelligent network SCP system according to an embodiment of the present invention.

The database is largely composed of two elements. The first is an index consisting of the first three digits of the prepon number, and the second is a data structure in a tree structure with the actual prepon number as a key.

The tree index is a station number index consisting of three digits of the preponder number. It is used to find the tree. The attribute of the tree node consists of key and subscriber information. The key is the pre-phone number, and the subscriber information is min, which is the phone number of the mobile phone to be received, wk_time, wd_time, hd_time, which can be received on weekends, weekdays and holidays, and rst_time, which is the area code information, and other information. It is composed.

So, if you go to the index of three digits before the preponder, you access the data structure of the tree structure where the three digits of the preponder have the same number.

For example, if the user finds the prepon number 7003456, the user goes to the tree indicated by the index 700 and finds the desired number by the tree search method. Data is then fetched from the node with the desired 7003456 as the key.

As described above, the present invention is to construct a fast information search and stable database by constructing a plurality of trees having a plurality of indexes.

Although the preferred embodiment of the present invention has been described above, the present invention may use various changes, modifications, and equivalents. It is clear that the present invention can be applied in the same manner by appropriately modifying the above embodiments. Accordingly, the above description does not limit the scope of the invention as defined by the limitations of the following claims.

As described above, since the database implementation method of the intelligent network SCP system according to the present invention has a distributed tree structure, data search time is reduced. For example, when the search time when n subscribers are configured in one tree and the search time when m-trees are distributed and compared are calculated, when one tree is configured, s = log ₂ n and m In the case of three trees, search time of s = log ₂ (n / m) = log ₂ n-log ₂ m can be shortened.

In addition, if the database consists of one tree structure, if a fatal error occurs in the tree, data loss of all subscribers occurs, but the database consisting of m trees reduces the probability of error for each tree to 1 / m. It also has the effect of increasing index stability and database stability.

Claims (4)

In the intelligent network SCP (Service Control Point) system, Determining the number of trees to be distributed in the database construction of the intelligent network service control system; Dividing the key values and taking a quotient to form a group of keys so that the desired number of trees is obtained, and then distributing the tree using the key group as an index of the tree; And searching for the index of each key group to search the tree to import data. The method of claim 1, wherein the intelligent network SCP system, When constructing database for VPN (Virtual Private Network service) service of intelligent network SCP system, it is an index composed of VPN group number and tree structure with key index used to find the tree and extension number defined by 4 digits as key. Establishing a data area of the; If the user finds the extension number in the desired group, the method for implementing a database of the intelligent SCP system, characterized by searching for the tree using the tree index indicated by the desired group and fetching data in the nodes of the found tree. The method of claim 1, wherein the intelligent network SCP system, When constructing a database for a prepaid card service of an intelligent network SCP system, constructing a tree structured data area having a tree index consisting of the first four digits of the card number and the remaining eight digits of the card number; When the user wants to perform the prepaid card service, the user goes to the tree indicated by the first four digits of the card number, finds the remaining eight digits of the extension number by searching the tree, and fetches data in the node of the found tree. Implementation method of intelligent network SCP system. The method of claim 1, wherein the intelligent network SCP system, When constructing a database for an incoming billing service of an intelligent network SCP system, constructing a data structure having a tree structure having an index consisting of three digits of the preponder number and an actual preponder number as a key; When the user wants to perform the incoming billing service, the user searches for an index of three digits of the preponder and accesses the data area of the tree structure in which the three digits of the preponder number have the same number to bring the data. How to implement a database of intelligent SCP system.