KR930001443B1 - Data researching method in electronic switching center - Google Patents

Abstract

The method searches data in a data base of a large capacity electronic branch exchange by using rules and relations defined by an user. The method comprises the steps of: (A) defining a search instruction in a user defined form and inserting the instruction on an application program; (B) storing tuple region address and logical offset on an A3 register; (C) calculating physical address of a tuple and storing the address on an A3 register; (D) storing a relation index on a d1 register and storing data of the relation index on a d2 register; (E) checking that input instruction is a user defined relation; (F) jumping to corresponding search routine and returning to the step (A) for the user defined relation and (G) jumping to an error routine and returning to the step (A) for non-user defined relation.

Description

Data Retrieval Method for User-Defined Relations in Database Management System of High Capacity Electronic Switching System

1 is a system configuration applied to the present invention.

2 is a block diagram for explaining the present invention.

3 is a memory map diagram according to the present invention.

4 is a description of the symbols for the main parts of the user-defined relation retrieval processing flowchart diagram according to the present invention.

* Explanation of symbols for main parts of the drawings

10: access and switching module

20: interconnect control processor and number translation control processor

30: central control module 100: application

200: database management system 300: database

The present invention relates to a data retrieval method of a database in a high-capacity electronic switchboard. In particular, the data retrieval method can be improved by retrieving data according to a user-defined rule without using a retrieval processing method provided by a database management system. A data retrieval method for a user-defined relation is provided.

In order to efficiently handle the diversified communication services and the increasing amount of information, exchange systems are changing in structure and function in various ways, and the speed of development is increasing very fast.

Due to these changes and developments, the high-capacity electronic exchanger has excellent scalability and flexibility in terms of its structure, and it is possible to apply new technologies according to technological development. It is designed to be possible.

The electronic switch has a hierarchical distributed structure in which several main processors and subprocessors subordinate to each other form a cooperative system, and the CHILL language, which is the recommendation of the International Telegraph Advisory Committee (CCITT), is used as the main programming language of the system. It is intended to provide maximum concurrency as defined in Z.200.

In general, a program for managing a collection of data, that is, a data base, exists in each processor of an electronic switchboard, which is called a database management system.

The main role of the database management system is to search, delete, change, add, maintain consistency and integrity of data, and the data is organized in a two-dimensional table form, in particular, a relational database. When an application program that is a system user requests processing (or retrieval and modification) of data through a database management system, the database management system retrieves relations in each relay database. The database system of the conventional electronic switchboard is composed of a relay database, and accordingly, a relation search method is sequential search, binary search, and index search. ) The search methods described above allow only one relation to be searched at a time by a search request of an application program that is a user's program. When a user needs data from multiple relations, the database is accessed. There has been a problem that the efficiency is reduced for the system by increasing the number of times.

In other words, when accessing a plurality of relations, access is performed one at a time, which causes a loss in time and increases the load of the system.

Accordingly, an object of the present invention is to provide a search method using a user-defined relation that can increase the efficiency of a system in a database management system of an electronic switchboard.

Another object of the present invention is to provide a search method by a user-defined relation, which is convenient for a user to use.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a system configuration diagram of an all-electronic switch system applied to the present invention, and a central control module 30 comprising an access and switching module 10 accommodating a plurality of subscriber lines, an operation management processor and an operation and maintenance processor; And an interconnection control processor and a number translation control processor 20 for interfacing between the access and switching module 10 and the central control module 30. The access and switching module 10 includes a plurality of access and switching devices. It consists of processors 10a-10b, and one access and switching processor can accommodate up to 4096 subscribers.

The operation management processor 30a is a processor for observing the state of the exchanger, and stores and stores the observation data through a disk, which is an auxiliary storage device, and the operation and maintenance processor 30b is used for charging, statistics, and exchange generated in the system. As a processor that manages error checking, etc., a VDT (Visual Display Terminal), a PC (Personal Computer), and the like are used to input or output data.

Each of the blocks 10, 20, and 30 has a subprocessor therein and has a database and a database management system, respectively.

2 is a block diagram for explaining the present invention, which is an application program 100 which is a user program, a database 300 storing data, and the database 300, and managing the application program 100. It consists of a database management system 200 for outputting the data of the database 300 when there is a data request.

FIG. 3 is a memory map diagram according to the present invention, where 3A shows the registers A1-A7, d1-d7 and the format of the memory 32 of the respective processors 31 in the electronic switchboard. (3B) shows the configuration of the memory map shown in the interface area in the memory 32. The application program 100 inserts a user-defined command to request the necessary data to the database management system 200. The interface area is converted into the form of (3B) by the Command Processor and stored in the memory 32 of the 3A, and the database management system 200 stores the memory 32. After accessing and performing a search, the searched data is provided to the application program 100.

In this case, the processor 31 of 3A uses the MC68020. The tuple area TA in the memory 32 stores a group of data in a row line of a relation in which a search is completed.

