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

Suyu Huang

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

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

Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 75% Distributed systems · 25%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › data reduction
data deduplication
0.612022
Enabling Secure and Space-Efficient Metadata Management in Encrypted Deduplication · IEEE Trans. Computers 2022
Distributed systems › distributed system security
distributed key management
0.612022
Enabling Secure and Space-Efficient Metadata Management in Encrypted Deduplication · IEEE Trans. Computers 2022
Storage systems › data reduction › data deduplication
encrypted deduplication
0.612022
Enabling Secure and Space-Efficient Metadata Management in Encrypted Deduplication · IEEE Trans. Computers 2022
Storage systems
metadata management
0.612022
Enabling Secure and Space-Efficient Metadata Management in Encrypted Deduplication · IEEE Trans. Computers 2022

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

metadata deduplication · 1.1indirection · 1.1
YearPublicationVenuePosition
2022 Enabling Secure and Space-Efficient Metadata Management in Encrypted Deduplication
abstract
Encrypted deduplication combines encryption and deduplication in a seamless way to provide confidentiality guarantees for the physical data in deduplicated storage, yet it incurs substantial metadata storage overhead due to the additional storage of keys. We present a new encrypted deduplication storage system called${\sf Metadedup}$, which suppresses metadata storage by also applying deduplication to metadata. Its idea builds on indirection, which adds another level of metadata chunks that record metadata information. We find that metadata chunks are highly redundant in real-world workloads and hence can be effectively deduplicated. We further extend${\sf Metadedup}$to incorporate multiple servers via a distributed key management approach, so as to provide both fault-tolerant storage and security guarantees. We extensively evaluate${\sf Metadedup}$from performance and storage efficiency perspectives. We show that${\sf Metadedup}$achieves high throughput in writing and restoring files, and saves the metadata storage by up to 93.94 percent for real-world backup workloads.
Jingwei Li 0001, Suyu Huang, Yanjing Ren, Zuoru Yang, Patrick P. C. Lee, Xiaosong Zhang 0001, Yao Hao
IEEE Trans. Computers2