Efficient Multidimensional Blocking for Link Discovery Without Losing Recall

Over the last three years, an increasing number of data providers have started to publish structured data according to the Linked Data principles on the Web. The resulting Web of Data currently consists of over 28 billion RDF triples. As the Web of Data grows, there is an increasing need for link discovery tools which scale to very large datasets. In record linkage, many partitioning methods have been proposed which substantially reduce the number of required entity comparisons. Unfortunately, most of these methods either lead to a decrease in recall or only work on metric spaces.

Provided by: Freie Universitat Berlin Topic: Software Date Added: Jun 2011 Format: PDF

Find By Topic