A
Andreas Harth
Researcher at University of Erlangen-Nuremberg
Publications - 158
Citations - 4918
Andreas Harth is an academic researcher from University of Erlangen-Nuremberg. The author has contributed to research in topics: Linked data & Semantic Web. The author has an hindex of 37, co-authored 145 publications receiving 4734 citations. Previous affiliations of Andreas Harth include National University of Ireland & Karlsruhe Institute of Technology.
Papers
More filters
Book ChapterDOI
YARS2: a federated repository for querying graph structured data from the web
TL;DR: The architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collected from many disparate sources on the Web is presented.
Book ChapterDOI
Towards semantically-interlinked online communities
TL;DR: This work presents the SIOC ontology which combines terms from vocabularies that already exist with new terms needed to describe the relationships between concepts in the realm of online community sites.
Proceedings ArticleDOI
Optimized index structures for querying RDF from the Web
Andreas Harth,Stefan Decker +1 more
TL;DR: Optimized index structures for RDF are described, how to process and evaluate queries based on the index structure is shown, a lightweight adaptable implementation in Java is described, and a performance comparison with existing RDF databases is provided.
Journal ArticleDOI
Searching and browsing Linked Data with SWSE: The Semantic Web Search Engine
TL;DR: The current SWSE system is described, initially detailing the architecture and later elaborating upon the function, design, implementation and performance of each individual component, to give an insight into how current Semantic Web standards can be tailored, in a best-effort manner, for use on Web data.
Proceedings ArticleDOI
Data summaries for on-demand queries over linked data
TL;DR: An approximate index structure summarising graph-structured content of sources adhering to Linked data principles is developed, an algorithm for answering conjunctive queries over Linked Data on theWeb exploiting the source summary is provided, and the system is evaluated using synthetically generated queries.