CN110222074A - It indexes lookup method, search device, electronic equipment and storage medium - Google Patents

Abstract

An embodiment of the present invention provides an index search method, a search device, an electronic device, and a storage medium, wherein the method includes: acquiring a target index identifier; Compare the reference index identifiers to determine the target index interval corresponding to the target index identifier; determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and convert the target index information to the target index information. Read into the first storage medium; search for the target index identifier in the target index information based on a preset search algorithm to obtain the index to be searched. The embodiment of the present invention can shorten the search time of the index.

Description

Index search method, search device, electronic device and storage medium

technical field

The invention relates to the technical field of data storage, in particular to an index search method, a search device, electronic equipment and a storage medium.

Background technique

An index is a structure for sorting the values of one or more columns in a database table. In the prior art, the index technology is usually used to improve the access speed to the database.

Specifically, since the read/write performance of the memory is much greater than that of the disk, the index file is usually stored in the memory in the prior art. When a database access request is received, the index file is first read to locate the data in the database. The storage location, and then access the database according to the storage location, thus greatly improving the access speed to the database.

The inventor found in the process of implementing the present invention that when the index file is too large, the index file cannot be stored in the memory for a long time, and can only be stored on the disk. This is because if the index file is stored in the memory, it will consume The storage system has too many memory resources, causing the storage system to be slowed down. Therefore, every time data is read, the entire index file needs to be read from the disk into the memory, and then the database is queried based on the reading result of the index file, and the index file is released after the access result is obtained from the database. The memory used. In this way, since each time the data is read, the entire index file needs to be read into the memory first, and the index file itself is large, and the process of reading into the memory takes a long time, which affects the access speed of the database. question.

Contents of the invention

The purpose of the embodiment of the present invention is to provide an index search method, search device, electronic equipment and storage medium, so as to shorten the search time of the index. The specific technical scheme is as follows:

In a first aspect, an embodiment of the present invention provides an index search method, including:

Obtaining a target index identifier, where the target index identifier is an index identifier of an index to be searched;

comparing the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determining a target index interval corresponding to the target index identifier;

Determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the first storage The data read and write performance of the medium is higher than the data read and write performance of the second storage medium;

The target index identifier is searched in the target index information based on a preset search algorithm to obtain the index to be searched.

Optionally, the reference index identifier is obtained by the following method:

traversing the index files stored in the second storage medium in advance;

A plurality of index identifiers are extracted from the index file at intervals in a predetermined sequence as the reference index identifiers.

Optionally, the step of determining the index information corresponding to the target index interval from the index file stored in the second storage medium includes:

determining the sequence number of the target index interval;

determining the starting offset of the target index section in the index file based on the sequence number of the target index section;

determining the total amount of bytes of the indexes included in the target index range;

The target index information is determined based on the start offset and the total amount of bytes of indexes contained in the target index interval.

Optionally, the sequence number of the target index interval is determined by the following method: according to the order of reference index identifiers corresponding to the target index interval in the plurality of reference indexes, the sequence number of the target index interval is determined.

Optionally, the starting offset O of the target index interval in the index file is determined based on a first preset expression, where the first preset expression is:

O=N*Q*S

Wherein, N is the sequence number of the target index interval, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Optionally, the total number of bytes TS of the indexes included in the target index range is determined based on a second preset expression, where the second preset expression is:

TS=Q*S

Wherein, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Optionally, the preset search algorithm may be any one of the following methods: binary method, binary sorting tree method, hash table method, and block search method.

Optionally, the second storage medium is a magnetic disk, and the first storage medium is a memory.

In a second aspect, an embodiment of the present invention provides an index search device, including:

An acquisition module, configured to acquire a target index identifier, where the target index identifier is an index identifier of an index to be searched;

A determining module, configured to compare the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determine a target index interval corresponding to the target index identifier;

A reading module, configured to determine index information corresponding to the target index interval from an index file stored in the second storage medium, obtain target index information, and read the target index information into the first storage medium , the data read and write performance of the first storage medium is higher than the data read and write performance of the second storage medium;

