A Configurable Framework for High-Performance Graph Storage and Mutation

In the realm of graph processing, efficient storage and update mechanisms are crucial due to the large volume of graphs and their dynamic nature. Traditional data structures such as adjacency lists and matrices, while effective in certain scenarios, often suffer from performance trade-offs such as h...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of advanced computer science & applications 2024-01, Vol.15 (8)
Hauptverfasser:	Firmli, Soukaina, Chiadmi, Dalila, Dahbi, Kawtar Younsi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Arrays Computer science Consumption Data management Data structures Graphs Mutation Parallel processing Synchronism Workloads
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!