Abstract:
In this talk I will present a representation system for relational data that uses factored forms to encode succinctly large relations. I will then address two main questions:
1. How succinct are factorizations of query results?
2. Can such factorizations speed up query evaluation?
I will also comment on how factorizations are used in Google´s recent distributed database management system F1, for scalable machine learning, for managing large sets of possibilities and choices in incomplete information and configuration problems, and for tractable query evaluation in probabilistic databases. This is joint work with Jakub Zavodny.
Bio:
Dan Olteanu (http://www.cs.ox.ac.uk/dan.olteanu/) is an Associate Professor in the Department of Computer Science at the University of Oxford and Fellow of St Cross College. His research interests are in databases and he contributed to systems and theory aspects of XML query processing, incomplete information and probabilistic databases, and more recently to factorized databases and datalog engines. He is a co-author of the book “Probabilistic Databases” (2011). Olteanu has served in over 50 programme committees of international venues, as associate editor for PVLDB’13 and since 2013 for IEEE TKDE, as PC chair for BNCOD’13, and he is currently serving as track chair for ICDE’15 and SIGMOD’15