Context-free path queries (CFPQ) extend the regular path queries (RPQ) by allowing context-free grammars to be used as constraints for paths. Algorithms for CFPQ are actively developed, but J. Kuijpers et al. have recently concluded, that existing algorithms are not performant enough to be used in real-world applications. Thus the development of new algorithms for CFPQ is justified. In this paper, we provide a new CFPQ algorithm which is based on such linear algebra operations as Kronecker product and transitive closure and handles grammars presented as recursive state machines. Thus, the proposed algorithm can be implemented by using high-performance libraries and modern parallel hardware. Moreover, it avoids grammar growth which provides the possibility for queries optimization.

Original languageEnglish
Title of host publicationAdvances in Databases and Information Systems - 24th European Conference, ADBIS 2020, Proceedings
EditorsJérôme Darmont, Boris Novikov, Robert Wrembel
PublisherSpringer Nature
Number of pages11
ISBN (Print)9783030548315
StatePublished - Aug 2020
Event24th European Conference on Advances in Databases and Information Systems,ADBIS 2020 - Lyon, France
Duration: 25 Aug 202027 Aug 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12245 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th European Conference on Advances in Databases and Information Systems,ADBIS 2020

    Research areas

  • CFPQ, Context-free grammars, Context-free path querying, Graph database, Kronecker product, Recursive state machines

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 84890048