CIKM '94 Proceedings of the third international conference on Information and knowledge management
Database Management Systems
Design of flash-based DBMS: an in-page logging approach
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Design tradeoffs for SSD performance
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Fast scans and joins using flash drives
Proceedings of the 4th international workshop on Data management on new hardware
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Proceedings of the 36th annual international symposium on Computer architecture
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Advances in flash memory SSD technology for enterprise database applications
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Join processing for flash SSDs: remembering past lessons
Proceedings of the Fifth International Workshop on Data Management on New Hardware
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Exploiting Internal Parallelism of Flash-based SSDs
IEEE Computer Architecture Letters
Proceedings of the international conference on Supercomputing
HPCA '11 Proceedings of the 2011 IEEE 17th International Symposium on High Performance Computer Architecture
B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Nowadays, flash-based solid state drives (SSDs) are gradually replacing hard disk drives (HDDs) as the primary non-volatile storage in both desktop and enterprise applications because of their potential to speed up performance and reduce power consumption. However, database query processing engines are designed based on the fundamental characteristics of HDDs, so they may not benefit immediately from SSDs. Previous researches on optimizing database query processing on SSDs have mainly focused on leveraging the high random data access performance of SSDs and avoiding slow random writes whenever possible. However, they fail to exploit the rich internal parallelism of SSDs. In this paper, we focus on exploiting rich internal parallelism of SSDs to optimize scan and join operators. Firstly, we detect internal parallelism of SSDs seemed as black boxes. Then we propose a parallel table scan operator called ParaScan to take full advantage of internal parallelism of SSDs. Based on ParaScan, we also present an efficient parallel join operator called ParaHashJoin to accelerate database query processing. Experimental results on TPC-H datasets show that our ParaScan on SSD significantly outperforms the traditional table scan on SSD by 1X, and ParaHashJoin is 1.5X faster than traditional hash join operator especially when join selectivity is small.