Query Languages for Graph Databases: Bridging the Gap Between Theory and Practice
Graph databases have been an active research topic as of late, owing to their applications in areas such as the Semantic Web and Social Network Analysis. In this talk, we present features that are used by several real-world query languages for graph databases. These include navigation, pattern matching, path variables, ungrouping and data comparisons. We analyze their properties, having two main objectives in mind. First, we would like to provide simple yet general definitions of key features of graph query languages, to enable analyses of their different uses in practice and to establish a common ground for their theoretical study. Second, we would like to use them for studying tradeoff between expressiveness and efficiency of existing query languages for graph databases.
Pablo Barceló is an Associate Professor in the Department of Computer Science at the University of Chile. He received his PhD from the University of Toronto in 2006. His main research interest are in the areas of databases and logic in computer science. He has written over 30 technical papers and served on the program committees of major conferences in his area (ACM PODS, SIGMOD, ICDT, STACS, ACM/IEEE LICS). He has also been an invited tutorial speaker at ACM PODS 2013. He is a member of the editorial board of Logical Methods in Computer Science and the editor of the Database Principles Column of the SIGMOD Record.