Back to search

Institutional Repository of Vilnius University

Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /

Abstract

dc:description

This paper theoretically and empirically analyses graph database sharding methods, comparing predicate sharding in Dgraph and hash sharding in ArangoDB. An experimental environment was deployed on Google Cloud Platform using five-node clusters for each database, populated with a synthetic social network dataset. Load testing was conducted across four scenarios covering simple and complex read and write queries under low, medium, and high load conditions. Stress testing was also performed to determine maximum throughput and system reliability. The results show that predicate sharding achieves higher throughput and lower read latency for complex graph traversal queries due to reduced cross-node communication, while hash sharding provides more even load distribution across nodes. Based on these findings, recommendations are provided for effective sharding of graph databases.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Bražėnas, Arminas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Bražėnas, Arminas,. Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /. Institutional Repository of Vilnius University, 2026. https://repository.vu.lt/VU:ELABAETD308332461&prefLang=en_US