At the seminar, we will talk about a matrix algorithm for context-free path querying with all-path semantics, which requires returning all the paths found that match the query. The implementation of this algorithm uses SuiteSparse implementation of the GraphBLAS standard that defines standard building blocks for graph algorithms in the language of linear algebra. We will compare the resulting implementation with the tensor algorithm implementation for all-path semantics.

Speaker: Rustam Azimov

References:

1 Terekhov A. et al. Context-Free Path Querying with Single-Path Semantics by Matrix Multiplication //Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA). – 2020. – С. 1-12.

2) Orachev E. et al. Context-Free Path Querying by Kronecker Product //European Conference on Advances in Databases and Information Systems. – Springer, Cham, 2020. – С. 49-59.

The seminar will be held in google meet on Monday, November 30, at 17:30 (google meet room: https://meet.google.com/myu-dhmz-gvu)