• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Link discovery with guaranteed reduction ratio in affine spaces with minkowski measures. (2012)

by A-C Ngonga Ngomo
Venue:In Proceedings of ISWC,
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

When to Reach for the Cloud: Using Parallel Hardware for Link Discovery

by Axel-cyrille Ngonga Ngomo, Lars Kolb, Norman Heino, Michael Hartung, Erhard Rahm
"... Abstract. With the ever-growing amount of RDF data available across the Web, the discovery of links between datasets and deduplication of resources within knowledge bases have become tasks of crucial importance. Over the last years, several link discovery approaches have been developed to tackle the ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract. With the ever-growing amount of RDF data available across the Web, the discovery of links between datasets and deduplication of resources within knowledge bases have become tasks of crucial importance. Over the last years, several link discovery approaches have been developed to tackle the runtime and complexity problems that are intrinsic to link discovery. Yet, so far, little attention has been paid to the management of hardware resources for the execution of link discovery tasks. This paper addresses this research gap by investigating the efficient use of hardware resources for link discovery. We implement the HR 3 approach for three different parallel processing paradigms including the use of GPUs and MapReduce platforms. We also perform a thorough performance comparison for these implementations. Our results show that certain tasks that appear to require cloud computing techniques can actually be accomplished using standard parallel hardware. Moreover, our evaluation provides break-even points that can serve as guidelines for deciding on when to use which hardware for link discovery.
(Show Context)

Citation Context

...s has been developed to reduce this time complexity (see [18] for an overview). Most of these approaches achieve this goal by optimizing their reduction ratio. In newer literature, the HR 3 algorithm =-=[17]-=- has been shown to be the first algorithm which guarantees that it can achieve any possible reduction ratio. HR 3 builds upon the HYPPO algorithm presented in [16]. The rationale of HR 3 is to maximiz...

Undefined 0 (2015) 1-0 IOS Press

by Konrad Höffner , Sebastian Walter , Edgard Marx , Jens Lehmann , Axel-Cyrille Ngonga Ngomo , Ricardo Usbeck
"... Abstract. Semantic Question Answering (SQA) removes two major access requirements to the Semantic Web: the mastery of a formal query language like SPARQL and knowledge of a specific vocabulary. Because of the complexity of natural language, SQA presents difficult challenges and many research opport ..."
Abstract - Add to MetaCart
Abstract. Semantic Question Answering (SQA) removes two major access requirements to the Semantic Web: the mastery of a formal query language like SPARQL and knowledge of a specific vocabulary. Because of the complexity of natural language, SQA presents difficult challenges and many research opportunities. Instead of a shared effort, however, many essential components are redeveloped, which is an inefficient use of researcher's time and resources. This survey analyzes 62 different SQA systems, which are systematically and manually selected using predefined inclusion and exclusion criteria, leading to 70 selected publications out of 1960 candidates. We identify common challenges, structure solutions, and provide recommendations for future systems. This work is based on publications from the end of 2010 to July 2015 and is also compared to older but similar surveys.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University