利用索引技术提高大规模 JavaScript 对象符号数据集的数据检索效率

Bowonsak Srisungsittisunti, Jirawat Duangkaew, S. Mekruksavanich, Nakarin Chaikaew, P. Rojanavasu
{"title":"利用索引技术提高大规模 JavaScript 对象符号数据集的数据检索效率","authors":"Bowonsak Srisungsittisunti, Jirawat Duangkaew, S. Mekruksavanich, Nakarin Chaikaew, P. Rojanavasu","doi":"10.11591/ijai.v13.i2.pp2342-2353","DOIUrl":null,"url":null,"abstract":"<div class=\"translate-tooltip-mtz green sm-root translate hidden_translate\"><div class=\"header-wrapper\"><div class=\"header-controls\"><span>The use of JavaScript Object Notation (JSON) format as a Not only Structured Query Language (NoSQL) storage solution has grown in popularity, but has presented technical challenges, particularly in indexing large-scale JSON files. This has resulted in slow data retrieval, especially for larger datasets. In this study, we propose the use of JSON datasets to preserve data in resource survey processes. We conducted experiments on a 32-gigabyte dataset containing 1,000,000 transactions in JSON format and implemented two indexing methods, dense and sparse, to improve retrieval efficiency. Additionally, we determined the optimal range of segment sizes for the indexing methods. Our findings revealed that adopting dense indexing reduced data retrieval time from 15,635 milliseconds to 55 milliseconds in one-to-one data retrieval, and from 38,300 milliseconds to 1 millisecond in the absence of keywords. In contrast, using sparse indexing reduced data retrieval time from 33,726 milliseconds to 36 milliseconds in one-to-many data retrieval and from 47,203 milliseconds to 0.17 milliseconds when keywords were not found. Furthermore, we discovered that the optimal segment size range was between 20,000 and 200,000 transactions for both dense and sparse indexing.</span></div></div></div>","PeriodicalId":507934,"journal":{"name":"IAES International Journal of Artificial Intelligence (IJ-AI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing data retrieval efficiency in large-scale JavaScript object notation datasets by using indexing techniques\",\"authors\":\"Bowonsak Srisungsittisunti, Jirawat Duangkaew, S. Mekruksavanich, Nakarin Chaikaew, P. Rojanavasu\",\"doi\":\"10.11591/ijai.v13.i2.pp2342-2353\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div class=\\\"translate-tooltip-mtz green sm-root translate hidden_translate\\\"><div class=\\\"header-wrapper\\\"><div class=\\\"header-controls\\\"><span>The use of JavaScript Object Notation (JSON) format as a Not only Structured Query Language (NoSQL) storage solution has grown in popularity, but has presented technical challenges, particularly in indexing large-scale JSON files. This has resulted in slow data retrieval, especially for larger datasets. In this study, we propose the use of JSON datasets to preserve data in resource survey processes. We conducted experiments on a 32-gigabyte dataset containing 1,000,000 transactions in JSON format and implemented two indexing methods, dense and sparse, to improve retrieval efficiency. Additionally, we determined the optimal range of segment sizes for the indexing methods. Our findings revealed that adopting dense indexing reduced data retrieval time from 15,635 milliseconds to 55 milliseconds in one-to-one data retrieval, and from 38,300 milliseconds to 1 millisecond in the absence of keywords. In contrast, using sparse indexing reduced data retrieval time from 33,726 milliseconds to 36 milliseconds in one-to-many data retrieval and from 47,203 milliseconds to 0.17 milliseconds when keywords were not found. Furthermore, we discovered that the optimal segment size range was between 20,000 and 200,000 transactions for both dense and sparse indexing.</span></div></div></div>\",\"PeriodicalId\":507934,\"journal\":{\"name\":\"IAES International Journal of Artificial Intelligence (IJ-AI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IAES International Journal of Artificial Intelligence (IJ-AI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11591/ijai.v13.i2.pp2342-2353\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IAES International Journal of Artificial Intelligence (IJ-AI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/ijai.v13.i2.pp2342-2353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

使用 JavaScript Object Notation(JSON)格式作为结构化查询语言(NoSQL)存储解决方案越来越受欢迎,但也带来了技术挑战,特别是在为大规模 JSON 文件编制索引方面。这导致数据检索速度缓慢,尤其是对于较大的数据集。在本研究中,我们建议在资源调查过程中使用 JSON 数据集来保存数据。我们在一个 32GB 的数据集上进行了实验,该数据集包含 1,000,000 个 JSON 格式的事务,我们采用了两种索引方法(密集索引和稀疏索引)来提高检索效率。此外,我们还确定了索引方法的最佳分段大小范围。我们的研究结果表明,在一对一数据检索中,采用密集索引可将数据检索时间从 15,635 毫秒减少到 55 毫秒;在没有关键字的情况下,可将数据检索时间从 38,300 毫秒减少到 1 毫秒。相比之下,在一对多数据检索中,使用稀疏索引可将数据检索时间从 33,726 毫秒缩短到 36 毫秒,而在未找到关键字的情况下,则可将数据检索时间从 47,203 毫秒缩短到 0.17 毫秒。此外,我们发现密集索引和稀疏索引的最佳分段大小范围都在 20,000 到 200,000 个事务之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhancing data retrieval efficiency in large-scale JavaScript object notation datasets by using indexing techniques
The use of JavaScript Object Notation (JSON) format as a Not only Structured Query Language (NoSQL) storage solution has grown in popularity, but has presented technical challenges, particularly in indexing large-scale JSON files. This has resulted in slow data retrieval, especially for larger datasets. In this study, we propose the use of JSON datasets to preserve data in resource survey processes. We conducted experiments on a 32-gigabyte dataset containing 1,000,000 transactions in JSON format and implemented two indexing methods, dense and sparse, to improve retrieval efficiency. Additionally, we determined the optimal range of segment sizes for the indexing methods. Our findings revealed that adopting dense indexing reduced data retrieval time from 15,635 milliseconds to 55 milliseconds in one-to-one data retrieval, and from 38,300 milliseconds to 1 millisecond in the absence of keywords. In contrast, using sparse indexing reduced data retrieval time from 33,726 milliseconds to 36 milliseconds in one-to-many data retrieval and from 47,203 milliseconds to 0.17 milliseconds when keywords were not found. Furthermore, we discovered that the optimal segment size range was between 20,000 and 200,000 transactions for both dense and sparse indexing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信