Parallel Join

Hasso Plattner
Additional contact information
Hasso Plattner: Hasso Plattner Institute

Chapter Chapter 23 in A Course in In-Memory Data Management, 2014, pp 157-159 from Springer

Abstract: Abstract The join operation is one of the most cost-intensive tasks for in-memory databases. As today’s systems introduce more and more parallelism, intra-operator parallelization moves into focus.

Keywords: Hash Join; Hashing Phase; Local Hash Table; Probe Thread; Probing Phase (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-55270-0_23

Ordering information: This item can be ordered from
http://www.springer.com/9783642552700

DOI: 10.1007/978-3-642-55270-0_23

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().