Data Management System

The system addresses the growth of ledgers in distributed systems by enabling nodes to manage and separate ledgers based on resource availability, ensuring efficient data processing and reduced storage and communication loads.

JP7884707B2Active Publication Date: 2026-07-06SCSK CORP
View PDF 5 Cites 0 Cited by

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
SCSK CORP
Filing Date
2022-02-06
Publication Date
2026-07-06

AI Technical Summary

Technical Problem

In distributed ledger-based data management systems, the growing size of the ledger leads to increased data processing load, decreased communication speed, and higher communication costs due to increased traffic, and insufficient storage capacity.

Method used

A data management system where nodes can separate and manage ledgers based on resource availability, sending candidate update information or failure notifications to determine ledger updates autonomously, allowing for partial storage of ledgers and reducing the need for all nodes to store the same data.

Benefits of technology

Prevents the ledger from growing excessively, reduces storage and communication load, and maintains system efficiency by allowing nodes to manage resources effectively.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007884707000001
    Figure 0007884707000001
  • Figure 0007884707000002
    Figure 0007884707000002
  • Figure 0007884707000003
    Figure 0007884707000003
Patent Text Reader

Abstract

To provide a data management system of a distributed ledger method that does not bloat a ledger.SOLUTION: A data management system 1 includes a plurality of nodes N. When any of the node N acquires an update request R that instructs updating of a ledger L from an external of the data management system 1, the node N transmits the update request R to another node N. Each of the nodes N transmits, if the updating of the ledger L according to the update request R is impossible, to the other node an update impossible notification X that notifies that, and transmits, if the updating is possible, to the other node N candidate update information V which is a candidate of information for updating the ledger L according to the update request R. Each of the nodes N does not update the ledger L if the number of the update impossible notifications X received from the other node N satisfies a predetermined condition. When updating the ledger L, each of the nodes N updates the ledger L using the candidate update information V which has the maximum pieces of the candidate update information V having the same content among the candidate update information V received from the other nodes N.SELECTED DRAWING: Figure 3
Need to check novelty before this filing date? Find Prior Art