Goals

The goal of the research project is to further develop the theory of databases by posing a particular emphasis on querying graph structured databases. We aim at devising query languages that combine, both constraints based on graph topology, and tests for data ranging over potentially infinite domains. On the one hand, we will develop algorithms for efficient evaluation and static analysis for these languages — such as decidability and complexity of paradigmatic problems, efficient algorithms for query evaluation and containment, query optimization. And on the other hand, we will study the fundamental properties inherent to them — such as the expressive power, model theory, definability, axiomatization.

Members

• Sergio Abriola (UBA, Argentina)
• Carlos Areces (UNC, Argentina). Córdoba coordinator
• Pierre Bourhis (CRIStAL, CNRS, France). Lille coordinator
• Diego Figueira (LaBRI, CNRS, France)
• Santiago Figueira (UBA, Argentina). International coordinator
• Gabriele Puppis (LaBRI, CNRS, France). Bordeaux coordinator
• Cristian Riveros (PUC, Chile). Santiago de Chile coordinator
• Domagoj Vrgoč (PUC, Chile)

Kickoff workshop

Department of Computer Science, FCEN, University of Buenos Aires. 19-23 September 2016
Local organizer: Santiago Figueira

Program