Join processing for flash SSDs: Remembering past lessons

Proceedings of the 5th International Workshop on Data Management on New Hardware, DaMoN 2009 in Conjunction with ACM SIGMOD/PODS Conference

Volumn , Issue , 2009, Pages 1-8

  Do, Jaeyoung ^a   Patel, Jignesh M ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH JOIN; JOIN ALGORITHM; JOIN METHOD; JOIN PROCESSING; MAGNETIC HARD DISK DRIVES; NESTED LOOPS; TUNING ALGORITHM;

AD HOC NETWORKS; ALGORITHMS; MAGNETISM;

HARD DISK STORAGE;

EID: 70449672982     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1565694.1565696     Document Type: Conference Paper

References (18)

1. SQLite3. http://www.sqlite.org/.
2. Transaction Processing Performance Council. http://www.tpc.org/.
3. A. Ailamaki, D. DeWitt, M. Hill, and M. Skounakis. Weaving Relations for Cache Performance. In proceedings of the 27th International Conference on Very Large Data Bases (VLDB), pages 169-180, 2001.
4. L. Bouganim, B. Jonsson, and P. Bonnet. uFLIP: Understanding Flash IO Patterns. In proceedings of the 4th Biennial Conference on Innovative Data Systems Research (CIDR), 2009.
5. K. Bratbergsengen. Hashing Methods and Relational Algebra Operations. In proceedings of the 10th International Conference on Very Large Data Bases (VLDB), pages 323-333, 1984.
6. G. Graefe. The five-minute rule twenty years later, and how flash memory changes the rules. In proceedings of the 3rd International Workshop on Data Management on New Hardware (DaMoN), 2007.
7. J. Gray and B. Fizgerald. Flash Disk Opportunity for Server-Applications. ACM QUEUE, 6(4):18-23, July 2008.
8. L. Haas, M. Carey, M. Livny, and A. Shukla. SEEKing the truth about ad hoc join costs. The VLDB journal, 6(3):241-256, 1997.
9. C. Hwang. Nanotechnology Enables a New Memory Growth Model. Proceedings of the IEEE, 91(11):1765-1771, November 2003.
10. M. Kitsuregawa, H. Tanaka, and T. Moto-Oka. Application of Hash to Database Machine and Its Architecture. New Generation Computing, 1(1):63-74, 1983.
11. D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass, 1973.
12. S. Lee and B. Moon. Design of Flash-Based DBMS: An In-Page Logging Approach. In proceedings of the ACM SIGMOD International Conference on Management of Data, pages 55-66, 2007.
13. S. Lee, B. Moon, C. Park, J. Kim, and S. Kim. A Case for Flash Memory SSD in Enterprise Database Applications. In proceedings of the ACM SIGMOD International Conference on Management of Data, pages 1075-1086, 2008.
14. D. Myers. On the Use of NAND Flash Memory in High-Performance Relational Databases. Master's Thesis, MIT, 2008.
15. M. Polte, J. Simsa, and G. Gibson. Comparing Performance of Solid State Devices and Mechanical Disks. In proceedings of the 3rd Petascale Data Storage Workshop (PDS Workshop), 2008.
16. M. Shah, S. Harizopoulos, J. Wiener, and G. Graefe. Fast Scans and Joins using Flash Drives. In proceedings of the 4th International Workshop on Data Management on New Hardware (DaMoN), 2008.
17. L. Shapiro. Join Processing in Database Systems with Large Main Memories. ACM Transactions on Database Systems, 11(3):239-264, September 1986.
18. D. Tsirogiannis, S. Harizopoulos, M. Shah, J. Wiener, and G. Graefe. Query Processing Techniques for Solid State Drives. In proceedings of the ACM SIGMOD International Conference on Management of Data, 2009.