Advanced block nested loop join for extending SSD lifetime

Hongchan Roh, Mincheol Shin, Wonmook Jung, Sang Hyun Park

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Flash technology trends have shown that greater densities between flash memory cells increase read/write error rates and shorten solid-state drive (SSD) device lifetimes. This is critical for enterprise systems, causing such problems as service instability and increased total cost of ownership (TCO) because of SSD replacement. Therefore, numerous studies have focused on decreasing the amount of the DBMS writes. However, there has been no research that focused on decreasing the amount of temporary writes, which are primarily created by join processing. In DBMSs, there are two major join-processing algorithms, i.e., hybrid hash join (HHJ) and sort merge join (SMJ), proven to be the best according to DBMS workload; however, the two algorithms produce temporary writes of intermediate results. Therefore, we instead look to the block-nested loop join (BNLJ); it is well-known that the two algorithms are better than BNLJ, but BNLJ creates no intermediate result writes. It is reasonable to use BNLJ for a major join algorithm if its performance can be enhanced similar to those of HHJ and SMJ, considering BNLJ's advantage of extending SSD lifetimes. Therefore, in this paper, we propose an advanced BNLJ (ANLJ) algorithm that can match the performance of the two main join algorithms.

Original languageEnglish
Article number7814205
Pages (from-to)743-756
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume29
Issue number4
DOIs
Publication statusPublished - 2017 Apr 1

Fingerprint

Flash memory
Processing
Costs
Industry

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Roh, Hongchan ; Shin, Mincheol ; Jung, Wonmook ; Park, Sang Hyun. / Advanced block nested loop join for extending SSD lifetime. In: IEEE Transactions on Knowledge and Data Engineering. 2017 ; Vol. 29, No. 4. pp. 743-756.
@article{2945a0ce0c214a90943ce7e8cff2e4ee,
title = "Advanced block nested loop join for extending SSD lifetime",
abstract = "Flash technology trends have shown that greater densities between flash memory cells increase read/write error rates and shorten solid-state drive (SSD) device lifetimes. This is critical for enterprise systems, causing such problems as service instability and increased total cost of ownership (TCO) because of SSD replacement. Therefore, numerous studies have focused on decreasing the amount of the DBMS writes. However, there has been no research that focused on decreasing the amount of temporary writes, which are primarily created by join processing. In DBMSs, there are two major join-processing algorithms, i.e., hybrid hash join (HHJ) and sort merge join (SMJ), proven to be the best according to DBMS workload; however, the two algorithms produce temporary writes of intermediate results. Therefore, we instead look to the block-nested loop join (BNLJ); it is well-known that the two algorithms are better than BNLJ, but BNLJ creates no intermediate result writes. It is reasonable to use BNLJ for a major join algorithm if its performance can be enhanced similar to those of HHJ and SMJ, considering BNLJ's advantage of extending SSD lifetimes. Therefore, in this paper, we propose an advanced BNLJ (ANLJ) algorithm that can match the performance of the two main join algorithms.",
author = "Hongchan Roh and Mincheol Shin and Wonmook Jung and Park, {Sang Hyun}",
year = "2017",
month = "4",
day = "1",
doi = "10.1109/TKDE.2017.2651803",
language = "English",
volume = "29",
pages = "743--756",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "4",

}

Advanced block nested loop join for extending SSD lifetime. / Roh, Hongchan; Shin, Mincheol; Jung, Wonmook; Park, Sang Hyun.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 29, No. 4, 7814205, 01.04.2017, p. 743-756.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Advanced block nested loop join for extending SSD lifetime

AU - Roh, Hongchan

AU - Shin, Mincheol

AU - Jung, Wonmook

AU - Park, Sang Hyun

PY - 2017/4/1

Y1 - 2017/4/1

N2 - Flash technology trends have shown that greater densities between flash memory cells increase read/write error rates and shorten solid-state drive (SSD) device lifetimes. This is critical for enterprise systems, causing such problems as service instability and increased total cost of ownership (TCO) because of SSD replacement. Therefore, numerous studies have focused on decreasing the amount of the DBMS writes. However, there has been no research that focused on decreasing the amount of temporary writes, which are primarily created by join processing. In DBMSs, there are two major join-processing algorithms, i.e., hybrid hash join (HHJ) and sort merge join (SMJ), proven to be the best according to DBMS workload; however, the two algorithms produce temporary writes of intermediate results. Therefore, we instead look to the block-nested loop join (BNLJ); it is well-known that the two algorithms are better than BNLJ, but BNLJ creates no intermediate result writes. It is reasonable to use BNLJ for a major join algorithm if its performance can be enhanced similar to those of HHJ and SMJ, considering BNLJ's advantage of extending SSD lifetimes. Therefore, in this paper, we propose an advanced BNLJ (ANLJ) algorithm that can match the performance of the two main join algorithms.

AB - Flash technology trends have shown that greater densities between flash memory cells increase read/write error rates and shorten solid-state drive (SSD) device lifetimes. This is critical for enterprise systems, causing such problems as service instability and increased total cost of ownership (TCO) because of SSD replacement. Therefore, numerous studies have focused on decreasing the amount of the DBMS writes. However, there has been no research that focused on decreasing the amount of temporary writes, which are primarily created by join processing. In DBMSs, there are two major join-processing algorithms, i.e., hybrid hash join (HHJ) and sort merge join (SMJ), proven to be the best according to DBMS workload; however, the two algorithms produce temporary writes of intermediate results. Therefore, we instead look to the block-nested loop join (BNLJ); it is well-known that the two algorithms are better than BNLJ, but BNLJ creates no intermediate result writes. It is reasonable to use BNLJ for a major join algorithm if its performance can be enhanced similar to those of HHJ and SMJ, considering BNLJ's advantage of extending SSD lifetimes. Therefore, in this paper, we propose an advanced BNLJ (ANLJ) algorithm that can match the performance of the two main join algorithms.

UR - http://www.scopus.com/inward/record.url?scp=85015725362&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015725362&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2017.2651803

DO - 10.1109/TKDE.2017.2651803

M3 - Article

VL - 29

SP - 743

EP - 756

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 4

M1 - 7814205

ER -