TOWARDS SCALABLE AND TRUSTWORTHY INDEXING IN BLOCKCHAIN: THE FLEXIM APPROACH
DOI:
https://doi.org/10.5281/zenodo.21100234Abstract
Blockchain-based query systems with traceability and data provenance are increasingly vital across various applications. However, existing index-based query approaches perform efficiently only under static workloads, where query attributes or types are fixed, and struggle with dynamic workloads due to long construction times and high storage requirements. To address these limitations, this paper proposes FlexIM, an efficient and verifiable index management system for dynamic blockchain queries. FlexIM leverages the inherent characteristics of blockchain, such as data distribution and block access frequency, and uses reinforcement learning to optimally select indexes under varying workloads. Additionally, verifiability is enhanced with minimal storage overhead through the integration of Root Merkle Tree (RMT) and Bloom Filter Merkle Tree (BMT). Experimental evaluations demonstrate that FlexIM significantly outperforms existing mechanisms like vChain+, achieving a 26.5% speedup while reducing storage consumption by 94.2% on average across real-world Bitcoin datasets.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.













