A distributed graph database-oriented data rapid loading method, system, device and storage medium

CN118069365BActive Publication Date: 2026-10-16JIANGSU DAMENG DATABASE CO LTD
1 Cites 0 Cited by

Patent Information

Application Number
CN202410253830.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-06
Publication Date
2026-10-16
Estimated Expiration
2044-03-06

AI Technical Summary

Technical Problem

同一条边在不同存储节点的rowId是不同的，与此同时，他们的起始顶点与终止顶点所对应的rowId应该是相同的，因此选择增加边的关联信息，存在如下几个问题：（1）选择哪些关联信息进行装载时的添加，添加的关联信息既要体现点与边之间、边与异节点边之间的关系，也要避免添加过多的关联信息导致维护成本增加；（2）装载系统如何利用关联信息以提升装载速度；（3）在有限内存的装载系统下如何维护海量数据的关联信息

Benefits of technology

[0015] The beneficial effects of this invention are as follows: By introducing the rowId of the storage system into the parsing system in advance, a relational information processing scheme for edge dual storage in a distributed graph database system is designed, which simplifies the processing logic of cross-node edges in a distributed system and enables the storage system to quickly write data to disk based on the pre-allocated rowId; a hash scheme for maintaining the relationship between key and rowId of a point in a limited memory system is proposed, and in most scenarios, the rowId can be obtained directly without comparing it with disk data, thus achieving the goal of fast loading in a small memory system.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The application discloses a kind of distributed graph database-oriented data fast loading method, system, equipment and storage medium, by introducing the rowId of storage system in advance in parsing system, the association information processing scheme of distributed graph database system edge double storage is designed, the processing logic of the edge cross node under distribution is simplified, so that storage system realizes quick disk according to pre-allocated rowId;A set of hash scheme of the relationship between the key of maintenance point and rowId under limited memory system is proposed, and in most scenarios, rowId can be directly obtained to avoid comparison with disk data, to achieve the purpose of fast loading in small memory system.
Need to check novelty before this filing date? Find Prior Art