A search module, configured to search for the target index identifier in the target index information based on a preset search algorithm to obtain the index to be searched.

Optionally, the device also includes:

A traversal module, configured to pre-traverse the index files stored in the second storage medium;

An extracting module, configured to extract a plurality of index identifiers at intervals in a predetermined order from the index file as the reference index identifiers.

Optionally, the determination module includes:

A first determining submodule, configured to determine the sequence number of the target index interval;

The second determination submodule is configured to determine the starting offset of the target index range in the index file based on the sequence number of the target index range;

A third determining submodule, configured to determine the total amount of bytes of the indexes contained in the target index interval;

The fourth determining submodule is configured to determine the target index information based on the start offset and the total amount of bytes of the indexes contained in the target index interval.

Optionally, the first determining submodule is specifically used for:

The sequence number of the target index range is determined according to the sequence of reference index identifiers corresponding to the target index range in the plurality of reference indexes.

Optionally, the starting offset O of the target index interval in the index file is determined based on a first preset expression, where the first preset expression is:

O=N*Q*S

Wherein, N is the sequence number of the target index interval, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Optionally, the total number of bytes TS of the indexes included in the target index range is determined based on a second preset expression, where the second preset expression is:

TS=Q*S

Wherein, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Optionally, the preset search algorithm may be any one of the following methods: binary method, binary sorting tree method, hash table method, and block search method.

Optionally, the second storage medium is a magnetic disk, and the first storage medium is a memory.

In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a machine-readable storage medium, the machine-readable storage medium stores machine-executable instructions that can be executed by the processor, and the processing The machine executes the machine-executable instructions to implement the method steps of the index lookup method provided in the first aspect above.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the index search provided by the above-mentioned first aspect is realized The method steps of the method.

In the fifth aspect, the embodiment of the present invention also provides a computer program product containing instructions, which, when run on a computer, causes the computer to execute the method steps of the index search method provided in the first aspect above.

In a sixth aspect, an embodiment of the present invention further provides a computer program, which, when run on a computer, causes the computer to execute the method steps of the index search method provided in the first aspect.

In the index search method, search device, electronic equipment and storage medium provided by the embodiments of the present invention, after obtaining the target index mark, the target index mark is compared with a plurality of reference index marks pre-stored in the first storage medium , determine the target index interval corresponding to the target index identifier, and then determine the index information corresponding to the target index interval from the index file stored in the second storage medium, and read the target index information into the first storage medium, and Compared with reading the entire index file in the prior art, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, thereby shortening the index reading time, thereby shortening the index search time. Of course, implementing any product or method of the present invention does not necessarily need to achieve all the above-mentioned advantages at the same time.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic flow chart of the first index search method provided by an embodiment of the present invention;

FIG. 2 is a schematic diagram of storing multiple indexes in an embodiment of the present invention;

FIG. 3 is a schematic flowchart of step S103 in the index search method provided by the embodiment of the present invention;

FIG. 4 is a schematic flowchart of a second index search method provided by an embodiment of the present invention;

Fig. 5 is a first structural schematic diagram of an index search device provided by an embodiment of the present invention;

FIG. 6 is a schematic diagram of a second structure of an index search device provided by an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of a determination module in an index search device provided by an embodiment of the present invention;

FIG. 8 is a schematic structural diagram of an electronic device provided by an embodiment of the present invention.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

The existing index lookup method can usually also adopt the following scheme:

In the current application scenario, due to the excessive number of indexes generated during the data storage process, all the indexes cannot be put into the memory. Therefore, each time the data is read, the index needs to be read from the disk first, and then read according to the index. Data, however, this method needs to traverse the index in order from the index file stored in the disk until the index that needs to be read is found, because the worst case is that the index in the entire index file needs to be traversed, because it needs It takes a lot of time, so it is not suitable for application scenarios with high search performance requirements.

