Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yifei Zhen

dblp:414/5434 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, 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.

Network and information security
1 paper
Blockchain and cryptocurrency security · 100%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 50% Information retrieval · 50%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
verifiable query processing
0.912025
MEST: An Efficient Authenticated Secondary Index in Blockchain Systems · ICDE 2025
Information retrieval › hashing › hash table design
extendible hashing
0.312025
MEST: An Efficient Authenticated Secondary Index in Blockchain Systems · ICDE 2025
Indexing and storage engines
hash index
0.312025
MEST: An Efficient Authenticated Secondary Index in Blockchain Systems · ICDE 2025

Methods — techniques the papers use, named apart from their topics

merkle tree · 1.7commitment generation · 1.7
YearPublicationVenuePosition
2025 MEST: An Efficient Authenticated Secondary Index in Blockchain Systems
abstract
Existing blockchain systems can quickly respond to verifiable primary key queries based on authenticated indexes. However, many blockchain applications also require high-performance queries on non-primary keys. For example, traders query NFT or tokenized RWA with certain features, e.g., type and return. Therefore, it necessitates authenticated secondary indexes to support efficient verifiable queries on non-primary keys. However, the existing approach to authenticated index design that couples index and authenticated digest together does not adapt well to the phased nature of non-primary key queries, making the most time-consuming process of commitment generation severely block the query process. In this study, we propose the first authenticated secondary index MEST for verifiable non-primary key queries. MEST decouples the data index and authenticated digest, which can parallelize commitment generation on the secondary index and the query processing on the primary index, thus greatly reducing the latency of the non-primary key query. Furthermore, we adopt an Extendible Hash Table to index data and propose a Merkle Growth Tree to generate commitment, which can dynamically adapt to the rapid growth of data and the skew in data access pattern. Extensive experiments on both synthetic and real datasets demonstrate that MEST improves throughput by 3.17×, reduces latency by 59%, and exhibits better scalability than baselines.
Jinping Jia, Yichen Gao, Yifei Zhen, Zhao Zhang 0009, Qian Kun, Cheqing Jin
ICDE3