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

	SparkTrails: A MapReduce Implementation of HypTrails for Comparing Hypotheses About Human Trails Martin Becker Hauke Mewes DocID: 1xUtT - View Document
	Scaling Up with MapReduce, Hadoop, and Amazon Term Frequency Kenneth Lay DocID: 1vprX - View Document
	MapReduce による大規模分散システムのシミュレーション杉野好宏† 華井 DocID: 1uWY0 - View Document
	Densest Subgraph in Streaming and MapReduce Bahman Bahmani Ravi Kumar Sergei Vassilvitskii DocID: 1uBLZ - View Document
	1/7/16 More Go, Lab 1 Hints, and MapReduce Tom Anderson DocID: 1utqA - View Document