메뉴 건너뛰기




Volumn 7, Issue 5, 2014, Pages 413-424

Write-limited sorts and joins for persistent memory

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING EDUCATION; PROGRAM PROCESSORS;

EID: 84891821940     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732269.2732277     Document Type: Conference Paper
Times cited : (71)

References (24)
  • 1
    • 77958122506 scopus 로고    scopus 로고
    • A design for high-performance flash disks
    • A. Birrell et al. A design for high-performance flash disks. SIGOPS Oper. Syst. Rev., 41(2), 2007.
    • (2007) SIGOPS Oper. Syst. Rev. , vol.41 , Issue.2
    • Birrell, A.1
  • 2
    • 80053533280 scopus 로고    scopus 로고
    • Rethinking database algorithms for phase change memory
    • S. Chen et al. Rethinking database algorithms for phase change memory. In CIDR, 2011.
    • (2011) In CIDR
    • Chen, S.1
  • 3
    • 38749098517 scopus 로고    scopus 로고
    • System software for flash memory: A survey
    • T.-S. Chung et al. System software for flash memory: A survey. In EUC, 2006.
    • (2006) In EUC
    • Chung, T.-S.1
  • 4
    • 79953109976 scopus 로고    scopus 로고
    • NV-heaps: making persistent objects fast and safe with next-generation, non-volatile memories
    • J. Coburn et al. NV-heaps: making persistent objects fast and safe with next-generation, non-volatile memories. In ASPLOS XVI, 2011.
    • (2011) In ASPLOS XVI
    • Coburn, J.1
  • 5
    • 72249087142 scopus 로고    scopus 로고
    • Better I/O through byte-addressable, persistent memory
    • J. Condit et al. Better I/O through byte-addressable, persistent memory. In SOSP, 2009.
    • (2009) In SOSP
    • Condit, J.1
  • 6
    • 3242679256 scopus 로고
    • The Wisconsin Benchmark: Past, Present, and Future
    • D. J. DeWitt. The Wisconsin Benchmark: Past, Present, and Future, 1993.
    • (1993)
    • DeWitt, D.J.1
  • 7
    • 70449672982 scopus 로고    scopus 로고
    • Join processing for flash SSDs: remembering past lessons
    • J. Do and J. M. Patel. Join processing for flash SSDs: remembering past lessons. In DAMON, 2009.
    • (2009) In DAMON
    • Do, J.1    Patel, J.M.2
  • 8
    • 79957844672 scopus 로고    scopus 로고
    • High performance database logging using storage class memory
    • R. Fang et al. High performance database logging using storage class memory. In ICDE, 2011.
    • (2011) In ICDE
    • Fang, R.1
  • 9
    • 84857055947 scopus 로고    scopus 로고
    • New algorithms for join and grouping operations
    • G. Graefe. New algorithms for join and grouping operations. Computer Science - R&D, 27(1):3-27, 2012.
    • (2012) Computer Science-R&D , vol.27 , Issue.1 , pp. 3-27
    • Graefe, G.1
  • 10
    • 0025477963 scopus 로고
    • Cycle-sort: A linear sorting method
    • B. K. Haddon. Cycle-sort: A linear sorting method. The Computer Journal, 33(4):365-367, 1990.
    • (1990) The Computer Journal , vol.33 , Issue.4 , pp. 365-367
    • Haddon, B.K.1
  • 11
    • 77957717506 scopus 로고    scopus 로고
    • Write amplification analysis flash-based solid state drives
    • X.-Y. Hu et al. Write amplification analysis in flash-based solid state drives. In SYSTOR, 2009.
    • (2009) In SYSTOR
    • Hu, X.-Y.1
  • 12
    • 0002282074 scopus 로고
    • A New Measure of Rank Correlation
    • M. Kendall. A New Measure of Rank Correlation. Biometrica, 30:81-89, 1938.
    • (1938) Biometrica , vol.30 , pp. 81-89
    • Kendall, M.1
  • 13
    • 70450227674 scopus 로고    scopus 로고
    • Disaggregated memory for expansion and sharing blade servers
    • L. Kevin et al. Disaggregated memory for expansion and sharing in blade servers. In ISCA, 2009.
    • (2009) In ISCA
    • Kevin, L.1
  • 14
    • 85075012374 scopus 로고    scopus 로고
    • BPLRU: a buffer management scheme for improving random writes flash storage
    • H. Kim and S. Ahn. BPLRU: a buffer management scheme for improving random writes in flash storage. In FAST, 2008.
    • (2008) In FAST
    • Kim, H.1    Ahn, S.2
  • 15
    • 0036564365 scopus 로고    scopus 로고
    • A space-efficient flash translation layer for CompactFlash systems
    • J. Kim et al. A space-efficient flash translation layer for CompactFlash systems. Trans. on Consumer Electronics., 2002.
    • (2002) Trans. on Consumer Electronics.
    • Kim, J.1
  • 16
    • 70449694274 scopus 로고    scopus 로고
    • Flashing up the storage layer
    • I. Koltsidas and S. D. Viglas. Flashing up the storage layer. PVLDB, 1(1), 2008.
    • (2008) PVLDB , vol.1 , Issue.1
    • Koltsidas, I.1    Viglas, S.D.2
  • 17
  • 18
    • 79959929003 scopus 로고    scopus 로고
    • LazyFTL: A page-level flash translation layer optimized for nand flash memory
    • D. Ma et al. LazyFTL: A page-level flash translation layer optimized for nand flash memory. In SIGMOD, 2011.
    • (2011) In SIGMOD
    • Ma, D.1
  • 19
    • 70350144165 scopus 로고    scopus 로고
    • On the use of NAND flash memory high-performance relational databases
    • D. Myers. On the use of NAND flash memory in high-performance relational databases. Master Thesis, MIT, 2007.
    • (2007) Master Thesis, MIT
    • Myers, D.1
  • 20
    • 70449671106 scopus 로고    scopus 로고
    • CFDC: a flash-aware replacement policy for database buffer management
    • Y. Ou et al. CFDC: a flash-aware replacement policy for database buffer management. In DAMON, 2009.
    • (2009) In DAMON
    • Ou, Y.1
  • 21
    • 34547194263 scopus 로고    scopus 로고
    • CFLRU: a replacement algorithm for flash memory
    • S. Park et al. CFLRU: a replacement algorithm for flash memory. In CASES, 2006.
    • (2006) In CASES
    • Park, S.1
  • 23
    • 70849091845 scopus 로고    scopus 로고
    • Query processing techniques for solid state drives
    • D. Tsirogiannis et al. Query processing techniques for solid state drives. In SIGMOD, 2009.
    • (2009) SIGMOD
    • Tsirogiannis, D.1
  • 24
    • 79953069558 scopus 로고    scopus 로고
    • Mnemosyne: lightweight persistent memory
    • H. Volos et al. Mnemosyne: lightweight persistent memory. In ASPLOS, 2011.
    • (2011) ASPLOS
    • Volos, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.