MACÁK, Martin, Matúš ŠTOVČIK and Barbora BÜHNOVÁ. The Suitability of Graph Databases for Big Data Analysis: A Benchmark. Online. In Proceedings of the 5th International Conference on Internet of Things, Big Data and Security - Volume 1: IoTBDS. Neuveden: SciTePress, 2020, p. 213-220. ISBN 978-989-758-426-8. Available from: https://dx.doi.org/10.5220/0009350902130220.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The Suitability of Graph Databases for Big Data Analysis: A Benchmark
Authors MACÁK, Martin (703 Slovakia, belonging to the institution), Matúš ŠTOVČIK (703 Slovakia, belonging to the institution) and Barbora BÜHNOVÁ (203 Czech Republic, belonging to the institution).
Edition Neuveden, Proceedings of the 5th International Conference on Internet of Things, Big Data and Security - Volume 1: IoTBDS, p. 213-220, 8 pp. 2020.
Publisher SciTePress
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Portugal
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
RIV identification code RIV/00216224:14610/20:00115477
Organization unit Institute of Computer Science
ISBN 978-989-758-426-8
Doi http://dx.doi.org/10.5220/0009350902130220
UT WoS 000615960700021
Keywords in English Big Data; Benchmark; Graph Database; Neo4j; PostgreSQL
Tags firank_B, rivok
Tags International impact, Reviewed
Changed by Changed by: RNDr. Martin Macák, Ph.D., učo 410452. Changed: 27/3/2021 15:55.
Abstract
Digitalization of our society brings various new digital ecosystems (e.g., Smart Cities, Smart Buildings, Smart Mobility), which rely on the collection, storage, and processing of Big Data. One of the recently popular advancements in Big Data storage and processing are the graph databases. A graph database is specialized to handle highly connected data, which can be, for instance, found in the cross-domain setting where various levels of data interconnection take place. Existing works suggest that for data with many relationships, the graph databases perform better than non-graph databases. However, it is not clear where are the borders for specific query types, for which it is still efficient to use a graph database. In this paper, we design and perform tests that examine these borders. We perform the tests in a cluster of three machines so that we explore the database behavior in Big Data scenarios concerning the query. We specifically work with Neo4j as a representative of graph databases and PostgreSQL as a representative of non-graph databases.
Links
EF16_013/0001802, research and development projectName: CERIT Scientific Cloud
LM2015085, research and development projectName: CERIT Scientific Cloud (Acronym: CERIT-SC)
Investor: Ministry of Education, Youth and Sports of the CR, CERIT Scientific Cloud
PrintDisplayed: 18/7/2024 12:31