In view of this, as shown in FIG. 1, an embodiment of the present invention provides an index search method, which may include the following steps:

S101. Acquire a target index identifier.

It can be understood that after the index is stored, an index identifier of the index may be generated, and the index identifier is used to identify a storage order of the index. After receiving a query request for a piece of data in the database, the index identifier of the index corresponding to the data to be searched, ie, the target index identifier, is obtained from the query request.

S102. Based on a preset search algorithm, compare the target index identifier with multiple reference index identifiers pre-stored in the first storage medium, and determine a target index interval corresponding to the target index identifier.

In the embodiment of the present invention, a plurality of reference index identifiers may be pre-stored in the first storage medium, and these reference index identifiers may be used to identify intervals of multiple indexes stored in the index file, so as to identify multiple index intervals. The multiple reference index identifiers are obtained by the following method: traversing the index file, and extracting multiple index identifiers from the index file at predetermined intervals as reference index identifiers. The multiple reference index identifiers can be stored in the form of an array.

The following first describes the stored procedure of the index:

After a piece of data is stored on the disk, the index corresponding to the data can be generated to quickly find the data through the generated index in the future. Then, for multiple indexes, they can be saved to the index file according to the preset storage order In , for example, indexes are stored in the order of index generation time.

Exemplarily, multiple indexes in the embodiment of the present invention can be stored in the form shown in FIG. 2. In FIG. Indicates), the index number (indicated by id), the offset of the data corresponding to the index (indicated by off), and the size of the data corresponding to the index (indicated by size).

Wherein, the above-mentioned index identification corresponds to the storage order of each index, that is, the above-mentioned index identification can identify the storage order of each index; the above-mentioned index number is used to represent the unique identification number of an index, and generally, the index number of an index is the same as the The current index identifier of the index is the same; the above offset is used to indicate the offset of the data corresponding to the index in the disk, so that the data corresponding to the index can be located on the disk; the above size is used to indicate the data corresponding to the index in the disk The size of the storage space used.

Referring to FIG. 2, it can be seen that the index marks of each index are not always continuous. For example, the order of the index marks corresponding to each index in FIG. 2 is: 0, 2, 3, 4, 6..., where 0 and 2 Discontinuous, 2 to 4 are continuous, and 4 and 6 are not continuous. This is because when the stored data is deleted, the corresponding index will also be deleted, so the index may be discontinuous, but it can be seen Yes, the overall order of the multiple indexes has not changed, that is, the above index identifiers are still arranged in ascending order.

The mapping relationship between the reference index identifier and the index file, and the generation process of the reference index identifier are further described below still taking Figure 2 as an example:

Traverse the index file shown in Figure 2, extract the index identifiers 0, 28, and 36 according to the interval of 16 index data, and put them into the pre-defined array seq_array as the reference index identifier, so as to establish the reference index identifier and The mapping relationship of index files. Specifically, referring to the index identifiers 0, 28, and 36, the index file is divided into three index intervals: [0, 28), [28, 61), [61, ∞), where [0, 28) represents the index identifier It is the interval from 0 to 28 (not including 28), [28, 61) means the interval whose index is 28 to 61 (not including 61), [61, ∞) means the interval after the index is 61 (not including 61) . The interval [61, ∞) also contains index identifiers corresponding to 16 indexes.

In the embodiment of the present invention, the target index identifier can be compared with multiple reference index identifiers to determine the index interval corresponding to the target index identifier and the index file, that is, the target index interval.

Exemplarily, if the target index ID is 39, 39 may be compared with the above 0, 28, 61 to determine the target index range corresponding to the target index ID 39. For example, using the dichotomy method for comparison, the comparison process can be: first compare 39 with 28, 39 is larger than 28, then compare 39 with 61, 39 is smaller than 61, indicating that 39 is in the interval between 28 and 61, expressed as [ 28, 61), this interval is the target index interval.

As an optional implementation manner of the embodiment of the present invention, other search algorithms may be used for search, for example, a binary sorting tree method, a hash table method, a block search method, and the like.

