Charles Explorer logo
🇨🇿

Effective Data Redistribution Based on User Queries in a Distributed Graph Database

Publikace na Matematicko-fyzikální fakulta |
2020

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

The problem of data distribution in NoSQL databases is par-ticularly difficult in the case of graph databases since the data oftenrepresent a large, highly connected graph. We face this task with mon-itoring of user queries, for which we created a logging module provid-ing information serving as an input to a redistribution algorithm whichbases on a lightweight method of Adaptive Partitioning but incorporatesour enhancements overcoming its present drawbacks (local optima, bal-ancing, edge weights).

The results of our experiments show 70% - 80%reduction of communication between cluster nodes which is a compara-ble result to other methods, which, however, are more computationallydemanding or suffer from other shortcomings.