Seminar on Querying Graph Databases

From 11 a.m. , May 1 (Fri), 2015 , Bldg. 301, 751-2

Hannes Voigt

-Ph.D. TU Dresden (2014)

-Post-Doctoral Researcher  in Database Technology Group at  TU Dresden

-Visiting Scientist at SAP Labs, Palo Alto (2010/2011)

-Research Interests

 : scalable graph database, graph query languages, large graph processing, flexible data management and  physical design     

Abstract

Today many database applications turn their interest from the management of individual entities towards the relationships between entities. Instead of property values, structure and topology of networks of connected entities form becomes focus. With such a focus, graph data models seem to be the new natural choice for data management in many applications and graph database systems have become an exciting emerging technology. There is already a large variety of different graph database systems available, building on different graph data models and exposing different graph interaction and query concepts each suitable for certain applications. However, to be successful in the long run, graph database systems have to able to blend in with existing information systems and the present dominant concepts of data management in these systems. The talk focuses on two aspects: (1) the closure property of graph query concepts, (2) the integration of graph query concepts with relational concepts and multidimensional query concepts on graphs.