AG 1, AG 3, AG 5, SWS, AG 2, AG 4, RG1, MMCI   Info

MPI Audience

English

120 Minutes

Saarbrücken

Collections of tens of millions of automatically extracted facts represented using the subject-predicate-object RDF model are available for several domains. As big as these collections are, they are unable to capture all information about a domain, simply because the sources from which they were extracted are incomplete. This can be tackled by creating knowledge bases where facts are enforced with rules showing how new facts can be generated from existing ones and constraints which must hold in the relevant domain. Querying such knowledge bases is expensive for two main reasons. First, data is disk resident, which makes access to it slow. Secondly, rule definitions can be recursive, which requires special query evaluation techniques and renders traditional cost-based query optimization and join-ordering techniques less effective. Based on my thesis, this talk presents an implementation of an optimizing query processor for such a setting. We present the storage engine underlying our implementation, and the optimizations along several dimensions: (i) query evaluation techniques, (ii) caching to reduce both disk access and rule evaluation, (iii) a classification of predicates which allows better utilization of the underlying storage engine's ability to optimize traditional relational queries and (iv) a probabilistic way of looking at join ordering and cost estimation in this context.

IMPRS-CS

--email hidden

passcode not visible

logged in users only

Please note: The talks will take place in random order!