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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:E3S web of conferences Jg. 164; S. 10016
Hauptverfasser: Urubkin, Mikhail, Galushka, Vasiliy, Fathi, Vladimir, Fathi, Denis, Petrenkova, Sofya
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Les Ulis EDP Sciences 01.01.2020
Schlagworte:
Algorithms
Data base management systems
Data processing
Dijkstra's algorithm
Query languages
Relational algebra
ISSN:2267-1242, 2555-0403, 2267-1242
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 the known information system architectures and the impact of various ways of distributing functions between system components are reviewed. The article describes features of the relational algebra and the Transact-SQL operations, and provides a brief description of Dijkstra’s algorithm. For its programmatic implementation, several stages are defined, for each of which a formal description of the relational operations performed on it is given. The outputs of these operations are shown using the example of the database tables, and the algorithm to find the final path is given. The issues of the proposed method’s productivity and security of programmatic implementation of the path search in a graph are discussed separately.
Bibliographie:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:2267-1242
2555-0403
2267-1242
DOI:10.1051/e3sconf/202016410016