How to evaluate NoSQL Database Paradigms for Knowledge Graph Processing
Abstract
Knowledge Graph (KG) processing faces critical infrastructure challenges in selecting optimal NoSQL database paradigms, as traditional performance evaluations rely on static benchmarks that fail to capture the complexity of real-world KG workloads. Although the big data field offers numerous comparative studies, in the KG context DBMS selection remains predominantly ad-hoc, leaving practitioners without systematic guidance for matching storage technologies to specific KG characteristics and query requirements. This paper presents a KG-specific benchmarking framework that employs connectivity density, scale, and introduces a graph-centric metric, namely Semantic Richness (SR), within a four-tier query methodology to reveal performance crossover points across Document-Oriented, Graph, and Multi-Model DBMSs. We conduct an empirical evaluation on the FAERS adverse event KG at three scales, comparing paradigms from simple filtering to deep traversal, and provide metric-driven, evidence-based guidelines for aligning NoSQL paradigm selection with graph size, connectivity, and semantic richness.
Keywords
Cite
@article{arxiv.2602.07612,
title = {How to evaluate NoSQL Database Paradigms for Knowledge Graph Processing},
author = {Rosario Napoli and Antonio Celesti and Massimo Villari and Maria Fazio},
journal= {arXiv preprint arXiv:2602.07612},
year = {2026}
}
Comments
Accepted at the IEEE/ACM 12th International Conference on Big Data Computing, Applications and Technologies (BDCAT 2025)