Description

With the growth of the number and the size of RDF datasets comes an increasing need for scalable solutions to support the linking of resources. Most Link Discovery frameworks rely on complex link specifications for this purpose. We address the scalability of the execution of link specifications by presenting the first dynamic planning approach for Link Discovery dubbed Condor. In contrast to the state of the art, Condor can re-evaluate and reshape execution plans for link specifications during their execution. Thus, it achieves significantly better runtimes than existing planning solutions while retaining an F-measure of 100%. We quantify our improvement by evaluating our approach on 7 datasets and 700 link specifications. Our results suggest that Condor is up to 2 orders of magnitude faster than the state of the art and requires less than 0.1% of the total runtime of a given specification to generate the corresponding plan.

BibTex

@inproceedings{10.1007/978-3-319-93417-4_16,
  added-at = {2018-10-04T11:21:39.000+0200},
  address = {Cham},
  author = {Georgala, Kleanthi and Obraczka, Daniel and Ngonga Ngomo, Axel-Cyrille},
  biburl = {https://www.bibsonomy.org/bibtex/2985782b54ea2e161ad8e6e8405c7526e/aksw},
  booktitle = {The Semantic Web, ESWC 2018, Lecture Notes in Computer Science},
  editor = {Gangemi, Aldo and Navigli, Roberto and Vidal, Maria-Esther and Hitzler, Pascal and Troncy, Rapha{\"e}l and Hollink, Laura and Tordai, Anna and Alam, Mehwish},
  interhash = {224bbdb191120bf747e2a7adaa3f1e94},
  intrahash = {985782b54ea2e161ad8e6e8405c7526e},
  keywords = {LinkingLOD dice geiser georgala group_aksw limes projecthobbit sake simba slipo},
  pages = {240--255},
  publisher = {Springer International Publishing},
  timestamp = {2018-10-04T11:21:39.000+0200},
  title = {Dynamic Planning for Link Discovery},
  url = {http://svn.aksw.org/papers/2018/ESWC_CONDOR/public.pdf},
  year = 2018
}