메뉴 건너뛰기




Volumn 6, Issue 12, 2013, Pages 1374-1377

OmniDB: Towards portable and efficient query processing on parallel CPU/GPU architectures

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE; QUERY PROCESSING;

EID: 84891093342     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536274.2536319     Document Type: Article
Times cited : (56)

References (17)
  • 2
    • 79959978882 scopus 로고    scopus 로고
    • Design and evaluation of main memory hash join algorithms for multi-core cpus
    • S. Blanas, Y. Li, and J. M. Patel. Design and evaluation of main memory hash join algorithms for multi-core cpus. In SIGMOD, pages 37-48, 2011.
    • (2011) In SIGMOD, pages , pp. 37-48
    • Blanas, S.1    Li, Y.2    Patel, J.M.3
  • 3
    • 0003075199 scopus 로고    scopus 로고
    • Database architecture optimized for the new bottleneck: Memory access
    • P. A. Boncz, S. Manegold, and M. L. Kersten. Database architecture optimized for the new bottleneck: Memory access. In VLDB, pages 54-65, 1999.
    • (1999) VLDB, pages , pp. 54-65
    • Boncz, P.A.1    Manegold, S.2    Kersten, M.L.3
  • 5
    • 80054998134 scopus 로고    scopus 로고
    • On the efficacy of a fused cpu+gpu processor (or apu) for parallel computing
    • M. Daga, A. M. Aji, and W.-c. Feng. On the efficacy of a fused cpu+gpu processor (or apu) for parallel computing. In SAAHPC, pages 141-149, 2011.
    • (2011) In SAAHPC, pages , pp. 141-149
    • Daga, M.1    Aji, A.M.2    Feng, W.-C.3
  • 10
    • 84891121339 scopus 로고    scopus 로고
    • Revisiting co-processing for hash joins on the coupled cpu-gpu architecture
    • J. He, M. Lu, and B. He. Revisiting co-processing for hash joins on the coupled cpu-gpu architecture. In PVLDB, pages 1-12, 2013.
    • (2013) In PVLDB, pages , pp. 1-12
    • He, J.1    Lu, M.2    He, B.3
  • 12
    • 77954705147 scopus 로고    scopus 로고
    • Sort vs. hash revisited: fast join implementation on modern multi-core cpus. Proc. VLDB Endow., pages
    • C. Kim and et al. Sort vs. hash revisited: fast join implementation on modern multi-core cpus. Proc. VLDB Endow., pages 1378-1389, 2009.
    • (2009) , pp. 1378-1389
    • Kim, C.1
  • 13
    • 77954701719 scopus 로고    scopus 로고
    • Fast: fast architecture sensitive tree search on modern cpus and gpus
    • C. Kim and et al. Fast: fast architecture sensitive tree search on modern cpus and gpus. In SIGMOD, pages 339-350, 2010.
    • (2010) In SIGMOD, pages , pp. 339-350
    • Kim, C.1
  • 14
    • 0019058442 scopus 로고
    • Programs, life cycles, and laws of software evolution
    • M. M. Lehman. Programs, life cycles, and laws of software evolution. In Proceedings of the IEEE, pages 1060-1076, 1980.
    • (1980) In Proceedings of the IEEE, pages , pp. 1060-1076
    • Lehman, M.M.1
  • 15
    • 84906809751 scopus 로고    scopus 로고
    • Laws of software evolution revisited
    • Proceedings of the 5th European Workshop on Software Process Technology, pages
    • M. M. Lehman. Laws of software evolution revisited. In Proceedings of the 5th European Workshop on Software Process Technology, pages 108-124, 1996.
    • (1996) , pp. 108-124
    • Lehman, M.M.1
  • 16
    • 33745618477 scopus 로고    scopus 로고
    • C-store: a column-oriented dbms
    • M. Stonebraker and et al. C-store: a column-oriented dbms. In VLDB, pages 553-564, 2005.
    • (2005) In VLDB, pages , pp. 553-564
    • Stonebraker, M.1
  • 17
    • 84891086891 scopus 로고    scopus 로고
    • Database Management Systems. McGraw-Hill, 3rd edition
    • R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill, 3rd edition, 2007.
    • (2007)
    • Ramakrishnan, R.1    Gehrke, J.2


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