Performance of Graph and Relational Databases in Complex Queries
In developing NoSQL databases, a major motivation is to achieve better efficient query performance compared with relational databases. The graph database is a NoSQL paradigm where navigation is based on links instead of joining tables. Links can be implemented as pointers, and following a pointer is...
Main Authors: | Petri Kotiranta, Marko Junkkari, Jyrki Nummenmaa |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-06-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/12/13/6490 |
Similar Items
-
HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases
by: Merve Asiler, et al.
Published: (2022-04-01) -
NewSQL Databases Assessment: CockroachDB, MariaDB Xpand, and VoltDB
by: Eduardo Pina, et al.
Published: (2022-12-01) -
DATABASE AND BIGDATA PROCESSING SYSTEM FOR ANALYSIS OF AIS MESSAGES IN THE NETBALTIC RESEARCH PROJECT
by: MICHAŁ LEWCZUK, et al.
Published: (2017-10-01) -
A new approach to perform fuzzy queries over NoSQL database databases
by: Zahra Ahmadi, et al.
Published: (2020-03-01) -
Query execution time estimation in graph databases based on graph neural networks
by: Zhenzhen He, et al.
Published: (2024-04-01)