DigestJoin: Expediting joins on solid-state drives

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 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. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Gao, S., Li, Y., Xu, J., Choi, B., & Hu, H. (2010). DigestJoin: Expediting joins on solid-state drives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5982 LNCS, pp. 428–431). https://doi.org/10.1007/978-3-642-12098-5_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free