Method and device for designing three-dimensional sketch structure

Abstract

The invention relates to a three-dimensional sketch structure design method and device, computer equipment and a storage medium. The method comprises the steps that a three-dimensional sketch structure used for storing streaming data information is constructed, each sketch in a three-dimensional sketch array is divided into three areas, the streaming data information of a graph structure is obtained, and the streaming data information is updated into the three-dimensional sketch structure according to hash functions corresponding to different depths. According to the method, representative keyreservation and majority voting are combined, a constructed three-dimensional sketch structure maintains structure information and weight information of graph data at the same time, once stream datais updated only once, a constant probability error range is guaranteed, stored keys are selected by using a majority voting algorithm so as to record most representative graph edges, and the most representative graph edges are stored. An error range may be reduced and reversibility may be achieved to improve query efficiency.

Description

technical field [0001] The present application relates to the technical field of computer networks, in particular to a design method, device, computer equipment and storage medium for a three-dimensional sketch structure. Background technique [0002] Over the past decade, graph structures have been heavily used to model complex structured data in interactive applications, such as web traffic and social networks. As a time-varying data sequence, streaming data that retains graph structure can continuously describe entities (such as social media users) and connections between entities (such as interactions between users), and become an important tool for network anonymity detection, community discovery, etc. basis of the service. However, analyzing massive streaming data in real time is quite challenging. For example, each link in a large ISP or data center processes approximately millions of packets per second. Faced with such a situation, traditional data structures such...

AI Technical Summary

Problems solved by technology

gSketch is designed for edge frequency, but it can only answer queries based on edge frequency, not more complex graph structure queries

TCM and GSS are designed to preserve the graph structure and support various types of queries, but they cannot perform reverse hash queries, they are recorded by traversing the entire key space to obtain edges or nodes of interest, or storing other index tables key and its hash

gMatrix recovers keys by pruning the keyspace using modular hashing, but the process of recovering keys using modular hashing requires enumerating the items of the subkeyspace, which is computationally expensive

[0005] Therefore, the existing technology cannot take into account the problems of estimation accuracy and query efficiency

Images