Advertisement

DigestJoin: Expediting Joins on Solid-State Drives

  • Shen Gao
  • Yu Li
  • Jianliang Xu
  • Byron Choi
  • Haibo Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5982)

Abstract

This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and hence expensive write operations while exploiting fast random reads. The demonstration system consists of an implementation ofDigestJoin in the open-source PostgreSQL database management system on an Intel SSD. In the demonstration, we will showcase the performance benefits of DigestJoin in comparison to a traditional join algorithm and highlight the workloads in which DigestJoin is particularly favorable.

Keywords

Database Management System Performance Benefit Input Buffer Magnetic Disk Database Application 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lee, S.-W., Moon, B., Park, C., Kim, J.-M., Kim, S.-W.: A Case for Flash Memory SSD in Enterprise Database Applications. In: Proceedings of SIGMOD, pp. 1075–1086 (2008)Google Scholar
  2. 2.
    Li, Y., On, S.T., Xu, J., Choi, B., Hu, H.: DigestJoin: Exploiting Fast Random Reads for Flash-based Joins. In: Proceedings of the 10th International Conference on Mobile Data Management (MDM 2009), pp. 152–161 (2009)Google Scholar
  3. 3.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Shen Gao
    • 1
  • Yu Li
    • 1
  • Jianliang Xu
    • 1
  • Byron Choi
    • 1
  • Haibo Hu
    • 1
  1. 1.Depart of Computer ScienceHong Kong Baptist UniversityKowloon TongHong Kong SAR, China

Personalised recommendations