As an optional implementation manner of the embodiment of the present invention, the above-mentioned first storage medium may specifically be a memory, which has the characteristics of high read-write performance and short delay, and the above-mentioned reference index identification just requires the read-write characteristics of the memory, that is, It is necessary to quickly read the reference index identifier. Therefore, saving the reference index identifier in the memory can take advantage of the performance advantages of the memory to quickly determine the target index interval corresponding to the target index identifier, thereby improving the search efficiency.

As an optional implementation of the embodiment of the present invention, for multiple indexes stored in sequence, based on the reference index identifier, the indexes stored in the index file can be divided into intervals in advance, that is, these indexes can be divided into different indexes interval, so as to quickly determine the target index interval corresponding to the target index identifier directly in the pre-divided index interval.

Referring to FIG. 1, S103, determine index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium.

After the target index section is determined, the index information corresponding to the target index area can be determined from the index file stored in the second storage medium, that is, the target index information can be obtained. Exemplarily, referring to FIG. 2, when the target index interval is [28, 61), then the index information corresponding to the target index interval [28, 61) can be determined in the index file, and then the determined index information is read The data is fetched to the first storage medium, wherein the data read and write performance of the first storage medium is higher than the data read and write performance of the second storage medium. The second storage medium may be, for example, a magnetic disk.

As an optional implementation manner of the embodiment of the present invention, as shown in FIG. 3, the above step S103 may specifically be:

S1031. Determine the sequence number of the target index interval.

S1032. Determine the starting offset of the target index section in the index file based on the sequence number of the target index section.

S1033. Determine the total amount of bytes of the indexes included in the target index interval.

S1034. Determine target index information based on the start offset and the total amount of bytes of the index contained in the target index interval.

Optionally, the starting offset O of the target index range in the index file may be determined based on a first preset expression, where the first preset expression is:

O=N*Q*S

Among them, N is the serial number of the target index range, Q is the number of indexes contained in the target index range, and S is the number of bytes of each index. Those skilled in the art can flexibly set the number of indexes contained in the target index interval according to actual business requirements, and the specific numerical value is not limited in this embodiment of the present invention.

Steps S1031 to S1034 are described below:

Referring to Figure 2, the three index intervals determined by the three reference index identifiers 0, 28, and 36 can be: [0, 28), [28, 61), [61, ∞), when the target index interval is [28, 61), the target index interval is the second interval, and the serial number N is 1 (counting from 0), then the starting offset in the index file is: N*16*24, where 16 is the index interval The number of indexes in the index, 24 is the number of bytes of the index in the index file (usually a preset fixed size, the unit is bit). According to the above first preset expression: N*16*24=1*16*24=384, it can be determined that the starting offset of the target index section in the index file is 384.

Optionally, the total number of bytes TS of the indexes included in the target index range may be determined based on a second preset expression, where the second preset expression is:

TS=Q*S

Among them, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Exemplarily, if the number of indexes contained in the target index range is 16, and the number of bytes of each index is 24, it can be determined that the total number of bytes TS of the indexes contained in the target index range is: 16*24=384.

As an optional implementation manner of the embodiment of the present invention, the sequence number of the target index range may be determined according to the order of the reference index identifiers corresponding to the target index range in multiple reference indices.

Exemplarily, the reference index identification corresponding to the target index interval is 39, and 39 belongs to the target index interval [28, 61), where 28 is the second number in the array [0, 28, 61], since the array is from The calculation starts from 0, so you need to subtract 1 from 2 to get 1, that is, 39 belongs to the first interval, that is, the sequence number of the target index interval where 39 is located is 1.

Referring to FIG. 1 , in S104 , the target index identifier is searched in the target index information based on a preset search algorithm to obtain the index to be searched.

After the target index information is determined, since the target index information includes the index to be searched and its index identifier, a preset search algorithm can be used to search the target index identifier in the target index information to obtain the index to be searched.

