Distributed Database Storage Reduction via Data Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In blockchain implementations, each node requires an identical copy of common data, leading to excessive storage usage as each of the N nodes stores N copies of the data, resulting in significant storage requirements.

Innovation Solution

A system where multiple node devices store portions of common data, with at least one node configured to store a first portion and receive a hash value of a second portion, reducing storage needs by distributing the data across nodes and minimizing the need for each node to store the entire dataset.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If each node stores an identical copy of common data, then data consistency and reliability are improved, but storage usage increases significantly

Engineering Contradiction:
Improvedata consistencyVSAvoidstorage usage
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The common data is divided into multiple portions (first portion, second portion, etc.), and each node device stores only a specific portion rather than the entire dataset. This segmentation allows the system to maintain data consistency across nodes while significantly reducing the storage burden on each individual node.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Instead of storing complete copies of common data at each node, the system stores hash values (compact representations) of data portions at nodes that don't store the actual data. This copying mechanism enables verification of data integrity without requiring full data duplication at every node.

Inventive Principle:
Principle #26Copying

2Quantity of substance

If nodes store only portions of common data, then storage usage is reduced, but processing time and computation resources decrease

Engineering Contradiction:
Improvestorage usageVSAvoidprocessing time
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The system pre-calculates and stores hash values of data portions alongside the actual data. When a node needs to verify or process data, the hash values are already available, enabling quick verification without requiring full data reconstruction or extensive computation, thus maintaining productivity despite reduced storage.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10764030B2Reduction in storage usage in distributed databases
Publication Date: 2020.09.01 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US10764030B2 patent drawing
  • US10764030B2 patent drawing
  • US10764030B2 patent drawing

AI summary

Common data are maintained by a system including a plurality of node devices that each store a respective portion of a common data in a respective database, wherein a node device of the plurality of node devices stores a first portion of the common data, and receives a hash value of a second portion of the common data that is different from the first portion, in response to an update of the second portion of the common data.