Relaxed Parsing of Regular Approximations of String-Embedded Languages

Вербицкая, Е. В.; Grigorev, Semyon; Avdyukhin, Dmitry

doi:10.1007/978-3-319-41579-6_22

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, many CFPQ algorithms with various properties were proposed recently. They employ the ideas of different parsing algorithms, such as CYK in works by Hellings (2014) and Bradford (2017), (G)LR and (G)LL in works by Grigorev and Ragozina (2017), Medeiros et al (2018), Santos et al (2018), Verbitskaia et al (2016). Unfortunately, none of them has better than cubic time complexity in terms of the input graph size.…”

Section: Related Workmentioning

confidence: 99%

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

Shemetova,

Azimov,

Orachev

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The Kronecker product-based algorithm for context-free path querying (CFPQ) was proposed by Orachev et al. (2020). We reduce this algorithm to operations over Boolean matrices and extend it with the mechanism to extract all paths of interest. We also prove O(n 3 / log n) time complexity of the proposed algorithm, where n is a number of vertices of the input graph. Thus, we provide the alternative way to construct a slightly subcubic algorithm for CFPQ which is based on linear algebra and incremental transitive closure (a classic graph-theoretic problem), as opposed to the algorithm with the same

show abstract

Section: Related Workmentioning

confidence: 99%

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

Shemetova,

Azimov,

Orachev

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, to check a syntactic correctness of dynamically generated strings, one should check that all generated strings (all paths from start states to final states in the given automaton) are correct with respect to the given context-free grammar. There are solutions to this problem: GLR-based checker of stringembedded SQL queries [3,7], parser of string-embedded languages [21] based on RNGLR parsing algorithm. RNGLRbased algorithm allows to construct derivation forest (i.e.…”

Section: Introductionmentioning

confidence: 99%

Context-free path querying with structural representation of result

Grigorev

Ragozina

2017

Proceedings of the 13th Central &Amp; Eastern European Software Engineering Conference in Russia

Self Cite

View full text Add to dashboard Cite

Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars. The query in this approach is written as grammar, and paths querying is graph parsing with respect to given grammar. There are several solutions to it, but how to provide structural representation of query result which is practical for answer processing and debugging is still an open problem. In this paper we propose a graph parsing technique which allows one to build such representation with respect to given grammar in polynomial time and space for arbitrary context-free grammar and graph. Proposed algorithm is based on generalized LL parsing algorithm, while previous solutions are based mostly on CYK or Earley algorithms, which reduces time complexity in some cases

show abstract

Detection of SQL Injection Vulnerability in Embedded SQL

Jang

2020

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Relaxed Parsing of Regular Approximations of String-Embedded Languages

Cited by 3 publications

References 9 publications

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

Context-free path querying with structural representation of result

Detection of SQL Injection Vulnerability in Embedded SQL

Contact Info

Product

Resources

About