4 is a flowchart of a search process for a user-defined relation according to the present invention, wherein (4a) indicates that the processor 31 of (3A) transmits an address of a tuple area TA in the memory 32 in the processor 31. (4b) calculates a logical offset and stores it in the A3 register, and (4c) calculates a physical address of the tuple area TA to calculate an A3 register. (4d) is a process of storing the contents of the A3 register in the tuple area TA, and (4e) a relation index contained in the change clause pointer of the interface area in the memory 32. (4f) multiplying the size of one tuple by the relation index stored in the d1 register of (4e) in the procedural table in the memory 32 and obtaining information about the corresponding relationIt is the process of storing in the d2 register after the departure, (4g) is the process of determining whether the interrupt (interrupt) coming from the application 100 is a user-defined relation, (4h) if the user-defined relation in the process of (4g) Jumping to the search routine, (4i) is a process to return to the process (4a) after the execution of the corresponding search routine after the process (4h) is completed, and (4j) is ( If it is not a user-defined relation in the process of 4g), the process returns to the process (4a) after error processing.

Hereinafter, the present invention will be described in detail with reference to FIGS. 1 through 4 according to the above-described configuration. Referring to FIG. 1, the access and switching module 10, the interconnect control processor, the number translation control processor 20, and the central control module ( Each processor in 30 is an MC68020 and has registers A1-A7 and d1-d7 and memory 32 as shown in FIG.

In the memory 32, there are an interface area, a duple area, and a procedural table area. Also, as shown in FIG. 2, an application program 100 which is a user program is contained. The application program 100 is a program for requesting retrieval of data, for example, a telephone connection program, a telephone bill recording program, and a number translation program.

In the case of searching for any data from the application program 100, which is a user program in FIG. 2, to the database 300, a command as shown in Table 1-1 below is added to the necessary part of the application program 100. .

Table 1-1

With the commands of Table 1-1, the user can be provided with a plurality of data required by the user at one time.

The instructions of Table 1-1 are converted into the structure of the CHILL language by the instruction preprocessor described above, and are included in the corresponding field in the form of (3B) in the interface area of the memory 32 as shown in FIG.

The instruction preprocessor and the compiling step are processed offline, i.e., not loaded on the exchange, so a detailed description thereof will be omitted.

When the compiled program is executed in the online state, the application program 100 including the user-defined relation command requests a data search to the database management system 200.

Therefore, the process of the search request is performed as shown in FIG. 4, wherein the corresponding processor includes the access and switching module 10, the interconnect control processor and the number translation control processor 20, and the central control module 30 of FIG. This is true for any processor in A, which does the same on all processors.

That is, the processor 31 of FIG. 3 performs a process (4a) of storing the address of the tuple area TA in the memory 32 in the A3 register in the processor 31, and then at the value stored in the a3 register. Step 4b is performed by subtracting the value of the transaction number in the interface area and storing the logical offset value of the tuple area TA in the a3 register again.

At this time, the A1 register in the processor 31 includes a physical address of the interface area. In step 4c, when the physical address value and the A3 register value are added and stored in the A3 register, the tuple area TA The physical address of) is saved. In the process (4d), the value of the A3 register is stored again in the tuple area in the memory 32 so that data can be transmitted to the application program 100 using this area after the relation search is completed. .

Next, in the process (4e), the relation index contained in the change clause pointer, which is the interface region in the memory 32, is stored in the register d1 in the processor 31.

Here, the relation index is a unique value previously assigned to the relation, and the index value enters the change clause pointer of the interface area according to the relation type while passing through the preprocessor.

Subsequently, in the process of (4f), the value stored in the register d1 stored in the process (4e) is multiplied by the size of one tuple in the procedure table in the memory 32 and stored in the register d2.

Here, we can see where the information about the relevant relation in the procedural table is. In other words, the procedural table is composed of relation type. For example, if the index is 3 and the size of 1 tuple is 20, the start address of the relation information is 3x20 = 60.

Next, it is determined whether a user-defined relation has been entered in the process of (4g), and after performing the user-defined relations (4h)-(4i), the process returns to the process (4a) again. After executing the process, the process returns to (4a).

Therefore, as described above, data can be accessed from multiple relations at once according to a user-defined rule, thereby reducing the number of database accesses and reducing the load on the system. There is this.

Claims (1)

In the database search method of a large-sized electronic switchboard, a command requesting a search for a user-defined relation is defined by the following rule, $ PSELBCT relation name {abbreviated relation name, number of inputs, type of input, input value ...} (However, $ PSELECT is a defined command.) The first step of inserting into the application program, storing the tuple area address in the corresponding memory in the A3 register, calculating the logical offset, and storing it in the A3 register, and the first step Calculating a physical address of the tuple region after the operation; storing the physical address in the A3 register and storing the physical address in the tuple region in the memory; and performing the second process, the relation index included in the change clause pointer of the interface region in the memory. stored in the register d1 and multiplied by the size of one tuple in the procedural table The third step of storing the information in the d2 register, and after performing the third step determines whether the request from the application program is a user-defined relation, if the user-defined relation is a user-defined relation, jumps to the corresponding search routine to perform the search routine again A fourth process of returning to the first process and a fifth process of returning to the first process after error processing instead of a user-defined relation when performing the fourth process. Search method.

Images