This talk will present a new graph query language (GQL) that returns as the result of a query a single graph or set of graphs, whose data structures are optimized for iterative querying. The single graph result format is in contrast to many graph query languages that return results in tabular format, which requires significant computation to reconstruct into graphs for subsequent querying. In addition, GQL seamlessly integrates graph analysis functions including the ability to represent hypotheses and return results based on them, the ability to define useful graph patterns for future graph analysis, the ability to define and use special graph algorithms, and the ability to operate on composite vertices. The talk will also characterize the computational complexity, and thus the scalability, of this query language. Finally, the talk will preview the extension of the GQL approach to ontology-assisted graph querying.
There are no site access restrictions to the UCB Faculty Club.