A kind of index structure and index method

Abstract

The invention provides an index structure and an index method. The inverted index structure comprises a vocabulary index file, a word position index file, at least one word inverted term file and a management file, wherein word and ID corresponding relation information is stored in the vocabulary index file; storage position information of revere terms of words corresponding to ID in the word inverted term file are stored in the word position index file; the storage position information comprises position information of the first nodes and the final nodes of block chains; each word inverted term file comprises blocks identical in size, one block is only used for storing the inverted term of one word, the blocks, to which the inverted terms of the same word correspond, form a block chain structure, the first node of the block chain structure is used for retrieval, and the final node of the block chain structure is used for adding the inverted items of the words; management information for managing the word inverted term file is stored in the management file. The index structure and the index method can be used for increasing the index speed and meeting the retrieval requirements of users.

Description

technical field [0001] The present invention relates to an index structure, in particular to an index structure and an index method. Background technique [0002] Data stored in data processing devices (such as computers or servers) can be roughly divided into structured data and unstructured data, wherein structured data such as databases, and unstructured data such as emails and word documents. For structured data, traversal is usually used for retrieval; for unstructured data, linear scanning is usually used for retrieval. [0003] Whether it is for structured data or unstructured data, how to quickly find information that can meet user needs from large-scale data collections is very important. [0004] Because structured data has a certain structure, the retrieval speed can be accelerated by adopting a certain search algorithm; however, unstructured data has no certain structure and the linear scanning rate is slow, so the retrieval speed is slow . [0005] In practic...

AI Technical Summary

Problems solved by technology

[0004] Because structured data has a certain structure, the retrieval speed can be accelerated by adopting a certain search algorithm; however, unstructured data has no certain structure and the linear scanning rate is slow, so the retrieval speed is slow

[0005] In practical applications, whether it is for structured data retrieval or unstructured data retrieval, it is difficult to meet the user's retrieval needs in many cases, for example:

[0006] 1. It is not possible to quickly search for large-scale data; for example, assuming an 80G hard disk, if you want to find a file containing "speech synthesis" on the hard disk, it usually takes several hours

[0007] 2. Flexible retrieval methods cannot be realized; if queries such as "speech" NEAR "synthesis" cannot be performed, the above-mentioned NEAR operator can be defined as "within 10 words", etc.

[0008] 3. The result sorting output cannot be realized; if the user hopes to find the best answer among many query results that meet the conditions, this is impossible

Images