Graph data integrity protection method and device, equipment, medium and program product
By adopting multi-fork-tree structure and hashing operations based on target filters in the graph database, the fine-grained integrity protection of graph data is achieved, the inefficiency problem in the prior art is solved, and the security and reliability of graph data are improved.
Patent Information
- Application Number
- CN202411856648.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-17
- Publication Date
- 2025-03-28
AI Technical Summary
The prior art is difficult to achieve fine-grained graph data integrity protection in graph databases, especially when processing graph data of hundreds of millions of scales, hashing and signature operations are time-consuming and inefficient.
The multi-fork-tree structure based on the target filter is used to record the structural information of the graph data, and fine-grained integrity protection is achieved through hashing operations and private key signatures. The specific steps include building a multi-forktree structure, hashing the child nodes and storing them on the root node, using the multi-forktree structure after hashing to protect the integrity of the graph data change operations, and verifying the integrity of the query operations.
It realizes efficient recording and fine-grained integrity protection of graph data, reduces the time consumption of signature and signature verification, and improves the security and reliability of graph data.