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

Kuo-Yi Huang

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

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

Systems, architecture and hardware · 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
Storage systems · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query execution › query operator implementation
sorting in query processing
0.212015
Data Sorting in Flash Memory · ACM Trans. Storage 2015
Storage systems › out-of-core computation
external sorting
0.212015
Data Sorting in Flash Memory · ACM Trans. Storage 2015
Storage systems
flash and SSD
0.212015
Data Sorting in Flash Memory · ACM Trans. Storage 2015

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

unclustered sorting · 0.4clustered sorting · 0.4decision rules · 0.2decision rule · 0.2
YearPublicationVenuePosition
2015 Data Sorting in Flash Memory
abstract
Because flash memory now provides an economical solution for various portable devices and embedded systems, an NAND flash-based storage system has replaced the hard disk drive in many applications. Recently, the implementation of database systems using an NAND flash-based storage system has become an important research topic. In particular, the external sorting is an important operation in database systems. With the very distinctive characteristics of flash memory, the typical external sorting system that adopts a clustered sorting process can result in performance degradation and reduce the reliability of flash memory. In this article, we will propose an unclustered sorting method that considers the unique characteristics of flash memory, and we then propose a decision rule to exploit the advantages of both clustered and unclustered sorting. The decision rule can separate records according to their record length, sort them appropriately by the clustered and unclustered sorting, and merge the sorted results. The experimental results show that the proposed method can improve performance in an NAND flash-based storage system (i.e., solid-state drive).
Chin-Hsien Wu, Kuo-Yi Huang
ACM Trans. Storage2