A space-optimized dictionary indexing method through a 16-bit trie tree

Abstract

The present invention provides a dictionary index method for realizing space optimization through a 16-bit Trie tree. The method includes the following steps: generating a dictionary index of a 16-bit Trie tree; inputting a keyword key to be operated by a user; realizing indexing according to the current state of the keyword key . Using the mapping table structure to construct 16-bit Trie tree dictionary data, the Trie tree can be optimized in space while keeping the complexity basically unchanged, improving the speed of dictionary construction, indexing, modification and deletion, and enabling fast retrieval To the keyword key, in addition, combining the mapping table to realize the dictionary index of the 16-bit Trie tree can solve the problem that the construction of the general double-array Trie tree dictionary index is relatively complicated, and the dictionary cannot be modified at any time, and the dictionary cannot be traversed. This dictionary algorithm can modify and traverse the dictionary at any time, and at the same time, it can be sorted when it is built. After specific optimization, it can be used as an index of the file system or image, audio and video.

Description

technical field [0001] The invention belongs to the field of data structure and information retrieval, and in particular relates to a dictionary indexing method realizing space optimization through a 16-bit Trie tree. Background technique [0002] In recent years, with the rapid development of the Internet and the popularization of smart mobile devices, especially the arrival of the era of big data, more and more text, photos, audio and video data need to be processed, especially in our daily life. The more cumbersome and complex text data, how to efficiently store and index large-scale text data has become a new challenge. The simpler text index is the string dictionary index, and its application is ubiquitous, such as geographic information systems, web search engines, and information retrieval systems. Large-scale text data in the era of big data also poses new challenges to string dictionary indexes. Among them, the Trie tree, as a data structure, is often used in the ...

AI Technical Summary

Problems solved by technology

[0004] In order to solve the above-mentioned technical problem, the present invention provides a kind of dictionary indexing method that realizes space optimization by 16 Trie trees, the present invention builds the dictionary data of 16 Trie trees under the combination mapping table structure, can be trie tree on space It has been optimized while keeping the complexity unchanged, improving the speed of dictionary construction, indexing, modification and deletion, and can quickly retrieve keyword keys. In addition, the dictionary index of the 16-bit Trie tree combined with the mapping table can solve the general double array Trie The tree dictionary data index is more complicated to build, and the dictionary cannot be modified at any time, nor can it traverse the dictionary

Images