Investigation into applicability and efficiency of SQLite for implementation of Dijkstra's algorithm

The work presents the results of comparison of tools for implementing an algorithm for calculation of the shortest path in a graph in mobile applications. We've revealed the amount of nodes starting from which Dijkstra's algorithm implementation in Java fails or at best becomes inferior to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM) s. 282 - 284
Hlavní autoři: Yurchak, Iryna, Dudas, Volodymyr
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2017
Témata:
Algorithm design and analysis
Dijkstra's algorithm SQLite implementation
graph algorithms
Java
Mobile applications
Roads
Software algorithms
Urban areas
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The work presents the results of comparison of tools for implementing an algorithm for calculation of the shortest path in a graph in mobile applications. We've revealed the amount of nodes starting from which Dijkstra's algorithm implementation in Java fails or at best becomes inferior to SQL implementation of the same algorithm. The results of the performed investigations come in useful for managers of mobile applications projects when taking decision on the architecture of the application being developed under assumption that the application assumes seeking for the best route and the amount of nodes in a graph representing road network is known in advance.
DOI:10.1109/CADSM.2017.7916135