Construction method and disstructuring method for multi-dimensional topological structure of distributed data

Abstract

The invention discloses a multi-dimensional topological structure construction method and a multi-dimensional topological structure disstructuring method for distributed data. Different data sequences of the data structure are arranged in parallel, and each data sequence forms a fixed length or an increased length; each secondary-level sub-data system generates a respective data sequence along with service development; the time sequence data of each data sequence is anchored by using the data structure I of the digital characteristic value of the data to generate a data block, the data structure II is used for giving more information of preorder data of the data, and different data sequences respectively form a data structure III given by the invention; the data structure III transmits characteristic values among different data sequences for overall anchoring, when a trigger condition is generated, the data sequences mutually acquire a data structure IV, and the data sequences process the received data IV into a data structure V and store the data structure V. Under the condition that part of data is obtained, various characteristic values and data bodies of the data are utilized to carry out process iteration of verification and collection, and disstructuring is completed.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a method for constructing and deconstructing logical topological relationships of distributed data under the Internet environment. Background technique [0002] Distributed applications in the computer Internet environment are both data producers and data users, and the logical topology of data is directly related to the efficiency of data transmission and storage. Traditionally, predefined data structures are used to plan the logical topology of the entire data, and specific management units are used to ensure the consistency of data construction and distribution. Before rebuilding the data, the data user needs to obtain the key characteristic parameters of the data from the above-mentioned management unit to rebuild the data structure. In order to balance efficiency and versatility, the predefined data structure is usually designed as a fixed one-dimensional mapp...

AI Technical Summary

Problems solved by technology

[0004] In distributed applications, the evolution frequency of data users is different. Strictly predefined data topology mapping limits the scalability of distributed systems. Strictly predefined data has strong global dependencies, and data locality is strong. In the case, the storage efficiency is not high

[0005] In order to solve the above contradictions, the industry adopts relatively loose logical topology and verification methods to construct data, such as hash linked list, Merkle tree structure and other techniques, but these one-dimensional processing methods have the problem of insufficient dimensions

Different methods lead to different costs or efficiencies. In many cases, recursive data requests on the network will be triggered. The cost of data reconstruction is too high or the time is too long, which makes it unfeasible in large-scale distributed applications.

Images