As an optional implementation of the embodiment of the present invention, in order to improve the search speed, the embodiment of the present invention can use different preset search algorithms to search, for example, binary method, binary sorting tree method, hash table method, classification block search etc.

When using binary search, for example, if the found target index is 39, the target index 39 can be compared with the middle index 46 in the target index interval [28, 61), 39 is less than 46, It indicates that the index is in the subinterval [28, 46]. Then, using the binary search algorithm, the target index identification 39 is compared with the middle index identification in the subinterval [28, 46]. The middle index identification It also happens to be 39, then the index is found, and the records of the index can be read: seq:39, id:39, off:10210, size:40687.

As an optional implementation manner of the embodiment of the present invention, as shown in FIG. 4, the reference index identifier can be obtained by the following method:

S201. Traverse index files stored in the second storage medium in advance.

This step may be before step S101. In this embodiment of the present invention, an index identifier of each index may be generated by traversing an index file stored in a second storage medium in advance, for example, traversing an index file stored in a disk. Referring to FIG. 2 . The index identifier has been described in the foregoing embodiments, and will not be repeated here.

S202. Extract a plurality of index identifiers from the index file at intervals in a predetermined order as reference index identifiers.

It can be understood that for the multiple extracted reference index identifiers, they may specifically be storage sequence numbers or index numbers. Therefore, the range of index identifiers corresponding to each index interval can be determined by referring to the index identifiers, and then the index to be searched can be determined. The index identifier range to which the identifier belongs, and since the index identifier is in one-to-one correspondence with the index, after determining the index identifier range to which the index identifier belongs, the target index interval corresponding to the target index identifier can be easily determined. It is precisely because the above-mentioned reference identifier can be used to determine the target index interval corresponding to the target index identifier, so it is called a reference identifier. By generating the reference index identifier, the time for determining the target index interval corresponding to the target index identifier can be shortened.

After the multiple reference identifiers are obtained, the multiple reference identifiers may be stored in the first storage medium, for example, stored in a memory, for subsequent use.

In an index search method provided by an embodiment of the present invention, after obtaining the target index ID, the target index corresponding to the target index ID is determined by comparing the target index ID with a plurality of reference index IDs pre-stored in the first storage medium. index section, and then determine the index information corresponding to the target index section from the index file stored in the second storage medium, and read the target index information into the first storage medium, which is similar to reading the entire index file in the prior art Compared with that, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, and the index reading time is shortened, thereby shortening the index search time.

Corresponding to the above method embodiments, the embodiments of the present invention also provide corresponding device embodiments.

As shown in Figure 5, an embodiment of the present invention provides an index search device, which corresponds to the embodiment shown in Figure 1, and the device includes:

The acquiring module 501 is configured to acquire a target index identifier, where the target index identifier is an index identifier of an index to be searched.

The determination module 502 is configured to compare the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determine a target index interval corresponding to the target index identifier.

The reading module 503 is configured to determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the first The data read and write performance of the storage medium is higher than the data read and write performance of the second storage medium.

The search module 504 is configured to search for the target index identifier in the target index information based on a preset search algorithm to obtain the index to be searched.

Wherein, as shown in FIG. 6, on the basis of the device structure shown in FIG. 5, the index search device in the embodiment of the present invention may further include:

The traversal module 601 is configured to pre-traverse the index files stored in the second storage medium.

The extracting module 602 is configured to extract a plurality of index identifiers from the index file at predetermined intervals as reference index identifiers.

Wherein, as shown in FIG. 7, the determination module 502 includes:

The first determination sub-module 5021 is configured to determine the sequence number of the target index interval.

The second determination sub-module 5022 is configured to determine the starting offset of the target index range in the index file based on the serial number of the target index range.

The third determination sub-module 5023 is configured to determine the total amount of bytes of the index contained in the target index interval.

The fourth determination sub-module 5024 is configured to determine target index information based on the start offset and the total number of bytes of the index contained in the target index interval.

Among them, the first determination sub-module is specifically used for:

