Concurrent Access Performance Comparison Between Relational Databases and Graph NoSQL Databases for Complex Algorithms

Databases are a fundamental element of contemporary software applications. The most widely used and recognized type in practice is the relational database, valued for its ability to store and organize data in tabular structures, its emphasis on data consistency and integrity, and its use of a standardized query language, SQL. However, with the rapid increase in both the volume and complexity of data, relational databases have recently encountered challenges in effectively modeling this expanding information. To address performance challenges, new database systems have emerged, offering alternative approaches to data modeling—these are known as NoSQL databases. In this paper, we present an indoor navigation application designed to operate on both a relational database, Microsoft SQL Server, and a graph-based NoSQL database, Neo4j. We describe the algorithms implemented for testing and the performance metrics analyzed to draw our conclusions. The results revealed Neo4j’s strength in managing data with complex relationships but also exposed its limitations in handling concurrent access, where SQL Server demonstrated significantly greater stability.