The Laboratory carries out weekly global Seminar, where both classic and recent accomplishments in the area of programming languages and tools are discussed. The seminar is open to everyone – join the mailing list for announcements.
Attending the seminar is mandatory for Lab faculty and post-graduates, and highly recommended for all students. In the autumn semester of 2020, the seminar takes place on Mondays at 17:30, online in Google Meet.
2020СFPQ with all-path query semantics
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
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)
- About seminars
30 November 2020СFPQ with all-path query semantics
23 November 2020Efficient Fair Conjunction for Structurally-Recursive Relations
16 November 2020Source-Tracking Unification via Context-Free Path Querying
9 November 2020Relational Synthesis for Pattern Matching
2 November 2020Definitional Proof-Irrelevance without K