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

Patrick H. Ngai

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

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

Databases, data management, data science and information retrieval · 1

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

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

TopicWeightPapersLastEvidence papers
Distributed systems › replication
data replication
0.011992
Object Allocation in Distributed Systems with Virtual Replication · ICDE 1992
Distributed systems › distributed resource management
object placement
0.011992
Object Allocation in Distributed Systems with Virtual Replication · ICDE 1992
Distributed systems
replication
0.011992
Object Allocation in Distributed Systems with Virtual Replication · ICDE 1992

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

heuristic algorithm · 0.0
YearPublicationVenuePosition
1992 Object Allocation in Distributed Systems with Virtual Replication
abstract
The authors investigate the problem of object allocation in a distributed environment with virtually replicated data. The traditional approach to improving data availability in a distributed system is to replicate data. A high degree of replication, however, imposes a serious burden to the system when updates are performed. Data inference can be used to reduce the degree of replication in the system while still providing high data availability. A model to allocate objects under such an environment is proposed. Rules based on application semantics are developed to reduce the search space for optimal allocation. Heuristic algorithms are proposed for allocation when the reduced search space is still prohibitively large. Examples are given to illustrate the effectiveness of the proposed algorithms.>
Wesley W. Chu, Berthier A. Ribeiro-Neto, Patrick H. Ngai
ICDE3