UniqueNOSD: a novel framework for NoSQL over SQL databases
Uloženo v:
| Vydáno v: | Journal of Big Data vol. 12, no. 1 (Nov 2025), p. 255 |
|---|---|
| Hlavní autor: | |
| Další autoři: | |
| Vydáno: |
Springer Nature B.V.
|
| Témata: | |
| On-line přístup: | Citation/Abstract Full Text Full Text - PDF |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3272753641 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2196-1115 | ||
| 024 | 7 | |a 10.1186/s40537-025-01307-2 |2 doi | |
| 035 | |a 3272753641 | ||
| 045 | 2 | |b d20251101 |b d20251130 | |
| 100 | 1 | |a Gidado, Abdulrauf A. |u University of Windsor, School of Computer Science, Windsor, Canada (GRID:grid.267455.7) (ISNI:0000 0004 1936 9596) | |
| 245 | 1 | |a UniqueNOSD: a novel framework for NoSQL over SQL databases | |
| 260 | |b Springer Nature B.V. |c Nov 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a To date, most large corporations still have their core solutions on relational databases but only use non-relational (i.e. NoSQL) database management systems (DBMS) for their non-core systems that favour availability and scalability through partitioning while trading off consistency. NoSQL systems are built based on the CAP (i.e., Consistency, Availability and Partitioning) database theorem, which trades off one of these features while maintaining the others. The need for systems availability and scalability drives the use of NoSQL, while the lack of consistency and robust query engines as obtainable in relational databases, impede their usage. To mitigate these drawbacks, researchers and companies like Amazon, Google, and Facebook run ’SQL over NoSQL’ systems such as Dynamo, Google’s Spanner, Memcache, Zidian, Apache Hive and SparkSQL. These systems create a query engine layer over NoSQL systems but suffer from data redundancy and lack consistency obtainable in relational DBMS. Also, their query engine is not relational complete because they cannot process all relational algebra-based queries as obtainable in a relational database. In this paper, we present a ’Unique NoSQL over SQL Database’ (UniqueNOSD) system, an extension of NOSD and an inverse of existing approaches. This approach is motivated by the need for existing systems to fully deploy NoSQL data store functionalities without the limitation of building an extra SQL layer for querying. To allow appropriate storage and retrieval of data on document-based NoSQL databases without data redundancy and inconsistency while encouraging both horizontal and vertical partitioning, we propose NoSQL over SQL Block as a Value (<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq1.gif" />) data storage strategy. Unlike relational database model where a relation is represented as <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq2.gif" />, with a key attribute <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq3.gif" /> and <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq4.gif" /> is the primary key to the set of attributes <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq5.gif" /> of the relation, in <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq1.gif" /> (represented as a tuple (K, B) where K means key and B means block). We represent a relation as <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq7.gif" /> with a key attribute K and a set of n relations (i.e., r) called blocks B and each r<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq8.gif" /> contains a set of its own attributes and is denoted as <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq9.gif" /> with a key attribute k and a set of n attributes typical to a relational model. The relations <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq10.gif" /> in R of <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="40537_2025_1307_Article_IEq1.gif" /> are related through foreign key relationships. Using existing benchmark systems of ’SQL over NoSQL’, relational databases and real-life datasets for our experiments, we demonstrated that our NoSQL over SQL system outperforms existing relational databases, SQL over NoSQL systems and is novel in ensuring data consistency, scalability, query execution and improving data storage and retrieval in large database systems without data loss and enhancing improved performance on NoSQL database. | |
| 653 | |a Data base management systems | ||
| 653 | |a Redundancy | ||
| 653 | |a Databases | ||
| 653 | |a Experiments | ||
| 653 | |a Relational algebra | ||
| 653 | |a Social networks | ||
| 653 | |a Retrieval | ||
| 653 | |a Relational data bases | ||
| 653 | |a Availability | ||
| 653 | |a Data retrieval | ||
| 653 | |a Partitioning | ||
| 653 | |a Query languages | ||
| 653 | |a Storage | ||
| 653 | |a Big Data | ||
| 653 | |a Graphs | ||
| 653 | |a Data loss | ||
| 653 | |a Inconsistency | ||
| 653 | |a Algebra | ||
| 653 | |a Design | ||
| 653 | |a Attributes | ||
| 653 | |a Data storage | ||
| 653 | |a Queries | ||
| 700 | 1 | |a Ezeife, C. I. |u University of Windsor, School of Computer Science, Windsor, Canada (GRID:grid.267455.7) (ISNI:0000 0004 1936 9596) | |
| 773 | 0 | |t Journal of Big Data |g vol. 12, no. 1 (Nov 2025), p. 255 | |
| 786 | 0 | |d ProQuest |t ABI/INFORM Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3272753641/abstract/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3272753641/fulltext/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3272753641/fulltextPDF/embedded/H09TXR3UUZB2ISDL?source=fedsrch |