A dictionary storage management method based on one-dimensional linear space to realize trie tree

Abstract

A one-dimensional linear space-based method for implementing trie tree dictionary storage and management. The method comprises the following steps: acquiring complete dictionary data; generating ordered dictionary data and storing in a one-dimensional array; and, establishing a trie tree to implement storage of the dictionary data. The method employs the one-dimensional array instead of a dual array (base [] and check []), thus allowing for serialization and deserialization of the trie tree to be of increased degree of convenience and speed, and allowing for increased efficiency in loading and storage of a dictionary, while at the same time solving the problem of data movement or storage space backtracking found in a trie tree dictionary data storage method implemented with a dual array.

Description

technical field [0001] The invention relates to a dictionary storage management method, in particular to a dictionary storage management method based on a one-dimensional linear space to realize a Trie tree. Background technique [0002] In the field of information retrieval and natural language processing, especially in the technical application based on the dictionary, the scale of the dictionary is generally very large, with tens of thousands or even hundreds of millions of records, especially the scale of the inverted index in the search engine is the largest . The storage of massive data dictionaries is usually realized by index data structure. Commonly used index structures include linear index tables, inverted lists, hash tables, and search trees. The implementation version of the popular Trie tree on the current network is generally based on a double array. The names of the two arrays are base[] and check[] respectively. The subscript i of each element in the array...

AI Technical Summary

Problems solved by technology

[0007] However, there is such a problem in this dictionary data storage method based on the Trie tree implemented by double arrays: the conflict caused by inserting a new state will cause a large number of conflicting dictionary data to be moved, which will not only result in slow dictionary data storage speed, but also Can cause backtracking issues with data movement or storage space

Images