{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308332461"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308332461","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Bražėnas, Arminas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:52Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308332461&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308332461&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308332461","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Bražėnas, Arminas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308332461/308332461.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308332461&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /","Performance impact of graph database sharding: comparison of hash and predicate sharding."]}]}],"canonical_facts":{"dc:creator":["Bražėnas, Arminas,"],"dc:date":["2026"],"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."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308332461&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308332461/308332461.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /","Performance impact of graph database sharding: comparison of hash and predicate sharding."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:52Z"}