On the public citation graph
Shortest Path Computing in Relational DBMSs
0 signed · 50 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/11731139_75openalex-snapshot
Data Mining Using Relational Database Management Systems
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferredcites →https://doi.org/10.1007/978-3-642-13672-6_16openalex-snapshot
A Framework for SQL-Based Mining of Large Graphs on Relational Databases
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/b978-155860869-6/50079-2openalex-snapshot
DTD-Directed Publishing with Attribute Translation Grammars
inferredcites →https://doi.org/10.1016/s0166-218x(02)00217-2openalex-snapshot
An external memory data structure for shortest path queries
inferredcites →https://doi.org/10.1109/icde.2009.172openalex-snapshot
SoQL: A Language for Querying and Creating Data in Social Networks
inferredcites →https://doi.org/10.1145/1007568.1007623openalex-snapshot
Implementing a scalable XML publish/subscribe system using relational database systems
inferredcites →https://doi.org/10.1145/1014052.1014088openalex-snapshot
Scalable mining of large disk-based graph databases
inferredcites →https://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1645953.1646063openalex-snapshot
Fast shortest path distance estimation in large networks
inferredcites →https://doi.org/10.1145/1807167.1807217openalex-snapshot
Finding maximal cliques in massive networks by H*-graph
inferredcites →https://doi.org/10.1145/191839.191928openalex-snapshot
A performance study of transitive closure algorithms
inferredcites →https://doi.org/10.1145/1989323.1989425openalex-snapshot
Fast personalized PageRank on MapReduce
inferredcites →https://doi.org/10.14778/2095686.2095694openalex-snapshot
Relational approach for shortest path discovery over large graphs
inferredcites →https://doi.org/10.2307/j.ctv346t9copenalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
inferredcites →https://doi.org/10.5555/545381.545503openalex-snapshot
Reachability and distance queries via 2-hop labels
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-57796-4_9openalex-snapshot
PageRank for Billion-Scale Networks in RDBMS
inferred← citeshttps://doi.org/10.1007/978-981-13-9341-9_12openalex-snapshot
Parallel Bidirectional Shortest Path Computation in Graphs Using Relational Database Management Systems (RDBMSs)
inferred← citeshttps://doi.org/10.1007/s10100-016-0436-9openalex-snapshot
Management science in the era of smart consumer products: challenges and research perspectives
inferred← citeshttps://doi.org/10.1007/s10489-019-01479-4openalex-snapshot
EM-FGS: Graph sparsification via faster semi-metric edges pruning
inferred← citeshttps://doi.org/10.1007/s13278-017-0457-yopenalex-snapshot
Incremental maintenance of all-pairs shortest paths in relational DBMSs
inferred← citeshttps://doi.org/10.1007/s41019-019-00110-3openalex-snapshot
Which Category Is Better: Benchmarking Relational and Graph Database Management Systems
inferred← citeshttps://doi.org/10.1016/j.ins.2016.12.013openalex-snapshot
Disk-based shortest path discovery using distance index over large dynamic graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.111openalex-snapshot
Efficient single-pair all-shortest-path query processing for massive dynamic networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.011openalex-snapshot
Computing source-to-target shortest paths for complex networks in RDBMS
inferred← citeshttps://doi.org/10.1109/asonam.2016.7752238openalex-snapshot
All-pairs shortest distances maintenance in relational DBMSs
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.11openalex-snapshot
CORE Analysis for Efficient Shortest Path Traversal Queries in Social Graphs
inferred← citeshttps://doi.org/10.1109/iccic.2014.7238549openalex-snapshot
Review on keyword searching techniques in uncertain graph data
inferred← citeshttps://doi.org/10.1109/seeda-cecnsm53056.2021.9566235openalex-snapshot
A comparative evaluation of RDBMS and GDBMS for shortest path operations on pedestrian navigation data
inferred← citeshttps://doi.org/10.1109/tkde.2017.2772233openalex-snapshot
Efficient Maintenance of Shortest Distances in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/2949689.2949713openalex-snapshot
Efficient Maintenance of All-Pairs Shortest Distances
inferred← citeshttps://doi.org/10.1145/3341105.3375770openalex-snapshot
Enhancing recursive graph querying on RDBMS with data clustering approaches
inferred← citeshttps://doi.org/10.11606/t.55.2021.tde-26052021-125443openalex-snapshot
Storage and Navigation Operations on Graphs in Relational DBMS
inferred← citeshttps://doi.org/10.12988/ces.2014.4696openalex-snapshot
Shortest path analysis for efficient traversal queries in large networks
inferred← citeshttps://doi.org/10.15680/ijircce.2015.0304006openalex-snapshot
An Approach for Keyword Searching inUncertain Graph Data
inferred← citeshttps://doi.org/10.17586/2226-1494-2016-16-1-122-132openalex-snapshot
Synthesis of the secondary structure of algebraic Bayesian networks: an incremental algorithm and statistical estimation of its complexity
inferred← citeshttps://doi.org/10.33039/ami.2021.07.001openalex-snapshot
Route planning on GTFS using Neo4j
inferred← citeshttps://doi.org/10.3390/ijgi8120550openalex-snapshot
Optimization of Shortest-Path Search on RDBMS-Based Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1412.7760openalex-snapshot
Shortest Path Analysis in Social Graphs
inferred← citeshttps://doi.org/10.5121/ijdms.2015.7403openalex-snapshot
Shortest Path Estimation for Graph Data Using a Relational Technique
inferred← citeshttps://doi.org/10.5753/jidm.2018.1634openalex-snapshot
Cutting-edge relational graph data management with Edge-k: From one to multiple edges in the same row
inferred← citeshttps://doi.org/10.5753/sbbd.2017.171357openalex-snapshot
Relational graph data management on the edge: Grouping vertices’ neighborhood with Edge-k
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.