Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra
The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of the Transact-SQL language. The efficiency of th...
Main Authors: | Urubkin Mikhail, Galushka Vasiliy, Fathi Vladimir, Fathi Denis, Petrenkova Sofya |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2020-01-01
|
Series: | E3S Web of Conferences |
Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2020/24/e3sconf_tpacee2020_10016.pdf |
Similar Items
-
Representation of graphs for storing in relational databases
by: Urubkin Mikhail, et al.
Published: (2020-01-01) -
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
by: Elizabeth Nurmiyati Tamatjita, et al.
Published: (2016-09-01) -
Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
by: Nurwan Nurwan, et al.
Published: (2021-05-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01)