An Efficient Blockchain-Based Data Storage and Query System for Large-Scale Data Sharing

In blockchain–IPFS-based systems, full nodes maintain complete ledger replicas, whereas light nodes retain only essential information such as block headers to reduce storage and computation overhead. Due to the absence of full data replicas, light nodes are unable to support full-data queries, which limits their applicability in practical financial data sharing scenarios. Moreover, conventional blockchain storage mechanisms rely on synchronous confirmation across multiple nodes, resulting in limited throughput and poor responsiveness under high-concurrency and burst-traffic conditions. To address these issues, this paper proposes a blockchain–IPFS-based storage and query scheme for banking credit data that integrates multi-level caching, non-blocking asynchronous processing, and a Cuckoo filter–based lightweight query mechanism. The proposed scheme enables light nodes to efficiently verify the existence of credit files and retrieve associated metadata without maintaining complete ledger replicas, while a coordinated caching–asynchronous architecture decouples user requests from on-chain and off-chain persistence operations to improve system throughput and robustness. A prototype system is implemented and evaluated under varying file sizes and concurrency levels. Experimental results show that, for files smaller than 100 MB, the proposed scheme reduces storage latency by approximately 35–99% and improves query response time by more than 95%, compared with conventional blockchain–IPFS-based solutions. In addition, download latency is reduced by 20–31% for small and medium-sized files. The results further confirm that the proposed approach effectively supports full-data queries for light nodes and demonstrates strong resilience under burst traffic conditions, indicating its practical feasibility for secure financial credit data sharing.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-03-12
DOI
https://doi.org/10.3390/app16062709
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Blockchain-Based Data Storage and Query System for Large-Scale Data Sharing

Jiangbing Yang, Hui Li, M. Zhang
Applied Sciences
Caching and Content Delivery
article

An Efficient Blockchain-Based Data Storage and Query System for Large-Scale Data Sharing

Jiangbing Yang, Hui Li, M. Zhang
article en

Abstract

In blockchain–IPFS-based systems, full nodes maintain complete ledger replicas, whereas light nodes retain only essential information such as block headers to reduce storage and computation overhead. Due to the absence of full data replicas, light nodes are unable to support full-data queries, which limits their applicability in practical financial data sharing scenarios. Moreover, conventional blockchain storage mechanisms rely on synchronous confirmation across multiple nodes, resulting in limited throughput and poor responsiveness under high-concurrency and burst-traffic conditions. To address these issues, this paper proposes a blockchain–IPFS-based storage and query scheme for banking credit data that integrates multi-level caching, non-blocking asynchronous processing, and a Cuckoo filter–based lightweight query mechanism. The proposed scheme enables light nodes to efficiently verify the existence of credit files and retrieve associated metadata without maintaining complete ledger replicas, while a coordinated caching–asynchronous architecture decouples user requests from on-chain and off-chain persistence operations to improve system throughput and robustness. A prototype system is implemented and evaluated under varying file sizes and concurrency levels. Experimental results show that, for files smaller than 100 MB, the proposed scheme reduces storage latency by approximately 35–99% and improves query response time by more than 95%, compared with conventional blockchain–IPFS-based solutions. In addition, download latency is reduced by 20–31% for small and medium-sized files. The results further confirm that the proposed approach effectively supports full-data queries for light nodes and demonstrates strong resilience under burst traffic conditions, indicating its practical feasibility for secure financial credit data sharing.

Applied SciencesVol. 16(6)
Xidian University (CN)
Openalex Percentile: Top 31%
Caching and Content Delivery
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.