<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Selecting a graph database management system</dc:title><dc:creator>Brezac,	Nino	(Avtor)
	</dc:creator><dc:creator>Žitnik,	Slavko	(Mentor)
	</dc:creator><dc:subject>databases</dc:subject><dc:subject>graphs</dc:subject><dc:subject>graph analytics</dc:subject><dc:subject>graph algorithms</dc:subject><dc:subject>performance analysis</dc:subject><dc:subject>Cypher</dc:subject><dc:subject>Gremlin</dc:subject><dc:subject>Neo4j</dc:subject><dc:subject>Memgraph</dc:subject><dc:subject>TigerGraph</dc:subject><dc:description>Graph databases have emerged as an essential tool for managing highly interconnected data, outperforming traditional relational databases in specific use cases such as recommendation engines, social networks, and fraud detection. This work first introduces the concepts of a graph database, its taxonomy and specifics. Afterwards, it provides a comprehensive evaluation of the graph databases landscape, summarizing key features of a representative sample of graph databases and constructing a decision model to help with selecting a graph database. As a means of validation, a defined use-case of analytical LPG databases from the model was chosen for evaluation. The evaluation included experimental analysis on a standardized dataset, which highlighted key differences between the systems in terms of UI, UX, speed, memory consumption, and analytics. This study provides practical insights for database administrators and developers seeking to choose the right graph database solution for their specific needs.</dc:description><dc:date>2024</dc:date><dc:date>2024-09-26 14:15:01</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>162724</dc:identifier><dc:identifier>VisID: 37053</dc:identifier><dc:identifier>COBISS_ID: 210481667</dc:identifier><dc:language>sl</dc:language></metadata>
