RECORD
Storing Multi-model Data in RDBMSs based on Reinforcement Learning
Databases · Submitted 1 Sep 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Experimental results show that our approach could learn a relational schema outperforming the existing multi-model storage schema in terms of query time and space consumption.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
How to manage various data in a unified way is a significant research topic in the field of databases. To address this problem, researchers have proposed multi-model databases to support multiple data models in a uniform platform with a single unified query language. However, since relational databases are predominant in the current market, it is expensive to replace them with others. Besides, due to the theories and technologies of RDBMSs having been enhanced over decades, it is hard to use few years to develop a multi-model database that can be compared with existing RDBMSs in handling security, query optimization, transaction management, etc. In this paper, we reconsider employing relational databases to store and query multi-model data. Unfortunately, the mismatch between the complexity of multi-model data structure and the simplicity of flat relational tables makes this difficult. Against this challenge, we utilize the reinforcement learning (RL) method to learn a relational schema by interacting with an RDBMS. Instead of using the classic Q-learning algorithm, we propose a variant Q-learning algorithm, called \textit{Double Q-tables}, to reduce the dimension of the original Q-table and improve learning efficiency. Experimental results show that our approach could learn a relational schema outperforming the existing multi-model storage schema in terms of query time and space consumption.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | How to manage various data in a unified way is a significant research topic in the field of databases. | background 1.00 | 0.03 | 0.02 | asserted 1.00 |
| s1 | To address this problem, researchers have proposed multi-model databases to support multiple data models in a uniform platform with a single unified query language. | background 1.00 | 0.04 | 0.02 | asserted 1.00 |
| s2 | However, since relational databases are predominant in the current market, it is expensive to replace them with others. | background 0.97 | 0.04 | 0.02 | asserted 1.00 |
| s3 | Besides, due to the theories and technologies of RDBMSs having been enhanced over decades, it is hard to use few years to develop a multi-model database that can be compared with existing RDBMSs in handling security, query optimization, transaction management, etc. | background 0.98 | 0.04 | 0.02 | asserted 0.99 |
| s4 | In this paper, we reconsider employing relational databases to store and query multi-model data. | contribution 0.92 | 0.34 | 0.09 | asserted 0.61 |
| s5 | Unfortunately, the mismatch between the complexity of multi-model data structure and the simplicity of flat relational tables makes this difficult. | background 0.75 | 0.07 | 0.02 | asserted 0.99 |
| s6 | Against this challenge, we utilize the reinforcement learning (RL) method to learn a relational schema by interacting with an RDBMS. | method 0.90 | 0.89 | 0.06 | asserted 1.00 |
| s7 | Instead of using the classic Q-learning algorithm, we propose a variant Q-learning algorithm, called \textit{Double Q-tables}, to reduce the dimension of the original Q-table and improve learning efficiency. | method 0.81 | 0.93 | 0.05 | asserted 1.00 |
| s8 | Experimental results show that our approach could learn a relational schema outperforming the existing multi-model storage schema in terms of query time and space consumption. | result 1.00 | 0.96 | 0.87 | hedged possibility 0.92 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
How to manage various data in a unified way is a significant research topic in the field of databases. To address this problem, researchers have proposed multi-model databases to support multiple data models in a uniform platform with a single unified query language. However, since relational databases are predominant in the current market, it is expensive to replace them with others. Besides, due to the theories and technologies of RDBMSs having been enhanced over decades, it is hard to use few years to develop a multi-model database that can be compared with existing RDBMSs in handling security, query optimization, transaction management, etc. In this paper, we reconsider employing relational databases to store and query multi-model data. Unfortunately, the mismatch between the complexity of multi-model data structure and the simplicity of flat relational tables makes this difficult. Against this challenge, we utilize the reinforcement learning (RL) method to learn a relational schema by interacting with an RDBMS. Instead of using the classic Q-learning algorithm, we propose a variant Q-learning algorithm, called \textit{Double Q-tables}, to reduce the dimension of the original Q-table and improve learning efficiency. Experimental results show that our approach could learn a relational schema outperforming the existing multi-model storage schema in terms of query time and space consumption.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.