Multi-pass Sorted Neighborhood Blocking with MapReduce Lars Kolb University of Leipzig Database Group Andreas Thor

First Page		Document Content
Date: 2011-05-16 15:04:14 Computing Concurrent computing Parallel computing Distributed computing architecture MapReduce Data-intensive computing Data Apache Hadoop Record linkage Partition Sorting algorithm Parallelization contract		Multi-pass Sorted Neighborhood Blocking with MapReduce Lars Kolb University of Leipzig Database Group Andreas Thor Add to Reading List Source URL: dbs.uni-leipzig.de Download Document from Source Website File Size: 739,14 KB Share Document on Facebook

	Irish Record Linkage, Workshop: 10 FebruaryVenue: Library Boardroom. DocID: 1ujNT - View Document
	Iterative Record Linkage for Cleaning and Integration Indrajit Bhattacharya Lise Getoor Department of Computer Science DocID: 1skMn - View Document
	Datenbank Spektrum DOIs13222FACHBEITRAG Speeding up Privacy Preserving Record Linkage for Metric Space DocID: 1sfMg - View Document
	Dedoop: Efficient Deduplication with Hadoop Lars Kolb Andreas Thor Erhard Rahm DocID: 1rqMS - View Document
	Microsoft PowerPoint - IEEEBigData2013V5.ppt [Compatibility Mode] DocID: 1rjlX - View Document