Skip to main content
SpringerLink
Log in

Can SSDs Help Reduce Random I/Os in Hash Joins?

  • Conference paper
Web-Age Information Management (WAIM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7923))

Included in the following conference series:

  • 3452 Accesses

Abstract

A hybrid drive combines the features of SSDs and HDDs in the same unit by using SSD as the intermediate cache. In light of its promising features, we propose a new algorithm called CGHJ(Cached Grace Hash Join) for hybrid drives, which reduces hard disk random I/Os that occur in the partitioning phase of traditional Grace hash joins by caching the segments of buckets in the SSD and migrating these segments of each partition contiguously to the HDD. Experiment results show that CGHJ can greatly reduce random disk I/Os in the case of small joining working spaces or larger relations and improve hash join performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Athanassoulis, M., Ailamaki, A., Chen, S., Gibbons, P.B., Stoica, R.: Flash in a DBMS: where and how? IEEE Data Eng. Bull. 33(4), 28–34 (2011)

    Google Scholar 

  2. Li, Y., Xu, J.L., Choi, B.: DigestJoin: exploiting fast random reads for flash-based joins. In: Proc. of Int’l Conf. on Mobile Data Management, pp. 152–161. IEEE Press, Washington (2009)

    Google Scholar 

  3. Lo, M.-L., Ravishankar, C.V.: Towards eliminating random I/O in hash joins. In: Proc. of Int’l Conf. of Data Eng., pp. 422–429. IEEE Press, Washington (1996)

    Google Scholar 

  4. Park, S.S., Lee, S.W.: Hash join in commercial database with flash memory SSD. In: Proc. of Int’l Conf. on Computer Science and Info. Technology, pp. 265–268. IEEE Press, Washington (2010)

    Google Scholar 

  5. Shah, M., Harizopoulos, S., Wiener, J., Graefe, G.: Fast scans and joins using flash drives. In: Proc. of DaMoN Conf., pp. 17–24. ACM Press, New York (2008)

    Chapter  Google Scholar 

  6. Tsirogiannis, D., Harizopoulos, S., Shah, M.A., Wiener, J.L., Graefe, G.: Query processing techniques for solid state drives. In: Proc. of ACM SIGMOD Conf., pp. 59–72. ACM Press, New York (2009)

    Google Scholar 

  7. Koltsidas, I., Viglas, S.: Data management over flash memory. In: Proc. of SIGMOD Conf., pp. 1209–1212. ACM Press, New York (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science & Technology, Zhejiang Univ. of Technology, Hangzhou, China

    Liang Huai Yang, Mingchao Liu, Yifan Pan & Weihua Gong

  2. School of Computing and Information Systems, University of Tasmania, Tasmania, Australia

    Simon Stannus

Authors
  1. Liang Huai Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingchao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yifan Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weihua Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Simon Stannus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, China

    Jianyong Wang

  2. Management Science and Information Systems Department, Rutgers, the State University of New Jersey, 1, Washington Park, 07102, Newark, NJ, USA

    Hui Xiong

  3. Department of Information Engineering, Nagoya University, 464-8601, Nagoya, Japan

    Yoshiharu Ishikawa

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong

    Jianliang Xu

  5. School of Information Science and Engineering, Yanshan University, Qinhuangdao, China

    Junfeng Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, L.H., Liu, M., Pan, Y., Gong, W., Stannus, S. (2013). Can SSDs Help Reduce Random I/Os in Hash Joins?. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38562-9_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38561-2

  • Online ISBN: 978-3-642-38562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation