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

Kazuhiko Mogi

dblp:30/5972 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 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
2 papers
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
storage reliability
0.021996
Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 · SIGMOD Conference 1996
Hot Block Clustering for Disk Arrays with Dynamic Striping · VLDB 1995
Storage systems
data placement
0.011996
Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 · SIGMOD Conference 1996
Storage systems › storage reliability
RAID
0.011996
Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 · SIGMOD Conference 1996
Storage systems › storage reliability › RAID
RAID5
0.011996
Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 · SIGMOD Conference 1996
Storage systems
disk array
0.011995
Hot Block Clustering for Disk Arrays with Dynamic Striping · VLDB 1995

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

simulation · 0.0hot block clustering · 0.0
YearPublicationVenuePosition
1996 Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5
abstract
This paper proposes a storage management scheme for disk arrays, named hot mirroring. In this scheme, storage space is partitioned into two regions. One is the mirrored region, which is characterized by high performance and low storage efficiency. The other is the RAID5 region, which is characterized by low performance and high storage efficiency. Hot data blocks are stored in the former area, while cold blocks are stored in the latter. In addition, mirrored pairs and RAID5 stripes are orthogonally laid out, through which the performance degradation during rebuilding is minimized. Hot block clustering in hot mirroring achieves higher performance than conventional RAID5 arrays. The potential of hot mirroring is examined through extensive simulation.
Kazuhiko Mogi, Masaru Kitsuregawa
SIGMOD Conference1
1995 Hot Block Clustering for Disk Arrays with Dynamic Striping
Kazuhiko Mogi, Masaru Kitsuregawa
VLDB1