Performance Evaluations of Graph Database using CUDA and OpenMP Compatible Libraries

@article{Morishima2014PerformanceEO,
  title={Performance Evaluations of Graph Database using CUDA and OpenMP Compatible Libraries},
  author={Shin Morishima and Hiroki Matsutani},
  journal={SIGARCH Computer Architecture News},
  year={2014},
  volume={42},
  pages={75-80}
}
Graph databases use graph structures to store data sets as nodes, edges, and properties. They are used to store and search the relationships between a large number of nodes, such as social networking services and recommendation engines that use customer social graphs. Since computation cost for graph search queries increases as the graph becomes large, in this pa- per we accelerate the graph search functions (Dijkstra and A* algorithms) of a graph database Neo4j using two ways: multi- threaded… CONTINUE READING

Similar Papers

Loading similar papers…