Graph Database Block Storage for Large Data Integrity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current graph databases struggle with storing larger data sizes, limiting their efficiency and capacity.
Innovation Solution
A data storage method that splits data exceeding a predetermined threshold into blocks, assigns block identifiers based on sequence, and stores data identifiers and block identifiers in a graph database.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If data is stored in a graph database, then data query efficiency is improved, but the database cannot support storage of larger data
Solution Approach 1:
The patent divides large data into multiple data blocks with sequential identifiers, allowing the graph database to store and manage large volumes of data by splitting it into manageable segments while maintaining efficient query capabilities through the identifier-based access mechanism
2Quantity of substance
If data is split into blocks to increase storage capacity, then data storage capacity is improved, but data integrity may be compromised in unstable network environments
Solution Approach 1:
The patent assigns sequential identifiers to data blocks before storage, establishing a predetermined ordering structure that enables reliable reconstruction of complete data from distributed blocks even in unstable network environments, thereby maintaining data integrity while enabling large-scale storage
Data Source
AI summary
This specification discloses data storage methods, apparatuses, devices, and storage media. One method includes receiving data to be stored; determining whether a size of the data exceeds a predetermined threshold; and in response to determining that the size of the data exceeds the predetermined threshold: splitting a portion of the data to obtain data blocks; determining block identifiers of the data blocks based on a sequence of the data blocks; storing a data identifier of the data and the block identifiers of the data blocks that correspond to each other; storing a first key-value pair; storing second key-value pairs; and storing a first portion of the data blocks and corresponding block identifiers in a graph database.