{"title":"最大化大数据检索:块作为NoSQL优于SQL的值","authors":"A. Gidado, C. Ezeife","doi":"10.1109/ASONAM55673.2022.10068692","DOIUrl":null,"url":null,"abstract":"This paper presents NoSQL Over SQL Block as a Value Database (NOSD), a system that speeds up data retrieval time and availability in very large relational databases. NOSD proposes a Block as a Value model (BaaV). Unlike a relational database model where a relation is $R(K,\\ A_{1},\\ A_{2},\\ \\ldots A_{n})$, with a key attribute $K$ and a set of attributes of the relation: $A_{1}, A_{2}, \\ldots A_{n}$, BaaV represents a relation $R(K, r_{1}, r_{2}, \\ldots r_{n})$ with a key attribute $K$ and a set of $n$ relations called blocks. Each $r$ contains a set of its own attributes denoted as $r(k,\\ a_{1},\\ a_{2},\\ldots a_{n})$ with a key attribute $k$ and a set of $n$ attributes. The relations $r_{1}, r_{2}, \\ldots r_{n}$ in $R$ are related through foreign key relationships to a super relation $R$ with primary key $K$. The BaaV model is then denoted in a keyed block format $R\\{K,\\ B\\}$, where $K$ is a key to a block of values $B$ of partial relations implemented on NoSQL databases and replicating existing large relational database systems. As opposed to conventional systems such as Zidian, Google's Spanner, SparkSQL and Simple Buttom-Up (SBU) which implement SQL over NoSQL and replicate data into different nodes, NOSD implements NoSQL over SQL and uses Lucene functionality on NoSQL to enhance data retrieval costs. Experimenting with our proposed model, we demonstrated the performance of NOSD under the following conditions to prove its novelty (a) scan free queries, and (b) bounded queries on NoSQL databases. We showed that NOSD (a) performs excellently than ordinary relational databases (b) guarantees no scans for no scan queries (c) allows parallelization in query execution, and (d) can be deployed into existing SQL databases with guaranteed horizontal scalability, data retention and accurate autonomous data replication. Using existing benchmark systems, we demonstrated that NOSD outperforms existing SQL databases, SQL over NoSQL systems and is novel in ensuring that existing large SQL database systems utilize the functionalities of NoSQL databases without data loss. $A_{1}, A_{2}, \\ldots A_{n}$","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximizing Bigdata Retrieval: Block as a Value for NoSQL over SQL\",\"authors\":\"A. Gidado, C. Ezeife\",\"doi\":\"10.1109/ASONAM55673.2022.10068692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents NoSQL Over SQL Block as a Value Database (NOSD), a system that speeds up data retrieval time and availability in very large relational databases. NOSD proposes a Block as a Value model (BaaV). Unlike a relational database model where a relation is $R(K,\\\\ A_{1},\\\\ A_{2},\\\\ \\\\ldots A_{n})$, with a key attribute $K$ and a set of attributes of the relation: $A_{1}, A_{2}, \\\\ldots A_{n}$, BaaV represents a relation $R(K, r_{1}, r_{2}, \\\\ldots r_{n})$ with a key attribute $K$ and a set of $n$ relations called blocks. Each $r$ contains a set of its own attributes denoted as $r(k,\\\\ a_{1},\\\\ a_{2},\\\\ldots a_{n})$ with a key attribute $k$ and a set of $n$ attributes. The relations $r_{1}, r_{2}, \\\\ldots r_{n}$ in $R$ are related through foreign key relationships to a super relation $R$ with primary key $K$. The BaaV model is then denoted in a keyed block format $R\\\\{K,\\\\ B\\\\}$, where $K$ is a key to a block of values $B$ of partial relations implemented on NoSQL databases and replicating existing large relational database systems. As opposed to conventional systems such as Zidian, Google's Spanner, SparkSQL and Simple Buttom-Up (SBU) which implement SQL over NoSQL and replicate data into different nodes, NOSD implements NoSQL over SQL and uses Lucene functionality on NoSQL to enhance data retrieval costs. Experimenting with our proposed model, we demonstrated the performance of NOSD under the following conditions to prove its novelty (a) scan free queries, and (b) bounded queries on NoSQL databases. We showed that NOSD (a) performs excellently than ordinary relational databases (b) guarantees no scans for no scan queries (c) allows parallelization in query execution, and (d) can be deployed into existing SQL databases with guaranteed horizontal scalability, data retention and accurate autonomous data replication. Using existing benchmark systems, we demonstrated that NOSD outperforms existing SQL databases, SQL over NoSQL systems and is novel in ensuring that existing large SQL database systems utilize the functionalities of NoSQL databases without data loss. $A_{1}, A_{2}, \\\\ldots A_{n}$\",\"PeriodicalId\":423113,\"journal\":{\"name\":\"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASONAM55673.2022.10068692\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM55673.2022.10068692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了NoSQL Over SQL Block as a Value Database (NOSD)系统,该系统可以加快大型关系数据库的数据检索时间和可用性。NOSD提出了一个Block as a Value (BaaV)模型。与关系数据库模型不同的是,关系为$R(K,\ A_{1},\ A_{2},\ \ldots A_{n})$,具有键属性$K$和关系的一组属性:$A_{1}, A_{2},\ ldots A_{n}$, BaaV表示关系$R(K, r_{1}, r_{2}, \ldots r_{n})$,具有键属性$K$和一组称为块的$n$关系。每个$r$包含一组自己的属性,表示为$r(k,\ a_{1},\ a_{2},\ldots a_{n})$,具有一个键属性$k$和一组$n$属性。$R$中的关系$r_{1}, r_{2}, \ldots r_{n}$通过外键关系关联到具有主键$K$的超关系$R$。然后,BaaV模型以键块格式$R\{K,\ B\}$表示,其中$K$是在NoSQL数据库上实现并复制现有大型关系数据库系统的部分关系的值$B$块的键。与Zidian、b谷歌的Spanner、SparkSQL和Simple button - up (SBU)等传统系统不同,NOSD在NoSQL上实现了NoSQL,并在NoSQL上使用Lucene功能来提高数据检索成本。通过实验我们提出的模型,我们展示了NOSD在以下条件下的性能,以证明它的新颖性(a)扫描自由查询,以及(b) NoSQL数据库上的有界查询。我们表明NOSD (a)比普通的关系数据库执行得更好(b)保证对无扫描查询不进行扫描(c)允许查询执行中的并行化,并且(d)可以部署到现有的SQL数据库中,保证水平可伸缩性、数据保留和准确的自治数据复制。使用现有的基准系统,我们证明了NOSD优于现有的SQL数据库,SQL优于NoSQL系统,并且在确保现有的大型SQL数据库系统利用NoSQL数据库的功能而不丢失数据方面是新颖的。$A_{1}, A_{2}, \ldots A_{n}$
Maximizing Bigdata Retrieval: Block as a Value for NoSQL over SQL
This paper presents NoSQL Over SQL Block as a Value Database (NOSD), a system that speeds up data retrieval time and availability in very large relational databases. NOSD proposes a Block as a Value model (BaaV). Unlike a relational database model where a relation is $R(K,\ A_{1},\ A_{2},\ \ldots A_{n})$, with a key attribute $K$ and a set of attributes of the relation: $A_{1}, A_{2}, \ldots A_{n}$, BaaV represents a relation $R(K, r_{1}, r_{2}, \ldots r_{n})$ with a key attribute $K$ and a set of $n$ relations called blocks. Each $r$ contains a set of its own attributes denoted as $r(k,\ a_{1},\ a_{2},\ldots a_{n})$ with a key attribute $k$ and a set of $n$ attributes. The relations $r_{1}, r_{2}, \ldots r_{n}$ in $R$ are related through foreign key relationships to a super relation $R$ with primary key $K$. The BaaV model is then denoted in a keyed block format $R\{K,\ B\}$, where $K$ is a key to a block of values $B$ of partial relations implemented on NoSQL databases and replicating existing large relational database systems. As opposed to conventional systems such as Zidian, Google's Spanner, SparkSQL and Simple Buttom-Up (SBU) which implement SQL over NoSQL and replicate data into different nodes, NOSD implements NoSQL over SQL and uses Lucene functionality on NoSQL to enhance data retrieval costs. Experimenting with our proposed model, we demonstrated the performance of NOSD under the following conditions to prove its novelty (a) scan free queries, and (b) bounded queries on NoSQL databases. We showed that NOSD (a) performs excellently than ordinary relational databases (b) guarantees no scans for no scan queries (c) allows parallelization in query execution, and (d) can be deployed into existing SQL databases with guaranteed horizontal scalability, data retention and accurate autonomous data replication. Using existing benchmark systems, we demonstrated that NOSD outperforms existing SQL databases, SQL over NoSQL systems and is novel in ensuring that existing large SQL database systems utilize the functionalities of NoSQL databases without data loss. $A_{1}, A_{2}, \ldots A_{n}$