MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D3

What and Who

Optimizing Recursive Queries in RDF Knowledge Bases

Mohamed Yahya
International Max Planck Research School for Computer Science - IMPRS
IMPRS Research Seminar
AG 1, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
Public Audience
English

Date, Time and Location

Thursday, 20 May 2010
13:00
60 Minutes
E1 4
024
Saarbrücken

Abstract

The RDF data model is a simple yet powerful one used for representing
data in a manner that makes it easy for humans to deal with large
collections of information while still being easily machine-readable.
Ontologies, such as Yago, contain a great deal of information that is
represented in RDF format. Ontologies will usually contain some
inconsistencies and exhibit incompleteness either because the way in
which they were extracted or the nature of the sources they were
collected from. One possible way of resolving both issues is to append
rules describing the domain with which the ontology deals. Such rules
are potentially recursive: the definition of one rule can depend on
multiple rules, whose definition, in turn, can depend on the
definition if the first rule. Query processing in such a setting is
known to be very expensive. This thesis explores the issues involved
in implementing a query processor for such a setting.

Contact

Jennifer Gerling
225
--email hidden
passcode not visible
logged in users only

Jennifer Gerling, 05/17/2010 11:23 -- Created document.