The sequence number of the target index range is determined according to the order of the reference index identifiers corresponding to the target index range in the plurality of reference indices.

Wherein, the starting offset O of the target index interval in the index file is determined based on the first preset expression, and the first preset expression is:

O=N*Q*S

In the formula, N is the serial number of the target index interval, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Wherein, the total amount of bytes TS of the indexes contained in the target index interval is determined based on the second preset expression, and the second preset expression is:

TS=Q*S

Among them, Q is the number of indexes contained in the target index interval, and S is the number of bytes of each index.

Wherein, the preset search algorithm may be any one of the following methods: binary method, binary sorting tree method, hash table method, and block search method.

Wherein, the second storage medium is a disk, and the first storage medium is a memory.

In an index search device provided by an embodiment of the present invention, after acquiring a target index ID, the target index ID corresponding to the target index ID is determined by comparing the target index ID with a plurality of reference index IDs pre-stored in the first storage medium. index section, and then determine the index information corresponding to the target index section from the index file stored in the second storage medium, and read the target index information into the first storage medium, which is similar to reading the entire index file in the prior art Compared with that, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, and the index reading time is shortened, thereby shortening the index search time.

The embodiment of the present invention also provides an electronic device, which may be specifically a server. As shown in FIG. 8, the device 800 includes a processor 801 and a machine-readable storage medium 802. The machine-readable storage medium stores information that can be executed by the processor. machine-executable instructions, the processor executes the machine-executable instructions to implement the following steps:

Obtain the target index ID, where the target index ID is the index ID of the index to be searched;

comparing the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determining a target index interval corresponding to the target index identifier;

Determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the data read and write performance of the first storage medium Higher data read and write performance than the second storage medium;

Based on a preset search algorithm, the target index identifier is searched in the target index information to obtain the index to be searched.

An electronic device provided by an embodiment of the present invention determines the target index corresponding to the target index ID by comparing the target index ID with a plurality of reference index IDs pre-stored in the first storage medium after acquiring the target index ID interval, and then determine the index information corresponding to the target index interval from the index file stored in the second storage medium, and read the target index information into the first storage medium, compared with the prior art of reading the entire index file In this embodiment of the present invention, the number of indexes of the target index information read into the first storage medium is greatly reduced, and the index reading time is shortened, thereby shortening the index search time.

The above-mentioned machine-readable storage medium may include a random access memory (Random Access Memory, RAM for short), and may also include a non-volatile memory (non-volatile memory), such as at least one magnetic disk memory. Optionally, the memory may also be at least one storage device located far away from the aforementioned processor.

The above-mentioned processor can be a general-purpose processor, including a central processing unit (Central Processing Unit, referred to as CPU), a network processor (Network Processor, referred to as NP), etc.; it can also be a digital signal processor (Digital Signal Processing, referred to as DSP) , Application Specific Integrated Circuit (ASIC for short), Field Programmable Gate Array (Field-Programmable Gate Array, FPGA for short) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

An embodiment of the present invention provides a computer-readable storage medium. A computer program is stored in the computer-readable storage medium. When the computer program is executed by a processor, it is used to perform the following steps:

Obtain the target index ID, where the target index ID is the index ID of the index to be searched;

comparing the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determining a target index interval corresponding to the target index identifier;

Determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the data read and write performance of the first storage medium Higher data read and write performance than the second storage medium;

Based on a preset search algorithm, the target index identifier is searched in the target index information to obtain the index to be searched.

The computer-readable storage medium provided by the embodiment of the present invention determines the target corresponding to the target index ID by comparing the target index ID with multiple reference index IDs pre-stored in the first storage medium after acquiring the target index ID. index section, and then determine the index information corresponding to the target index section from the index file stored in the second storage medium, and read the target index information into the first storage medium, which is similar to reading the entire index file in the prior art Compared with that, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, and the index reading time is shortened, thereby shortening the index search time.

An embodiment of the present invention provides a computer program product containing instructions, which when run on a computer causes the computer to perform the following steps:

