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

	F. Kordon - Sorbonne Université - CC2018 Building and verifying a Logging entity over Distributed Hash Tables Join work with X. Bonnaire, R. Cortes & O. Marin DocID: 1u4Na - View Document
	Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing DocID: 1rmpD - View Document
	Automatic selection of table areas in documents for information extraction Ana Costa e Silva1, Alípio Jorge2, Luís Torgo2 1 2 DocID: 1r2A4 - View Document
	Hyracks: A Flexible and Extensible Foundation for Data-Intensive Computing Vinayak Borkar, Michael Carey, Raman Grover, Nicola Onose, Rares Vernica Computer Science Department, University of California, Irvine Irvine, CA DocID: 1qOF4 - View Document
	Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave∗ Keno Albrecht, Ruedi Arnold, Michael G¨ahwiler, Roger Wattenhofer Swiss Federal Institute of Technology Department of Computer Science 8092 DocID: 1qD3a - View Document