Tina Popp defends her PhD
Today, our very own Tina Popp defended her PhD thesis with great success!
She did her work on the complexity of graph query languages in which regular path queries, which are at the center of graph pattern matching are evaluated using new modes namely:
- regular path queries can be matched against trails and simple paths and
- entire paths that match the regular path queries can be returned.
. These new modes are already being used in Cypher and GQL.