Non-native Techniques for Storing JSON Documents into Relational Tables

D. Petković
{"title":"Non-native Techniques for Storing JSON Documents into Relational Tables","authors":"D. Petković","doi":"10.1145/3428757.3429103","DOIUrl":null,"url":null,"abstract":"The natural way, how JSON documents can be queried and modified is to store them first in relational environment. In such a case, the features of relational DBMSs such as transaction processing, can be used. In this paper we compare two different mapping techniques: Adjacency List and the Single-Table Data Mapping (STDM) algorithm, which can be used, among other techniques, to store JSON documents in relational tables. The reason to choose and compare these two techniques is due to their origin: both are representatives of two different non-native storing techniques. The former is a general technique, which can be applied to any data presented in hierarchical form, while the latter is a representative of the family of XML-to-Relational storage algorithms, which can be used for JSON, too. Our results show that using the STDM algorithm the size of resulting relational table is approximately 70% of the size of the corresponding table generated with Adjacency List. Additionally, the STDM algorithm significantly outperforms Adjacency List concerning time.","PeriodicalId":212557,"journal":{"name":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3428757.3429103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The natural way, how JSON documents can be queried and modified is to store them first in relational environment. In such a case, the features of relational DBMSs such as transaction processing, can be used. In this paper we compare two different mapping techniques: Adjacency List and the Single-Table Data Mapping (STDM) algorithm, which can be used, among other techniques, to store JSON documents in relational tables. The reason to choose and compare these two techniques is due to their origin: both are representatives of two different non-native storing techniques. The former is a general technique, which can be applied to any data presented in hierarchical form, while the latter is a representative of the family of XML-to-Relational storage algorithms, which can be used for JSON, too. Our results show that using the STDM algorithm the size of resulting relational table is approximately 70% of the size of the corresponding table generated with Adjacency List. Additionally, the STDM algorithm significantly outperforms Adjacency List concerning time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将JSON文档存储到关系表中的非本机技术
查询和修改JSON文档的自然方式是首先将它们存储在关系环境中。在这种情况下,可以使用关系dbms的特性,如事务处理。在本文中,我们比较了两种不同的映射技术:邻接表和单表数据映射(STDM)算法,在其他技术中,它可以用于在关系表中存储JSON文档。选择和比较这两种技术的原因在于它们的起源:它们都是两种不同的非本机存储技术的代表。前者是一种通用技术,可应用于以分层形式呈现的任何数据,而后者是XML-to-Relational存储算法家族的代表,也可用于JSON。我们的结果表明,使用STDM算法生成的关系表的大小大约是邻接表生成的相应表大小的70%。此外,STDM算法在时间上明显优于邻接表算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tailored Graph Embeddings for Entity Alignment on Historical Data CommunityCare A Comparison of Two Database Partitioning Approaches that Support Taxonomy-Based Query Answering Prediction of Cesarean Childbirth using Ensemble Machine Learning Methods Interoperability of Semantically-Enabled Web Services on the WoT: Challenges and Prospects
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1