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

	Confuga: Scalable Data Intensive Computing for POSIX Workflows Patrick Donnelly, Nicholas Hazekamp, Douglas Thain Department of Computer Science and Engineering University of Notre Dame {pdonnel3,nhazekam,dthain}@nd.edu DocID: 1v933 - View Document
	Windows Azure for Research Accelerate the speed of scientific discovery Windows Azure provides researchers with the power and scalability of cloud computing for collaboration, computation, and data-intensive processing. DocID: 1u3KX - 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: 1tMQ2 - View Document
	Biomedical Case Studies in Data Intensive Computing Geoffrey Fox1,2, Xiaohong Qiu1, Scott Beason1, Jong Choi1,2, Jaliya Ekanayake1,2 Thilina Gunarathne1,2,Mina Rho2, Haixu Tang2, Neil Devadasan3, Gilbert Liu4, Pervasive DocID: 1taKo - View Document
	IMT Institute for Advanced Studies Lucca, Italy Big Data and the Web: Algorithms for Data Intensive Scalable Computing DocID: 1sX92 - View Document