Talks

Context-Free Path Querying with Structural Representation of Result

Data Science. Big DataProgramming Tools

October 21, 16:10
Room III

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.

Semyon Grigorev

Researcher, JetBrains

Researcher at Programming Languages and Tools lab at the Saint-Petersburg State University.

Sponsors & Partners

Sponsors

Gold

JetBrains

First Line Software

Silver

Dell EMC

DINS

Veeam Software

Embedded

Auriga

Sponsors

I.T. Group

United Frontal System Program

Individual

Andrey Terekhov

Partners

Main partners

AP KIT

RUSSOFT

In cooperation

Association for Computing Machinery

ACM Special Interest Group on Software Engineering

Technical partners

CUSTIS

SoftInvent

7pap Studio

Group M

Prezent

Print Salon

DPI.Solutions

With support of

RAEC

Organizers

Software Russia

i-Help