Storage management method for implementing space optimization through 16-bit Trie trees

Abstract

The invention provides a dictionary indexing method for implementing space optimization through 16-bit Trie trees. The method comprises the following steps: generating a dictionary index of the 16-bitTrie tree; inputting a to-be-operated keyword key according to a user; and indexing according to the current state of the keyword key. Dictionary data of the 16-bit Trie tree is constructed under a mapping table structure, it can be ensured that the complexity is not changed basically while the space of the Trie tree is optimized, the speed of construction and indexing of a dictionary and the speed of modifying and deleting are increased, the keyword key can be searched quickly, moreover, the dictionary indexing of the 16-bit Trie tree is realized with the aid of the mapping table, and the problems that a common double-array Trie tree dictionary index is constructed complicatedly, and a dictionary cannot be modified at any time and cannot be traversed can be solved. By the dictionary algorithm, the dictionary can be modified and traversed at any time, sequencing can be implemented while construction, and after specific optimization, the dictionary algorithm can be used as an index fora file system or photos.

Description

technical field [0001] The invention belongs to the field of data structure and information management, and in particular relates to a dictionary storage management method realizing space optimization through a 16-bit Trie tree. Background technique [0002] In modern society, with the rapid development of the Internet and the popularization of smart mobile devices, especially the arrival of the era of big data, various cultures and knowledge are constantly filling our brains, and our demand for various information is increasing. But sometimes we feel at a loss when faced with too complex and a large amount of information. How to efficiently store and manage these large-scale data files has become a new challenge. Among them, the Trie tree, as a data structure, is often used in the field of large-scale data file storage management to help us process various data. The traditional Trie tree is an efficient index tree, which can establish an effective data retrieval organizati...

AI Technical Summary

Problems solved by technology

Since the matrix form contains many empty elements, it is a sparse data structure, and the space consumption will be large

Although the Trie tree expressed in list form is more compact in space, its retrieval speed is not so fast

Afterwards, Aoe proposed to implement the Trie tree with double arrays. Although the double array Trie tree algorithm effectively reduces the space waste of the Trie tree structure, there are still some problems. First, compared with the dynamic retrieval method, the insertion time is slow and cannot handle frequent renew

Another problem is that the space efficiency of the double array decreases as the number of deletions increases, because it retains the empty elements produced by the deletion

In addition, there is another problem with the dictionary storage management method based on the Trie tree implemented by the double array structure: each modification, pass, etc. needs to start from the root node and may face the problem of moving a large amount of constructed data

Images