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

Voon-Fee Yong

dblp:68/6611 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—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 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 · 81% Distributed systems · 19%

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

TopicWeightPapersLastEvidence papers
Storage systems › storage management
storage reclamation
0.011994
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores · ICDE 1994
Storage systems › networked storage
client-server storage
0.011994
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores · ICDE 1994
Distributed systems › transaction processing
transaction semantics
0.011994
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores · ICDE 1994

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

simulation · 0.0prototype implementation · 0.0
YearPublicationVenuePosition
1994 Storage Reclamation and Reorganization in Client-Server Persistent Object Stores
abstract
The authors develop and evaluate a number of storage reclamation algorithms for client-server persistent object stores. Experience with a detailed simulation and a prototype implementation in the Exodus storage manager shows that one of the proposed algorithms, the Incremental Partitioned Collector, is complete, maintains transaction semantics, and can be run incrementally and concurrently with client applications. Furthermore, it can significantly improve subsequent system performance by reclustering data, rendering it attractive even for systems that choose not to support automatic storage reclamation.>
Voon-Fee Yong, Jeffrey F. Naughton, Jie-Bing Yu
ICDE1