DigestJoin: Expediting joins on solid-state drives

Shen Gao*, Yu Li, Jianliang XU, Koon Kau CHOI, Haibo HU

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review


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 of DigestJoin 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.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings
Number of pages4
EditionPART 2
Publication statusPublished - 2010
Event15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 - Tsukuba, Japan
Duration: 1 Apr 20104 Apr 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on Database Systems for Advanced Applications, DASFAA 2010

Scopus Subject Areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'DigestJoin: Expediting joins on solid-state drives'. Together they form a unique fingerprint.

Cite this