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

	HiMach A Parallel Framework for Analyzing Molecular Dynamics Trajectories HiMach Version 1.0/Document Version 0.1 June 2009 DocID: 1rrY6 - View Document
	Multi-pass Sorted Neighborhood Blocking with MapReduce Lars Kolb University of Leipzig Database Group Andreas Thor DocID: 1q30B - View Document
	Extending Map-Reduce for Efficient Predicate-Based Sampling Raman Grover 1 DocID: 1pwK7 - View Document
	Efficient Parallel Set-Similarity Joins Using MapReduce DocID: 1oVvf - View Document
	MapReduce and PACT - Comparing Data Parallel Programming Models Alexander Alexandrov, Stephan Ewen, Max Heimel, Fabian Hueske, Odej Kao, Volker Markl, Erik Nijkamp, Daniel Warneke Technische Universit¨at Berlin, Germany DocID: 1ob89 - View Document