Method, device and system for storing data

Abstract

The embodiment of the invention discloses a data storing method, comprising the following steps of: judging whether a node in a tree structure is a skip node or not, if so, reading a sub-node at a lower level; judging whether the sub-node at the lower level is a node capable of being merged or not, if so, merging the sub-node at the lower level with the skip node; and storing the data according to the tree structure after node mergence. By adopting the invention, the skip node generated when data is stored in the tree structure, and the sub-node of at the lower level are merged, the node layer and the total number of nodes are reduced, the space for storing data is saved, and the data transmit performance is improved.

Description

technical field [0001] The invention relates to the field of data storage, in particular to a method, device and system for storing data. Background technique [0002] As an important non-linear structure, tree is more and more applied to the field of data storage. [0003] For example, with the rapid development of the Internet, the number of routing prefixes on the network increases exponentially, and the routing prefixes are stored in the Internet Protocol Forwarding Information Base (ie, IP FIB) of the router. [0004] Any FIB table can be represented by constructing a binary tree, such as figure 1 Shown in the middle left figure. For a given FIB table, the number of bits to be detected for each lookup is called a step size, and table entries are divided and stored according to a given lookup step size. Such as figure 1 In the given step search length is 3, then every 3-bit route prefix (prefix) is stored in the first level, generating figure 1 The schematic diagram...

AI Technical Summary

Problems solved by technology

[0005] In practical applications, when the routing table entries with relatively long length and many node series need to be stored are stored in the form of binary tree, the existing compression technology will still generate more level series and occupy a large storage space. Space, especially in the case of fixed node memory space, greatly reduces the forwarding performance of the routing and forwarding table and the capacity performance of the maximum number of entries that can be added

Images