Obtain the target index ID, where the target index ID is the index ID of the index to be searched;

comparing the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determining a target index interval corresponding to the target index identifier;

Determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the data read and write performance of the first storage medium Higher data read and write performance than the second storage medium;

Based on a preset search algorithm, the target index identifier is searched in the target index information to obtain the index to be searched.

In the computer program product including instructions provided by the embodiment of the present invention, after obtaining the target index ID, the target index ID is compared with multiple reference index IDs pre-stored in the first storage medium to determine the corresponding target index ID The target index interval, and then determine the index information corresponding to the target index interval from the index file stored in the second storage medium, and read the target index information into the first storage medium, which is the same as reading the entire index file in the prior art In comparison, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, thereby shortening the index reading time, thereby shortening the index search time.

An embodiment of the present invention also provides a computer program that, when run on a computer, causes the computer to perform the following steps:

Obtain the target index ID, where the target index ID is the index ID of the index to be searched;

comparing the target index identifier with a plurality of reference index identifiers pre-stored in the first storage medium based on a preset search algorithm, and determining a target index interval corresponding to the target index identifier;

Determine the index information corresponding to the target index interval from the index file stored in the second storage medium, obtain the target index information, and read the target index information into the first storage medium, the data read and write performance of the first storage medium Higher data read and write performance than the second storage medium;

Based on a preset search algorithm, the target index identifier is searched in the target index information to obtain the index to be searched.

The computer program including instructions provided by the embodiment of the present invention determines the target corresponding to the target index ID by comparing the target index ID with a plurality of reference index IDs pre-stored in the first storage medium after acquiring the target index ID. index section, and then determine the index information corresponding to the target index section from the index file stored in the second storage medium, and read the target index information into the first storage medium, which is similar to reading the entire index file in the prior art Compared with that, the number of indexes of the target index information read into the first storage medium in the embodiment of the present invention is greatly reduced, and the index reading time is shortened, thereby shortening the index search time.

For the apparatus/electronic equipment/storage medium embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and for relevant parts, please refer to part of the description of the method embodiments.

It should be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is a relationship between these entities or operations. There is no such actual relationship or order between them. Furthermore, the term "comprises", "comprises" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article, or apparatus comprising a set of elements includes not only those elements, but also includes elements not expressly listed. other elements of or also include elements inherent in such a process, method, article, or device. Without further limitations, an element defined by the phrase "comprising a ..." does not preclude the presence of additional identical elements in the process, method, article, or apparatus that includes the element.

Each embodiment in this specification is described in a related manner, the same and similar parts of each embodiment can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for relevant parts, refer to part of the description of the method embodiment.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present invention are included in the protection scope of the present invention.

Claims (18)

1. a kind of index lookup method, which is characterized in that the described method includes:

Target index mark is obtained, the target index is identified as the index mark of index to be found；

The target is indexed into mark based on default lookup algorithm and is stored in advance in multiple with reference to rope in the first storage medium Tendering knowledge is compared, and determining target corresponding with target index mark indexes section；

Index information corresponding with target index section is determined from the index file being stored in the second storage medium, is obtained It is read in the first storage medium to target index information, and by the target index information, the number of first storage medium It is higher than the reading and writing data performance of second storage medium according to readwrite performance；

The target index mark is searched in the target index information based on preset lookup algorithm, is obtained described to be found Index.

2. the method according to claim 1, wherein reference key mark obtains by the following method:

The index file being stored in second storage medium is traversed in advance；

Multiple indexes are extracted according to predetermined order interval from the index file to identify, and are identified as the reference key.

3. the method according to claim 1, wherein described from the index file being stored in the second storage medium The step of corresponding index information in middle determination and the target index section, comprising:

Determine the serial number in target index section；

Start offset of the target index section in the index file is determined based on the serial number in target index section Amount；

Determine the byte total amount for the index for including in target index section；

The target rope is determined based on the byte total amount for the index for including in the start offset amount and target index section Fuse breath.

