Sort data storage and split catalog inquiry method based on catalog tree

Abstract

A method for storing classified data based on catalogue tree includes setting up root node of catalogue tree, making brother node pointer of root node be idle and making data pointer be idle then setting up a new node to let sun node pointer of root node point to set up new node being used to correspond to one grade classification catalogue of classified data, utilizing recursive algorithm to separately set up mapping node to correspond to each grade classification catalogue of classified data. The catalogue querying method based on said catalogue tree is also disclosed.

Description

technical field [0001] The invention relates to the management technology of classified data, in particular to a classification data storage and classification catalog query method based on a directory tree. Background technique [0002] With the explosive growth of current data information and the continuous expansion of computer applications, computers have become an indispensable data management tool in people's lives. No matter data collection, processing, storage, retrieval, etc., operations are inseparable from computers. Therefore, How to store data effectively and quickly and how to quickly retrieve the required data has become the main problem to be solved in current data management. [0003] At present, classification data can usually be stored in a tree structure, and the tree structure storing these classification directories is also called a directory tree. The method for storing classified data using a directory tree includes: first establishing a root node, w...

AI Technical Summary

Problems solved by technology

However, since the above-mentioned directory tree actually adopts the data structure of a multi-fork tree, the number of sub-nodes contained in each node in the multi-fork tree will correspond to the number of sub-directories divided by the directory corresponding to the node. Therefore, each The number of sub-nodes contained in a node is uncertain, or unpredictable, which will cause the size of the storage space required by each node on the directory tree to be uncertain, resulting in the allocation of storage space during the data storage process too complicated

Especially when the above storage method is applied to the management of massive data, such as catalog management in e-commerce, and library information management, etc., due to the huge amount of information contained in massive data, each node The number of sub-nodes contained is too large, which will cause the information stored in each node to be too large, which will not only further increase the complexity of the storage space allocation operation, but also cause a waste of storage space resources

[0006] In addition, when the classification relationship of the classification data stored by the multi-fork tree structure directory tree changes, for example, when adding, moving or deleting a certain classification directory, it is also necessary to consider the allocation and recovery of the storage space of the parent node of the classification directory, etc. Problems, making the addition, deletion and movement of categories very complicated

Images