OptSpec:优化规格数据的发动机解剖

P. Hegade, Kshitij Tiwari, Amit Godikar
{"title":"OptSpec:优化规格数据的发动机解剖","authors":"P. Hegade, Kshitij Tiwari, Amit Godikar","doi":"10.1109/DELCON57910.2023.10127318","DOIUrl":null,"url":null,"abstract":"Search engines are progressing with design and technology to meet the business models' continually changing and evolving needs. From crawling the links for indexing them to presenting the results based on the user query, search engine components have been researched in depth and breadth. This research investigation is focused on managing and processing the name-value pair data. 21K e-commerce data items were processed into JSON format in key-value pairs to explore the combinatorial explosion and its impact of the smaller subsets, items segregated by the domains. An item might not have all of its specifications contributing to the results in the query management. We propose a method to generate subsets of categories that can potentially contribute to the processing and results. One of the ways to manage huge data is using threads and parallel processing. We use the approach and compare the results with single threaded model. The processed and raw data storage methods have also been compared for different item sets. The model also presents the approaches of selecting the right set of specifications depending on the user query. Several methods are compared based on the limiting set threshold. The results appear to be an effective way of managing associative data. The known methods and parameters are positively better than the neural and deep learning networks that keep the methodology hidden and in the black box from the users. When the thresholds and sets are known, the algorithms can make better decisions.","PeriodicalId":193577,"journal":{"name":"2023 2nd Edition of IEEE Delhi Section Flagship Conference (DELCON)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"OptSpec: Optimization of Specifications Data for Engine Anatomy\",\"authors\":\"P. Hegade, Kshitij Tiwari, Amit Godikar\",\"doi\":\"10.1109/DELCON57910.2023.10127318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Search engines are progressing with design and technology to meet the business models' continually changing and evolving needs. From crawling the links for indexing them to presenting the results based on the user query, search engine components have been researched in depth and breadth. This research investigation is focused on managing and processing the name-value pair data. 21K e-commerce data items were processed into JSON format in key-value pairs to explore the combinatorial explosion and its impact of the smaller subsets, items segregated by the domains. An item might not have all of its specifications contributing to the results in the query management. We propose a method to generate subsets of categories that can potentially contribute to the processing and results. One of the ways to manage huge data is using threads and parallel processing. We use the approach and compare the results with single threaded model. The processed and raw data storage methods have also been compared for different item sets. The model also presents the approaches of selecting the right set of specifications depending on the user query. Several methods are compared based on the limiting set threshold. The results appear to be an effective way of managing associative data. The known methods and parameters are positively better than the neural and deep learning networks that keep the methodology hidden and in the black box from the users. When the thresholds and sets are known, the algorithms can make better decisions.\",\"PeriodicalId\":193577,\"journal\":{\"name\":\"2023 2nd Edition of IEEE Delhi Section Flagship Conference (DELCON)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 2nd Edition of IEEE Delhi Section Flagship Conference (DELCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DELCON57910.2023.10127318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd Edition of IEEE Delhi Section Flagship Conference (DELCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DELCON57910.2023.10127318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

搜索引擎在设计和技术上不断进步,以满足商业模式不断变化和发展的需求。从抓取链接以建立索引到基于用户查询显示结果,搜索引擎组件已经得到了深入和广泛的研究。本文的研究重点是名称-值对数据的管理和处理。将21K个电子商务数据项以键值对的形式处理成JSON格式,以探索由域分隔的较小子集的组合爆炸及其影响。在查询管理中,一个项目可能没有其所有规范对结果做出贡献。我们提出了一种方法来生成可能有助于处理和结果的类别子集。管理海量数据的方法之一是使用线程和并行处理。我们使用该方法并将结果与单线程模型进行比较。对不同项目集的处理数据和原始数据的存储方法进行了比较。该模型还提供了根据用户查询选择正确规范集的方法。基于限制集阈值对几种方法进行了比较。结果似乎是一种管理关联数据的有效方法。已知的方法和参数肯定比神经网络和深度学习网络更好,因为神经网络和深度学习网络将方法隐藏在黑盒中,不让用户知道。当阈值和集合已知时,算法可以做出更好的决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
OptSpec: Optimization of Specifications Data for Engine Anatomy
Search engines are progressing with design and technology to meet the business models' continually changing and evolving needs. From crawling the links for indexing them to presenting the results based on the user query, search engine components have been researched in depth and breadth. This research investigation is focused on managing and processing the name-value pair data. 21K e-commerce data items were processed into JSON format in key-value pairs to explore the combinatorial explosion and its impact of the smaller subsets, items segregated by the domains. An item might not have all of its specifications contributing to the results in the query management. We propose a method to generate subsets of categories that can potentially contribute to the processing and results. One of the ways to manage huge data is using threads and parallel processing. We use the approach and compare the results with single threaded model. The processed and raw data storage methods have also been compared for different item sets. The model also presents the approaches of selecting the right set of specifications depending on the user query. Several methods are compared based on the limiting set threshold. The results appear to be an effective way of managing associative data. The known methods and parameters are positively better than the neural and deep learning networks that keep the methodology hidden and in the black box from the users. When the thresholds and sets are known, the algorithms can make better decisions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信