Context-Free Path Querying with Structural Representation of Result
October 21, 16:10
Graph data model and graph databases are popular in such areas as bioinformatics, semantic web, and social networks. Language-constrained path querying is one of graph analysis tasks. The most popular tools provide mechanisms for regular constraints specification. But it is not enough in some cases. We present an algorithm for context-free path querying with structural representation of result.
Researcher at Programming Languages and Tools lab at the Saint-Petersburg State University.