Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

First Page		Document Content
Date: 2015-08-14 19:41:23 Information retrieval Information science Computing Hashing Sorting algorithms Search algorithms Database management systems Hash join Sort-merge join Hash function Merge algorithm Hash table		Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing Add to Reading List Source URL: web.cse.ohio-state.edu Download Document from Source Website File Size: 223,16 KB Share Document on Facebook

	Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing DocID: 1rmpD - View Document
	PDF Document DocID: 1j4MP - View Document
	On Producing High and Early Result Throughput in Multi-join Query Plans Justin J. Levandoski, Member, IEEE, Mohamed E. Khalefa, Member, IEEE, and Mohamed F. Mokbel, Member, IEEE Abstract—This paper introduces an effici DocID: 13X0y - View Document
	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited Cagri Balkesen, Gustavo Alonso Jens Teubner ¨ DocID: 1158a - View Document
	Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing Spyros Blanas and Jignesh M. Patel University of Wisconsin–Madison {sblanas,jignesh}@cs.wisc.edu DocID: 114IE - View Document