4. according to the method described in claim 3, it is characterized in that, determining the sequence in target index section by the following method Number: the corresponding reference key in section is indexed according to the target and identifies the sequence in the multiple reference key, determine described in The serial number in target index section.

5. according to the method described in claim 3, it is characterized in that, determining the target index area based on the first default expression formula Between start offset amount O in the index file, the first default expression formula are as follows:

O=N*Q*S

Wherein, N is the serial number that the target indexes section, and Q is the quantity that the target indexes the index for including in section, and S is The byte quantity of every index.

6. according to the method described in claim 3, it is characterized in that, determining the target index area based on the second default expression formula Between in include index byte total amount TS, the second default expression formula are as follows:

TS=Q*S

Wherein, Q is the quantity that the target indexes the index for including in section, and S is the byte quantity of every index.

7. method according to claim 1-6, which is characterized in that the preset lookup algorithm can be following Any one of method: dichotomy, binary sort tree method, Hash table method, block research method.

8. method according to claim 1-6, which is characterized in that second storage medium is disk, described First storage medium is memory.

9. a kind of index searches device, which is characterized in that described device includes:

Module is obtained, for obtaining target index mark, the target index is identified as the index mark of index to be found；

Determining module, for the target to be indexed mark based on default lookup algorithm and is stored in advance in the first storage medium Multiple reference keys mark be compared, determining target index corresponding with target index mark section；

Read module, it is corresponding with target index section for being determined from the index file being stored in the second storage medium Index information, obtain target index information, and the target index information is read in the first storage medium, described first The reading and writing data performance of storage medium is higher than the reading and writing data performance of second storage medium；

Searching module, for searching the target index mark in the target index information based on preset lookup algorithm, Obtain the index to be found.

10. device according to claim 9, which is characterized in that described device further include:

Spider module, for traversing the index file being stored in second storage medium in advance；

Abstraction module is identified for extracting multiple indexes according to predetermined order interval from the index file, as the ginseng Examine index mark.

11. device according to claim 9, which is characterized in that the determining module, comprising:

First determines submodule, for determining the serial number in target index section；

Second determines submodule, for determining target index section in the rope based on the serial number in target index section Start offset amount in quotation part；

Third determines submodule, for determining the byte total amount for the index for including in target index section；

4th determines submodule, for the byte based on the index for including in the start offset amount and target index section Total amount determines the target index information.

12. device according to claim 11, which is characterized in that described first determines submodule, is specifically used for:

Index the corresponding reference key in section according to the target and identify the sequence in the multiple reference key, determine described in The serial number in target index section.

13. device according to claim 11, which is characterized in that determine that the target indexes based on the first default expression formula Start offset amount O of the section in the index file, the first default expression formula are as follows:

O=N*Q*S

Wherein, N is the serial number that the target indexes section, and Q is the quantity that the target indexes the index for including in section, and S is The byte quantity of every index.

14. device according to claim 11, which is characterized in that determine that the target indexes based on the second default expression formula The byte total amount TS for the index for including in section, the second default expression formula are as follows:

TS=Q*S

Wherein, Q is the quantity that the target indexes the index for including in section, and S is the byte quantity of every index.

15. according to the described in any item devices of claim 9-14, which is characterized in that the preset lookup algorithm can be with Any one of lower method: dichotomy, binary sort tree method, Hash table method, block research method.

16. according to the described in any item devices of claim 9-14, which is characterized in that second storage medium is disk, institute Stating the first storage medium is memory.

17. a kind of electronic equipment, which is characterized in that including processor and machine readable storage medium, the machine readable storage Media storage has the machine-executable instruction that can be executed by the processor, and the processor executes the executable finger of the machine Enable the method and step to realize the described in any item index lookup methods of claim 1-8.

18. a kind of computer readable storage medium, which is characterized in that be stored with computer in the computer readable storage medium Program realizes the side of the described in any item index lookup methods of claim 1-8 when the computer program is executed by processor Method step.