Efficient Parallel Set-Similarity Joins Using MapReduce

First Page		Document Content
Date: 2013-06-06 15:43:58 Parallel computing Computing Software engineering Computer programming Distributed computing architecture MapReduce Compiler construction Data-intensive computing Lexical analysis Hash function Data Function		Efficient Parallel Set-Similarity Joins Using MapReduce Add to Reading List Source URL: asterixdb.ics.uci.edu Download Document from Source Website File Size: 691,90 KB Share Document on Facebook

	CVA Memo #138 Sikker: A High-Performance Distributed System Architecture for Secure Service-Oriented Computing Nicholas McDonald and William J. Dally DocID: 1uuaH - View Document
	CVA Memo #137 Sikker: A Distributed System Architecture for Secure High Performance Computing Nicholas McDonald DocID: 1uivM - View Document
	Hudson Execution and Scheduling Architecture DocID: 1rtYD - View Document
	Microsoft Word - HotPower_camera_ready_ACM_format DocID: 1rtKl - View Document
	SplitStream: High-bandwidth content distribution in cooperative environments Miguel Castro1 Peter Druschel2 Antony Rowstron1 DocID: 1rry7 - View Document