LOTUS: Adaptive text search for big linked data

F. Ilievski, Wouter Beek, Marieke van Erp, Laurens Rietveld, Stefan Schlobach

Research output: Chapter in Book / Report / Conference proceedingChapterAcademicpeer-review

Abstract

Finding relevant resources on the Semantic Web today is a dirty job: no centralized query service exists and the support for natural language access is limited. We present LOTUS: Linked Open Text Un- leaShed, a text-based entry point to a massive subset of today’s Linked Open Data Cloud. Recognizing the use case dependency of resource re- trieval, LOTUS provides an adaptive framework in which a set of match- ing and ranking algorithms are made available. Researchers and develop- ers are able to tune their own LOTUS index by choosing and combining the matching and ranking algorithms that suit their use case best. In this paper, we explain the LOTUS approach, its implementation and the functionality it provides. We demonstrate the ease with which LOTUS enables text-based resource retrieval at an unprecedented scale in con- crete and domain-specific scenarios. Finally, we provide evidence for the scalability of LOTUS with respect to the LOD Laundromat, the largest collection of easily accessible Linked Open Data currently available.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer/Verlag
Pages470-485
Number of pages16
ISBN (Print)9783319341286
DOIs
Publication statusPublished - 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9678

Keywords

  • Findability
  • Scalable data management
  • Semantic search
  • Text indexing

Fingerprint

Dive into the research topics of 'LOTUS: Adaptive text search for big linked data'. Together they form a unique fingerprint.

Cite this