Efficient Parallel Set-Similarity Joins Using MapReduce

First Page		Document Content
Date: 2013-04-16 21:54:23 Parallel computing Distributed computing architecture MapReduce Compiler construction Data-intensive computing Lexical analysis Hash function Data Typetoken distinction Function Parallelization contract		Efficient Parallel Set-Similarity Joins Using MapReduce Add to Reading List Source URL: flamingo.ics.uci.edu Download Document from Source Website File Size: 691,90 KB Share Document on Facebook

	COMPILER CONSTRUCTION William M. Waite Department of Electrical Engineering University of Colorado Boulder, Colorado 80309 DocID: 1u5Ve - View Document
	Combining Static and Dynamic Contract Checking for Curry Michael Hanus University of Kiel Programming Languages and Compiler Construction DocID: 1tKXN - View Document
	CompSci 754: Compiler Construction and Theory John Boyland Spring 2018 Office Office Hours DocID: 1tCj1 - View Document
	On Functional Logic Programming and its Application to Testing Sebastian Fischer Programming Languages and Compiler Construction Department of Computing Science Christian-Albrechts University of Kiel DocID: 1sWAw - View Document
	Accurate prediction of the behavior of multithreaded applications in shared caches DocID: 1rtkc - View Document