Sorting in a Memory Hierarchy with Flash Memory

被引：0
作者：
Goetz Graefe
机构：
[1] Hewlett-Packard Laboratories,
来源：
Datenbank-Spektrum | 2011年 / 11卷 / 2期
关键词：
Flash Memory; Access Latency; Memory Hierarchy; Page Size; Sort Operation;
D O I：
10.1007/s13222-011-0062-6
中图分类号：
学科分类号：
摘要：
Flash memory continues to improve in price, capacity, reliability, durability, and performance. In addition to consumer and client devices, flash memory is also employed in many servers. Its optimal usage in various classes of server software, including web servers, file-and-print servers, and database servers, requires evaluation and analysis. The present paper analyzes the use of flash memory for database query processing including algorithms that combine flash memory and traditional disk drives.
引用
收藏
页码：83 / 90
页数：7
相关论文
共 23 条
  • [1] Bitton D(1983)Duplicate record elimination in large data files ACM TODS 8 255-265
  • [2] DeWitt DJ(1972)Organization and maintenance of large ordered indices Acta Inform 1 173-189
  • [3] Bayer R(1997)The five-minute rule ten years later, and other computer storage rules of thumb SIGMOD Rec 26 63-68
  • [4] McCreight EM(2010)Database operators for flash-enabled memory hierarchies IEEE Data Eng Bull 33 21-27
  • [5] Gray J(1994)Sort versus hash revisited IEEE Trans Knowl Data Eng 6 934-944
  • [6] Graefe G(2001)The evolution of effective B-tree page organization and techniques: a personal account SIGMOD Rec 30 64-69
  • [7] Graefe G(1995)AlphaSort: a cache-sensitive parallel external sort VLDB J 4 603-627
  • [8] Harizopoulos S(1989)Beating the I/O bottleneck: a case for log-structured file systems Oper Syst Rev 23 11-28
  • [9] Kuno HA(undefined)undefined undefined undefined undefined-undefined
  • [10] Shah MA(undefined)undefined undefined undefined undefined-undefined
123