Corpus ID: 125937975

Graph Parsing by Matrix Multiplication

  title={Graph Parsing by Matrix Multiplication},
  author={Rustam Azimov and S. Grigorev},
Graph data model is widely used in many areas, for example, bioinformatics, graph databases, RDF. One of the most common graph queries are navigational queries. The result of query evaluation are implicit relations between nodes of the graph, i.e. paths in the graph. A natural way to specify these relations is by specifying paths using formal grammars over edge labels. The answer to the context-free path queries in this approach is usually a set of triples (A, m, n) such that there is a path… Expand
An Algorithm for Context-Free Path Queries over Graph Databases
LL-based query answering over RDF databases
Efficient evaluation of context-free path queries for graph databases
An Experimental Study of Context-Free Path Query Evaluation Methods
Avaliação top-down de consultas de caminhos livres-decontexto em grafos


Context-free path querying with structural representation of result
Context-Free Path Queries on RDF Graphs
Finding Regular Simple Paths in Graph Databases
Graph-theoretic methods in database theory
Conjunctive Context-Free Path Queries
Parsing by matrix multiplication generalized to Boolean grammars
  • A. Okhotin
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2014
Recognition and Parsing of Context-Free Languages in Time n^3
An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages
Programming GPGPU Graph Applications with Linear Algebra Building Blocks