Researchers have developed a novel framework, known as EVQ, to improve the efficiency and verifiability of retrieving the k most influential transactions within blockchain systems. Blockchain technology allows for secure, decentralized transaction management, yet the increasing volume of data recorded on these distributed ledgers presents significant challenges for efficient query processing. Current approaches, while capable of verifying query results, often fail to support complex queries that involve counting set-valued attributes, or they prioritize result verification over overall query performance.
The EVQ framework addresses these limitations by focusing on both query efficiency and verification. A primary technical challenge in this domain is the computational cost associated with set-valued attributes, which can drastically increase query time and the size of the verification object (VO) needed to prove the integrity of the results. To mitigate these issues, the study introduces a new authenticated data structure called the MB(fm)-tree, which effectively integrates FM sketches into a traditional Merkle B-tree architecture.
The integration of FM sketches allows the system to approximate the count of elements efficiently. Furthermore, the research team extended this structure into the MR(fm)-tree by transforming set-valued attributes into numeric attributes. This transformation enables batch pruning on both numerical and set-valued data, which significantly reduces the search space during the query retrieval process. By optimizing how data is pruned, the system can identify the most influential transactions more rapidly than previous methods.
Extensive experimental testing demonstrates the performance gains provided by the new approach. According to the research findings, the MR(fm)-tree architecture achieves query speeds that are one to three orders of magnitude faster than standard Merkle tree-based approaches. When compared to the current state-of-the-art methodology, the MR(fm)-tree also exceeds existing performance benchmarks by over an order of magnitude, suggesting a substantial improvement in the practical implementation of complex blockchain queries.
This framework is designed for real-world data exploration and decision-making applications where users need to retrieve a representative selection of transactions based on specific influence metrics. By supporting complex set-valued attribute queries without compromising system verifiability, the framework provides a scalable solution for managing large-scale blockchain data.
The implementation focuses on ensuring that the retrieval process remains verifiable in a distrust environment, ensuring that users can trust the results even without a centralized authority.
Subject of Research: Blockchain data query optimization
Article Title: Evq: efficient and verifiable k most influential transaction retrieval in blockchain systems
Article References: Yin, B., & Ji, Y. (2026). Evq: efficient and verifiable k most influential transaction retrieval in blockchain systems. Knowledge and Information Systems, 68(1), Article 310. https://doi.org/10.1007/s10115-026-02938-4
Image Credits: AI Generated
DOI: 10.1007/s10115-026-02938-4
Keywords: Blockchain, Data Retrieval, Distributed Ledger Technology, Query Optimization, Information Systems, Authenticated Data Structures, Merkle Trees, FM Sketches, Computational Efficiency, Transaction Processing, Algorithm Design, Database Management, Set-valued Attributes, Verifiable Computing, System Performance, Data Exploration, Decision Support Systems
News Source: Denise Maddox. (November 16, 2026). New Framework Enhances Efficiency of Influential Transaction Retrieval in Blockchains. Scienmag.



