Method of fast one-way search and database thereof

Abstract

The present invention discloses a database and a one-way fast searching method thereof. In a first table the recording identification of recording of each section head obtained by dividing the database is stored, in a second table a plurality of recording identifications with continuous addresses are stored, the address is previous to the address of the last searching recording. The method of the invention comprises the following procedures: receiving the request of the data part; confirming whether the recording identification address of the current requested recording is previous to the recording identification address of the last searching recording, if it is searching the recording identification of the current requested recording in the second table; and confirming whether the recording identification of the current requested record can be found in the second table, and if not one way searching the recording identification of the current requested recording.

Description

technical field [0001] The present invention relates to a database and its one-way fast search method, especially a one-way fast search method using the first table of sections obtained from an evenly divided database for several sections. Background technique [0002] In the early days, databases that stored a large number of records usually had a static serial representation (sequential representation) as its structure, such as: Array (Array), Stacks (Stacks) or Queues (Queues). This static serial database structure has the advantage of faster access to individual requested data. But its disadvantage is that the action of inserting or deleting data needs to move a large amount of data in the database. As far as a database is concerned, if data must be inserted or deleted frequently, then the database is not suitable for using a static serial structure. Therefore, the database structure of dynamic serial (Linked List) is the current mainstream and widely adopted structure...

AI Technical Summary

Problems solved by technology

In fact, it is impossible to retrieve all the records and data in the database to the remote console, and then search for these records and data, but only a small amount of records can be retrieved and stored in the memory device of the remote console to search for data, and retrieve other records when the user has other requests

However, there is still a shortcoming of the search method in this one-way link serial database, that is, when the address of the current request record precedes the address of the last search record along the search direction of the database, it must start from the beginning of the database. to find the currently requested record along the search direction

As in the aforementioned network (IPMI) database or other similar cases, searching for data in a one-way linked serial database takes longer than searching for records in a bidirectionally linked serial database

Images