Computing source-to-target shortest paths for complex networks in RDBMS
type: Item
instance of: scholarly article
title: Computing source-to-target shortest paths for complex networks in RDBMS
zbMATH Open document ID: 1372.68197
author: Aly Ahmed
author: Alex Thomo
published in: Journal of Computer and System Sciences
publication date: 2017-09-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 6770483
zbMATH Keywords: big graphs
zbMATH Keywords: relational databases
zbMATH Keywords: SQL
zbMATH Keywords: shortest paths algorithms
describes a project that uses: Pregel
describes a project that uses: Graphs
describes a project that uses: GraphChi
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jcss.2016.09.011
OpenAlex ID: W2531121659
cites work: A note on two problems in connexion with graphs
cites work: Computing the shortest path: \(A^\ast\) search meets graph theory
cites work: Combining speed-up techniques for shortest-path computations
cites work: \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
cites work: Introduction to Information Retrieval
cites work: Shortest-path queries in static networks
DOI: 10.1016/J.JCSS.2016.09.011
Recommended article: A single-source shortest path algorithm for dynamic graphs
Recommended article: An all pairs shortest path algorithm for dynamic graphs
Recommended article: An RDBMS-based graph computing platform
Recommended article: A shortest path approximation algorithm for complex network analysis
Recommended article: Investigations on Path Indexing for Graph Databases
description: scientific article; zbMATH DE number 6770483