BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain

2025-08-30

AI Summary

Existing authenticated data structures (ADS) for hybrid-storage blockchains rely on centralized storage providers (SPs), failing to guarantee keyword query completeness—i.e., they only verify existence and cannot detect omitted results. To address this, we propose BPI, a lightweight searchable framework. Methodologically, BPI introduces: (i) a segmented search paradigm optimized for blockchain’s low-bandwidth, high-latency constraints to enhance query efficiency; (ii) a multi-layered verification model integrating ADS with decentralized storage coordination to ensure both result completeness and correctness; and (iii) a novel compact index structure coupled with a low-overhead verification protocol to minimize maintenance cost. Experimental evaluation demonstrates that BPI significantly outperforms EthMB+ and state-of-the-art hybrid-storage blockchain (HSB) systems in query throughput, scalability, and verification overhead.

Technology Category

• Search and Optimization: Distributed Search
• Data Mining & Knowledge Management: Intelligent Query Processing
• Constraint Satisfaction and Optimization: Search

Application Category

• Security and Privacy: Blockchains and distributed ledgers
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics
• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs

Abstract

Hybrid storage solutions have emerged as potent strategies to alleviate the data storage bottlenecks prevalent in blockchain systems. These solutions harness off-chain Storage Services Providers (SPs) in conjunction with Authenticated Data Structures (ADS) to ensure data integrity and accuracy. Despite these advancements, the reliance on centralized SPs raises concerns about query correctness. Although ADS can verify the existence of individual query results, they fall short of preventing SPs from omitting valid results. In this paper, we delineate the fundamental distinctions between data search in blockchains and traditional database systems. Drawing upon these insights, we introduce BPI, a lightweight framework that enables efficient keyword queries and maintenance with low overhead. We propose "Articulated Search", a query pattern specifically designed for blockchain environments that enhances search efficiency while significantly reducing costs during data user updates. Furthermore, BPI employs a suite of validation models to ensure the inclusion of all valid content in search results while maintaining low overhead. Extensive experimental evaluations demonstrate that the BPI framework achieves outstanding scalability and performance in keyword searches within blockchain, surpassing EthMB+ and state of the art search databases commonly used in mainstream hybrid storage blockchains (HSB).

Problem

• Ensures query correctness in hybrid storage blockchains
• Prevents omission of valid results by storage providers
• Enables efficient keyword searches with low overhead

Innovation

• BPI lightweight framework for efficient keyword queries
• Articulated Search pattern enhances blockchain search efficiency
• Validation models ensure complete valid content inclusion