Matches in SemOpenAlex for { <https://semopenalex.org/work/W4366992749> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W4366992749 endingPage "278" @default.
- W4366992749 startingPage "271" @default.
- W4366992749 abstract "Many graph analysis problems can be formulated as formal language-constrained path querying problems where the formal languages are used as constraints for navigational path queries. Recently, the context-free language (CFL) reachability formulation has become very popular and can be used in many areas, for example, querying graph databases, Resource Description Framework (RDF) analysis. However, the generative capacity of context-free grammars (CFGs) is too weak to generate some complex queries, for example, from natural languages, and the various extensions of CFGs have been proposed. Multiple context-free grammar (MCFG) is one of such extensions of CFGs. Despite the fact that, to the best of our knowledge, there is no algorithm for MCFL-reachability, this problem is known to be decidable. This paper is devoted to developing the first such algorithm for the MCFL-reachability problem. The essence of the proposed algorithm is to use a set of Boolean matrices and operations on them to find paths in a graph that satisfy the given constraints. The main operation here is Boolean matrix multiplication. As a result, the algorithm returns a set of matrices containing all information needed to solve the MCFL-reachability problem. The presented algorithm is implemented in Python using GraphBLAS API. An analysis of real RDF data and synthetic graphs for some MCFLs is performed. The study showed that using a sparse format for matrix storage and parallel computing for graphs with tens of thousands of edges the analysis time can be 10–20 minutes. The result of the analysis provides tens of millions of reachable vertex pairs. The proposed algorithm can be applied in problems of static code analysis, bioinformatics, network analysis, as well as in graph databases when a path query cannot be expressed using context-free grammars. The provided algorithm is linear algebra-based, hence, it allows one to use high-performance libraries and utilize modern parallel hardware." @default.
- W4366992749 created "2023-04-27" @default.
- W4366992749 creator A5032639966 @default.
- W4366992749 creator A5041304129 @default.
- W4366992749 creator A5054738334 @default.
- W4366992749 date "2023-04-01" @default.
- W4366992749 modified "2023-10-18" @default.
- W4366992749 title "Multiple context-free path querying by matrix multiplication" @default.
- W4366992749 doi "https://doi.org/10.17586/2226-1494-2023-23-2-271-278" @default.
- W4366992749 hasPublicationYear "2023" @default.
- W4366992749 type Work @default.
- W4366992749 citedByCount "0" @default.
- W4366992749 crossrefType "journal-article" @default.
- W4366992749 hasAuthorship W4366992749A5032639966 @default.
- W4366992749 hasAuthorship W4366992749A5041304129 @default.
- W4366992749 hasAuthorship W4366992749A5054738334 @default.
- W4366992749 hasBestOaLocation W43669927491 @default.
- W4366992749 hasConcept C121332964 @default.
- W4366992749 hasConcept C136643341 @default.
- W4366992749 hasConcept C153269930 @default.
- W4366992749 hasConcept C17349429 @default.
- W4366992749 hasConcept C186644900 @default.
- W4366992749 hasConcept C199360897 @default.
- W4366992749 hasConcept C41008148 @default.
- W4366992749 hasConcept C62520636 @default.
- W4366992749 hasConcept C80444323 @default.
- W4366992749 hasConcept C84114770 @default.
- W4366992749 hasConcept C97212296 @default.
- W4366992749 hasConceptScore W4366992749C121332964 @default.
- W4366992749 hasConceptScore W4366992749C136643341 @default.
- W4366992749 hasConceptScore W4366992749C153269930 @default.
- W4366992749 hasConceptScore W4366992749C17349429 @default.
- W4366992749 hasConceptScore W4366992749C186644900 @default.
- W4366992749 hasConceptScore W4366992749C199360897 @default.
- W4366992749 hasConceptScore W4366992749C41008148 @default.
- W4366992749 hasConceptScore W4366992749C62520636 @default.
- W4366992749 hasConceptScore W4366992749C80444323 @default.
- W4366992749 hasConceptScore W4366992749C84114770 @default.
- W4366992749 hasConceptScore W4366992749C97212296 @default.
- W4366992749 hasIssue "2" @default.
- W4366992749 hasLocation W43669927491 @default.
- W4366992749 hasOpenAccess W4366992749 @default.
- W4366992749 hasPrimaryLocation W43669927491 @default.
- W4366992749 hasRelatedWork W1594689556 @default.
- W4366992749 hasRelatedWork W2761734916 @default.
- W4366992749 hasRelatedWork W2951691249 @default.
- W4366992749 hasRelatedWork W2961758588 @default.
- W4366992749 hasRelatedWork W3112584456 @default.
- W4366992749 hasRelatedWork W374648105 @default.
- W4366992749 hasRelatedWork W4253760428 @default.
- W4366992749 hasRelatedWork W4288287018 @default.
- W4366992749 hasRelatedWork W4300163689 @default.
- W4366992749 hasRelatedWork W89384568 @default.
- W4366992749 hasVolume "23" @default.
- W4366992749 isParatext "false" @default.
- W4366992749 isRetracted "false" @default.
- W4366992749 workType "article" @default.