EDBT 2026 Demo / reviewers in the wild / expert
Rengrong Xiong
dblp:388/5118
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0000-8083-7086ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 50% Query processing and optimization · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% | |
| Network and information security
1 paper |
Blockchain and cryptocurrency security · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › secure query processing › query result verification
authenticated data structures |
0.9 | 1 | 2025 | BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain · Proc. ACM Manag. Data 2025 |
Information retrieval › indexing
search structures |
0.9 | 1 | 2025 | BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain · Proc. ACM Manag. Data 2025 |
Storage systems › distributed storage
blockchain storage |
0.9 | 1 | 2025 | BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain · Proc. ACM Manag. Data 2025 |
Storage systems › distributed storage
hybrid-storage blockchain |
0.9 | 1 | 2025 | BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain · Proc. ACM Manag. Data 2025 |
Methods — techniques the papers use, named apart from their topics
articulated search · 2.6authenticated data structure · 1.7authenticated data structures · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage BlockchainabstractHybrid 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 (SP) 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, as the integrity of query results depends on the SPs' trustworthiness. Although ADS can verify the integrity of individual data points, they fall short of preventing SPs from omitting valid results. In this paper, we delineate the fundamental distinctions between data retrieval in blockchains and traditional database systems. Drawing upon these insights, we introduce the BPI framework, which employs a suite of validation models that ascertain the inclusion of all valid content in retrieval outcomes, with low overhead. We further present ''Articulated Search'', a query pattern specifically tailored for blockchain environments, which not only enhances retrieval efficiency but also substantially reduces costs during data user updates. Extensive experimental evaluations demonstrate that the BPI framework achieves outstanding scalability and performance in keyword searches within blockchain environments, surpassing EthMB+ and state-of-the-art search databases commonly used in mainstream hybrid storage blockchains (HSB). Notably, the Articulated Search pattern improves query performance by over three orders of magnitude, highlighting its potential as a transformative approach to blockchain query optimization. Xinkui Zhao, Rengrong Xiong, Guanjie Cheng, Xinhao Jin, Shawn Shi, Xiubo Liang, Gongsheng Yuan, Xiaoye Miao, Jianwei Yin, Shuiguang Deng |
Proc. ACM Manag. Data | 2 |
| 2024 | EE blockchain: End-to-end service regulation and efficient retrieval and categorization on the underlying levelabstractIn large-scale digital service sharing scenarios, given the large number of participating users, frequent cross-domain service interactions, and high-frequency service transactions, to ensure the trustworthiness of digital services, the architecture of the digital service sharing system usually chooses blockchain as its technological foundation. This not only ensures the security and credible deposit of data, but also achieves the credible traceability of data. However, in the current blockchain-based notarization architecture, there may be potential privacy leakage during data transmission, and users are unable to choose the encryption level of their data for blockchain deposition according to their own needs. Moreover, the underlying databases in current applications using blockchain lack convenient retrieval and categorization functionalities. In this work, we propose a trustworthy blockchain solution based on permission management, which implements hierarchical encryption and enables users to flexibly encrypt data according to their needs. Additionally, through the Double Star storage system, while ensuring the reliability of the system, we have also greatly improved the efficiency of data retrieval and classification. Compared to blockchain platforms like XRP and EOS, our solution achieves superior data retrieval and classification efficiency while implementing layered encryption. Rengrong Xiong, Guanjie Cheng, DianKai Hu, Yueshen Xu, Xiubo Liang, Xinkui Zhao |
ICWS | 1 |