Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 690975

A shortest path algorithm performance comparison in graph and relational database on a transportation network


Miler, Mario; Medak, Damir; Odobašić, Dražen
A shortest path algorithm performance comparison in graph and relational database on a transportation network // Promet (Zagreb), 26 (2014), 75-82 doi:10.7307/ptt.v26i1.1268 (međunarodna recenzija, članak, znanstveni)


CROSBI ID: 690975 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
A shortest path algorithm performance comparison in graph and relational database on a transportation network

Autori
Miler, Mario ; Medak, Damir ; Odobašić, Dražen

Izvornik
Promet (Zagreb) (0353-5320) 26 (2014); 75-82

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
pgRouting; OpenStreetMap; Dijkstra; benchmark; Neo4j; PostgreSQL

Sažetak
In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting) and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

Izvorni jezik
Engleski

Znanstvena područja
Geodezija



POVEZANOST RADA


Projekti:
007-0072974-1599 - Geoinformatika i geomatičko inženjerstvo u zaštiti okoliša

Ustanove:
Geodetski fakultet, Zagreb

Profili:

Avatar Url Mario Miler (autor)

Avatar Url Dražen Odobašić (autor)

Poveznice na cjeloviti tekst rada:

Pristup cjelovitom tekstu rada doi www.fpz.unizg.hr

Citiraj ovu publikaciju:

Miler, Mario; Medak, Damir; Odobašić, Dražen
A shortest path algorithm performance comparison in graph and relational database on a transportation network // Promet (Zagreb), 26 (2014), 75-82 doi:10.7307/ptt.v26i1.1268 (međunarodna recenzija, članak, znanstveni)
Miler, M., Medak, D. & Odobašić, D. (2014) A shortest path algorithm performance comparison in graph and relational database on a transportation network. Promet (Zagreb), 26, 75-82 doi:10.7307/ptt.v26i1.1268.
@article{article, author = {Miler, Mario and Medak, Damir and Odoba\v{s}i\'{c}, Dra\v{z}en}, year = {2014}, pages = {75-82}, DOI = {10.7307/ptt.v26i1.1268}, keywords = {pgRouting, OpenStreetMap, Dijkstra, benchmark, Neo4j, PostgreSQL}, journal = {Promet (Zagreb)}, doi = {10.7307/ptt.v26i1.1268}, volume = {26}, issn = {0353-5320}, title = {A shortest path algorithm performance comparison in graph and relational database on a transportation network}, keyword = {pgRouting, OpenStreetMap, Dijkstra, benchmark, Neo4j, PostgreSQL} }
@article{article, author = {Miler, Mario and Medak, Damir and Odoba\v{s}i\'{c}, Dra\v{z}en}, year = {2014}, pages = {75-82}, DOI = {10.7307/ptt.v26i1.1268}, keywords = {pgRouting, OpenStreetMap, Dijkstra, benchmark, Neo4j, PostgreSQL}, journal = {Promet (Zagreb)}, doi = {10.7307/ptt.v26i1.1268}, volume = {26}, issn = {0353-5320}, title = {A shortest path algorithm performance comparison in graph and relational database on a transportation network}, keyword = {pgRouting, OpenStreetMap, Dijkstra, benchmark, Neo4j, PostgreSQL} }

Časopis indeksira:


  • Web of Science Core Collection (WoSCC)
    • SCI-EXP, SSCI i/ili A&HCI


Uključenost u ostale bibliografske baze podataka::


  • Fluidex (Fluid Engineering Abstracts)
  • Geobase
  • TRID, Scopus


Citati:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font