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

	MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1 DocID: 1xUN2 - View Document
	Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html \| pdf \| kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that DocID: 1xTR9 - View Document
	Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions DocID: 1xTdH - View Document