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

Daeyoung Yoon

dblp:32/9655 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › storage management
backup systems
0.112011
Efficient Deduplication Techniques for Modern Backup Operation · IEEE Trans. Computers 2011
Storage systems › data reduction
data deduplication
0.112011
Efficient Deduplication Techniques for Modern Backup Operation · IEEE Trans. Computers 2011
Storage systems › data reduction
deduplication-based backup
0.112011
Efficient Deduplication Techniques for Modern Backup Operation · IEEE Trans. Computers 2011

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

incremental modulo-k chunking · 0.1context-aware chunking · 0.1LRU-based index partitioning · 0.1
YearPublicationVenuePosition
2020 Who is Delivering My Food?: Detecting Food Delivery Abusers using Variational Reward Inference Networks
abstract
The recent paramount success of the gig economy has introduced new business opportunities in different areas such as food delivery service. However, there are food delivery ride abusers who break the company rule by driving unauthorized vehicles that are not stated in the contract. These abusers are particularly problematic because they break the transportation regulations and unfairly take more orders. However, detecting these abusers are challenging because of lack of labeled datasets and these anomalous abusers do not frequently occur compared to normal riders. Furthermore, sequential patterns of abusing behaviors are not easy to model.
Daeyoung Yoon, Simon S. Woo
CIKM1
2011 Efficient Deduplication Techniques for Modern Backup Operation
abstract
In this work, we focus on optimizing the deduplication system by adjusting the pertinent factors in fingerprint lookup and chunking, the factors which we identify as the key ingredients of efficient deduplication. For efficient fingerprint lookup, we propose fingerprint management scheme called LRU-based Index Partitioning. For efficient chunking, we propose Incremental Modulo-K(INC-K) algorithm which is optimized Rabin's algorithm where we significantly reduce the number of arithmetic operations exploiting the algebraic nature of modulo arithmetic. LRU-based Index Partitioning uses the notion of tablet and enforces access locality of the fingerprint lookup in storing fingerprints. We maintain tablets with LRU manner to exploit temporal locality of the fingerprint lookup. To preserve access correlation across the tablets, we apply prefetching in maintaining tablet list. We propose Context-aware chunking to maximize chunking speed and deduplication ratio. We develop prototype backup system and performed comprehensive analysis on various factors and their relationship: average chunk size, chunking speed, deduplication ratio, tablet management algorithms, and overall backup speed. By increasing the average chunk size from 4 KB to 10 KB, chunking time increases by 34.3 percent, deduplication ratio decreases by 0.66 percent and the overall backup speed increases by 50 percent (from 51.4 MB/sec to 77.8 MB/sec).
Jaehong Min, Daeyoung Yoon, Youjip Won
IEEE Trans. Computers2