Non-only indexes search method for internal memory data

Abstract

The invention discloses a non-unique index searching method of internal memory data, which comprises the following steps: (1) building to generate the non-unique parameter mark of the internal memory data; distributing the index register list according to the parameter mark; (2) building the non-unique index for the internal memory data according to the index register list; (3) utilizing the non-unique index to search the internal memory data. The inveniton simplifies the code of operating mode of database, which reduces the coupling of database operating mode and internal memory database.

Description

technical field [0001] The invention discloses a retrieval method for data provided by a memory database in the communication field, and particularly relates to a realization method for establishing a non-unique index for data in the memory database to locate data records. Background technique [0002] In the NGN network, the intercommunication between the PSTN network and the packet network is realized. As a network element connecting PSTN and IP packet network, MSG uses a memory database in order to improve the data processing capability and enhance the real-time performance of the system. The use of in-memory databases is becoming more and more widespread in network devices. [0003] In the currently used memory database, the record retrieval of the memory table is accomplished by establishing an index. The way to realize it is to build an index according to the keywords of the memory table when the record is inserted into the memory table. In memory databases, in most...

AI Technical Summary

Problems solved by technology

[0004] This method has an obvious disadvantage, that is, when creating a sequential index, it is necessary to move the memory and insert the newly created index value into an appropriate position, which takes a long time and affects the real-time performance of the system; in addition, due to the partial matching of the sequential index, When locating the required records, the time complexity of the retrieval will increase by n / 2 times. In the worst case, it needs to compare n times to retrieve and locate the memory records; at the same time, the sequential index is only used in small and medium-sized In the case of a large amount of data, it is not suitable for a memory table with a large amount of data

Images