Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Design of flash-based DBMS: an in-page logging approach
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
A case for flash memory ssd in enterprise database applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Flash Disk Opportunity for Server Applications
Queue - Enterprise Flash Storage
Fast scans and joins using flash drives
Proceedings of the 4th international workshop on Data management on new hardware
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On the impact of flash SSDs on spatial indexing
Proceedings of the Sixth International Workshop on Data Management on New Hardware
Turbocharging DBMS buffer pool using SSDs
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Making cost-based query optimization asymmetry-aware
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
Query processing on smart SSDs: opportunities and challenges
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Scan and join optimization by exploiting internal parallelism of flash-based solid state drives
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
Flash solid state drives (SSDs) provide an attractive alternative to traditional magnetic hard disk drives (HDDs) for DBMS applications. Naturally there is substantial interest in redesigning critical database internals, such as join algorithms, for flash SSDs. However, we must carefully consider the lessons that we have learnt from over three decades of designing and tuning algorithms for magnetic HDD-based systems, so that we continue to reuse techniques that worked for magnetic HDDs and also work with flash SSDs. The focus of this paper is on recalling some of these lessons in the context of ad hoc join algorithms. Based on an actual implementation of four common ad hoc join algorithms on both a magnetic HDD and a flash SSD, we show that many of the "surprising" results from magnetic HDD-based join methods also hold for flash SSDs. These results include the superiority of block nested loops join over sort-merge join and Grace hash join in many cases, and the benefits of blocked I/Os. In addition, we find that simply looking at the I/O costs when designing new flash SSD join algorithms can be problematic, as the CPU cost is often a bigger component of the total join cost with SSDs. We hope that these results provide insights and better starting points for researchers designing new join algorithms for flash SSDs.