Praveen Ranjan Srivastava, Harshit Kumar Singh, Surabhi Sakshi, J. Zhang, Qiuzheng Li
Artificial intelligence-powered chatbot usage continues to grow worldwide, and there is ongoing research to identify features that maximize the utility of chatbots. This study uses the multi-criteria decision-making (MCDM) method to find the best available alternative chatbot for task completion. We identify chatbot evaluation criteria from literature followed by inputs from experts using the Delphi method. We apply CRITIC to evaluate the relative importance of the specified criteria. Finally, we list popular alternatives of chatbots and features offered and apply WASPAS and EDAS techniques to rank the available alternatives. The alternatives explored in this study include YOU, ChatGPT, PerplexityAI, ChatSonic, and CharacterAI. Both methods yield identical results in ranking, with ChatGPT emerging as the most preferred alternative based on the criteria identified.
{"title":"Identifying Alternative Options for Chatbots With Multi-Criteria Decision-Making","authors":"Praveen Ranjan Srivastava, Harshit Kumar Singh, Surabhi Sakshi, J. Zhang, Qiuzheng Li","doi":"10.4018/jdm.345917","DOIUrl":"https://doi.org/10.4018/jdm.345917","url":null,"abstract":"Artificial intelligence-powered chatbot usage continues to grow worldwide, and there is ongoing research to identify features that maximize the utility of chatbots. This study uses the multi-criteria decision-making (MCDM) method to find the best available alternative chatbot for task completion. We identify chatbot evaluation criteria from literature followed by inputs from experts using the Delphi method. We apply CRITIC to evaluate the relative importance of the specified criteria. Finally, we list popular alternatives of chatbots and features offered and apply WASPAS and EDAS techniques to rank the available alternatives. The alternatives explored in this study include YOU, ChatGPT, PerplexityAI, ChatSonic, and CharacterAI. Both methods yield identical results in ranking, with ChatGPT emerging as the most preferred alternative based on the criteria identified.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141830348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Research project evaluation upon completion is one of the important tasks for research management in government funding agencies and research institutions. Due to the increased number of funded projects, it is hard to find qualified reviewers in the same research disciplines. This paper proposes a machine learning and large language model integrated approach to provide decision support for research project evaluation. Machine learning algorithms are proposed to compute the weights of key performance indicators (KPIs) and scores of KPIs based on the evaluation results of completed projects, large language models are used to summarize research contributions or findings on project reports. Then domain experts are invited to consolidate the weights and scores for the KPIs and assess the novelty and impact of research contribution or findings. Experiments have been conducted in practical settings and the results have shown that the proposed method can greatly improve research management efficiency and provide more consistent evaluation results on funded research projects.
{"title":"A Machine Learning and Large Language Model-Integrated Approach to Research Project Evaluation","authors":"Jian Ma, Zhimin Zheng, Peihu Zhu, Zhaobin Liu","doi":"10.4018/jdm.345400","DOIUrl":"https://doi.org/10.4018/jdm.345400","url":null,"abstract":"Research project evaluation upon completion is one of the important tasks for research management in government funding agencies and research institutions. Due to the increased number of funded projects, it is hard to find qualified reviewers in the same research disciplines. This paper proposes a machine learning and large language model integrated approach to provide decision support for research project evaluation. Machine learning algorithms are proposed to compute the weights of key performance indicators (KPIs) and scores of KPIs based on the evaluation results of completed projects, large language models are used to summarize research contributions or findings on project reports. Then domain experts are invited to consolidate the weights and scores for the KPIs and assess the novelty and impact of research contribution or findings. Experiments have been conducted in practical settings and the results have shown that the proposed method can greatly improve research management efficiency and provide more consistent evaluation results on funded research projects.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141375244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the context of mobile applications (apps), the role of customers has been transformed from mere passive adopters to active co-creators through contribution of user reviews. However, customers might not always possess the required technical expertise to make commercially feasible suggestions. The value of customer reviews also varied due to their unmanageable volume and content irrelevance. In our study, over 189,000 user reviews with over 50 apps would be analyzed using review analysis and multivariate regression analysis to examine the impacts of innovation and improvement led by customers on app performance in terms of app revenues. The developers' lead time in responding to user reviews would be included as a moderator to investigate whether app performance would be enhanced if developers respond faster. This study should represent one of the first few attempts in offering empirical confirmation of the value of co-creation of apps with customers. The authors also present methodological contributions by establishing operationalization and analyses of user reviews.
{"title":"Examining the Usefulness of Customer Reviews for Mobile Applications","authors":"Zhiying Jiang, Vanessa Liu, Miriam Erne","doi":"10.4018/jdm.343543","DOIUrl":"https://doi.org/10.4018/jdm.343543","url":null,"abstract":"In the context of mobile applications (apps), the role of customers has been transformed from mere passive adopters to active co-creators through contribution of user reviews. However, customers might not always possess the required technical expertise to make commercially feasible suggestions. The value of customer reviews also varied due to their unmanageable volume and content irrelevance. In our study, over 189,000 user reviews with over 50 apps would be analyzed using review analysis and multivariate regression analysis to examine the impacts of innovation and improvement led by customers on app performance in terms of app revenues. The developers' lead time in responding to user reviews would be included as a moderator to investigate whether app performance would be enhanced if developers respond faster. This study should represent one of the first few attempts in offering empirical confirmation of the value of co-creation of apps with customers. The authors also present methodological contributions by establishing operationalization and analyses of user reviews.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140963547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-14DOI: 10.1142/9781848164482_0004
Sneh Lata Pundir, Sang Min Lee, Dong Seong Kim, Ji Ho Kim
The use of encrypted data, the diversity of new protocols, and the surge in the number of malicious activities worldwide have posed new challenges for intrusion detection systems (IDS). In this scenario, existing signature-based IDS are not performing well. Various researchers have proposed machine learning-based IDS to detect unknown malicious activities based on behaviour patterns. Results have shown that machine learning-based IDS perform better than signature-based IDS (SIDS) in identifying new malicious activities in the communication network. In this paper, the authors have analyzed the IDS dataset that contains the most current common attacks and evaluated the performance of network intrusion detection systems by adopting two data resampling techniques and 10 machine learning classifiers. It has been observed that the top three IDS models—KNeighbors, XGBoost, and AdaBoost—outperform binary-class classification with 99.49%, 99.14%, and 98.75% accuracy, and XGBoost, KNneighbors, and GaussianNB outperform in multi-class classification with 99.30%, 98.88%, and 96.66% accuracy.
{"title":"Intrusion Detection System","authors":"Sneh Lata Pundir, Sang Min Lee, Dong Seong Kim, Ji Ho Kim","doi":"10.1142/9781848164482_0004","DOIUrl":"https://doi.org/10.1142/9781848164482_0004","url":null,"abstract":"The use of encrypted data, the diversity of new protocols, and the surge in the number of malicious activities worldwide have posed new challenges for intrusion detection systems (IDS). In this scenario, existing signature-based IDS are not performing well. Various researchers have proposed machine learning-based IDS to detect unknown malicious activities based on behaviour patterns. Results have shown that machine learning-based IDS perform better than signature-based IDS (SIDS) in identifying new malicious activities in the communication network. In this paper, the authors have analyzed the IDS dataset that contains the most current common attacks and evaluated the performance of network intrusion detection systems by adopting two data resampling techniques and 10 machine learning classifiers. It has been observed that the top three IDS models—KNeighbors, XGBoost, and AdaBoost—outperform binary-class classification with 99.49%, 99.14%, and 98.75% accuracy, and XGBoost, KNneighbors, and GaussianNB outperform in multi-class classification with 99.30%, 98.88%, and 96.66% accuracy.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139837877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-14DOI: 10.1142/9781848164482_0004
Sneh Lata Pundir, Sang Min Lee, Dong Seong Kim, Ji Ho Kim
The use of encrypted data, the diversity of new protocols, and the surge in the number of malicious activities worldwide have posed new challenges for intrusion detection systems (IDS). In this scenario, existing signature-based IDS are not performing well. Various researchers have proposed machine learning-based IDS to detect unknown malicious activities based on behaviour patterns. Results have shown that machine learning-based IDS perform better than signature-based IDS (SIDS) in identifying new malicious activities in the communication network. In this paper, the authors have analyzed the IDS dataset that contains the most current common attacks and evaluated the performance of network intrusion detection systems by adopting two data resampling techniques and 10 machine learning classifiers. It has been observed that the top three IDS models—KNeighbors, XGBoost, and AdaBoost—outperform binary-class classification with 99.49%, 99.14%, and 98.75% accuracy, and XGBoost, KNneighbors, and GaussianNB outperform in multi-class classification with 99.30%, 98.88%, and 96.66% accuracy.
{"title":"Intrusion Detection System","authors":"Sneh Lata Pundir, Sang Min Lee, Dong Seong Kim, Ji Ho Kim","doi":"10.1142/9781848164482_0004","DOIUrl":"https://doi.org/10.1142/9781848164482_0004","url":null,"abstract":"The use of encrypted data, the diversity of new protocols, and the surge in the number of malicious activities worldwide have posed new challenges for intrusion detection systems (IDS). In this scenario, existing signature-based IDS are not performing well. Various researchers have proposed machine learning-based IDS to detect unknown malicious activities based on behaviour patterns. Results have shown that machine learning-based IDS perform better than signature-based IDS (SIDS) in identifying new malicious activities in the communication network. In this paper, the authors have analyzed the IDS dataset that contains the most current common attacks and evaluated the performance of network intrusion detection systems by adopting two data resampling techniques and 10 machine learning classifiers. It has been observed that the top three IDS models—KNeighbors, XGBoost, and AdaBoost—outperform binary-class classification with 99.49%, 99.14%, and 98.75% accuracy, and XGBoost, KNneighbors, and GaussianNB outperform in multi-class classification with 99.30%, 98.88%, and 96.66% accuracy.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139778161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The acquisition and sharing of reviews have significant ramifications for the selection of crowdsourcing designs before mass production. This article studies the optimal decision of a brand enterprise regarding the acquisition/sharing of crowdsourcing design reviews in a supply chain. The authors consider an analytical model where the brand enterprise can privately acquire the manufacturer's review (MR) of crowdsourcing product designs and choose one of two information-sharing schemes—optional or mandatory sharing—to disclose MR to the key opinion leaders (KOLs), which help them to produce fans' reviews (FR). MR and FR integrate into the joint reviews (JR) that impact prospective consumers' purchase intention. The authors find that mandatory sharing significantly harms the brand enterprise's motivation to obtain MR, yet optional sharing is conducive to boosting JR on crowdsourcing designs. In addition, JR has a ceiling value, implying that excessively high FR and MR could not always enhance the effect of JR on crowdsourcing designs.
{"title":"Optimal Information Acquisition and Sharing Decisions","authors":"Jizi Li, Xiaodie Wang, J. Zhang, Longyu Li","doi":"10.4018/jdm.337971","DOIUrl":"https://doi.org/10.4018/jdm.337971","url":null,"abstract":"The acquisition and sharing of reviews have significant ramifications for the selection of crowdsourcing designs before mass production. This article studies the optimal decision of a brand enterprise regarding the acquisition/sharing of crowdsourcing design reviews in a supply chain. The authors consider an analytical model where the brand enterprise can privately acquire the manufacturer's review (MR) of crowdsourcing product designs and choose one of two information-sharing schemes—optional or mandatory sharing—to disclose MR to the key opinion leaders (KOLs), which help them to produce fans' reviews (FR). MR and FR integrate into the joint reviews (JR) that impact prospective consumers' purchase intention. The authors find that mandatory sharing significantly harms the brand enterprise's motivation to obtain MR, yet optional sharing is conducive to boosting JR on crowdsourcing designs. In addition, JR has a ceiling value, implying that excessively high FR and MR could not always enhance the effect of JR on crowdsourcing designs.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139841331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The acquisition and sharing of reviews have significant ramifications for the selection of crowdsourcing designs before mass production. This article studies the optimal decision of a brand enterprise regarding the acquisition/sharing of crowdsourcing design reviews in a supply chain. The authors consider an analytical model where the brand enterprise can privately acquire the manufacturer's review (MR) of crowdsourcing product designs and choose one of two information-sharing schemes—optional or mandatory sharing—to disclose MR to the key opinion leaders (KOLs), which help them to produce fans' reviews (FR). MR and FR integrate into the joint reviews (JR) that impact prospective consumers' purchase intention. The authors find that mandatory sharing significantly harms the brand enterprise's motivation to obtain MR, yet optional sharing is conducive to boosting JR on crowdsourcing designs. In addition, JR has a ceiling value, implying that excessively high FR and MR could not always enhance the effect of JR on crowdsourcing designs.
{"title":"Optimal Information Acquisition and Sharing Decisions","authors":"Jizi Li, Xiaodie Wang, J. Zhang, Longyu Li","doi":"10.4018/jdm.337971","DOIUrl":"https://doi.org/10.4018/jdm.337971","url":null,"abstract":"The acquisition and sharing of reviews have significant ramifications for the selection of crowdsourcing designs before mass production. This article studies the optimal decision of a brand enterprise regarding the acquisition/sharing of crowdsourcing design reviews in a supply chain. The authors consider an analytical model where the brand enterprise can privately acquire the manufacturer's review (MR) of crowdsourcing product designs and choose one of two information-sharing schemes—optional or mandatory sharing—to disclose MR to the key opinion leaders (KOLs), which help them to produce fans' reviews (FR). MR and FR integrate into the joint reviews (JR) that impact prospective consumers' purchase intention. The authors find that mandatory sharing significantly harms the brand enterprise's motivation to obtain MR, yet optional sharing is conducive to boosting JR on crowdsourcing designs. In addition, JR has a ceiling value, implying that excessively high FR and MR could not always enhance the effect of JR on crowdsourcing designs.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139781326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The adoption of empirical methods for secondary data analysis has witnessed a significant surge in IS research. However, the secondary data is often incomplete, skewed, and imbalanced at best. Consequently, there is a growing recognition of the importance of empirical techniques and methodological decisions made to navigate through such issues. However, there is not enough methodological guidance, especially in the form of a worked case study that demonstrates the challenges of imbalanced datasets and offers prescriptive on how to deal with them. Using data on P2P money transfer services, this article presents a running example by analyzing the same dataset using several different methods. It then compares the outcomes of these choices and explicates the rationale behind some decisions such as inclusion and categorization of variables, parameter setting, and model selection. Finally, the article discusses certain regressions models such as weighted logistic regression and propensity matching, and when they should be used.
{"title":"Handling Imbalanced Data With Weighted Logistic Regression and Propensity Score Matching methods","authors":"L. Agrawal, Pavankumar Mulgund, Raj Sharman","doi":"10.4018/jdm.335888","DOIUrl":"https://doi.org/10.4018/jdm.335888","url":null,"abstract":"The adoption of empirical methods for secondary data analysis has witnessed a significant surge in IS research. However, the secondary data is often incomplete, skewed, and imbalanced at best. Consequently, there is a growing recognition of the importance of empirical techniques and methodological decisions made to navigate through such issues. However, there is not enough methodological guidance, especially in the form of a worked case study that demonstrates the challenges of imbalanced datasets and offers prescriptive on how to deal with them. Using data on P2P money transfer services, this article presents a running example by analyzing the same dataset using several different methods. It then compares the outcomes of these choices and explicates the rationale behind some decisions such as inclusion and categorization of variables, parameter setting, and model selection. Finally, the article discusses certain regressions models such as weighted logistic regression and propensity matching, and when they should be used.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139448800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Resource Description Framework (RDF) and RDF Schema (RDFS) recommended by World Wide Web Consortium (W3C) provide a flexible model for semantically representing data on the web. With the widespread acceptance of RDF(S) (RDF and RDFS for short), a large number of RDF(S) is available. Databases play an important role in managing RDF(S). However, there are few studies on using object-relational databases to store RDF(S). In this paper, the authors propose the formal definitions of RDF(S) model and object-relational databases model. Then they introduce the approach for storing RDF(S) in object-relational databases based on the formal definitions. They implement a prototype system to demonstrate the feasibility of the approach and test the performance and semantic retention ability of this prototype system with the benchmark dataset.
{"title":"RDF(S) Store in Object-Relational Databases","authors":"Z. Ma, Daiyi Li, Jiawen Lu, Ruizhe Ma, Li Yan","doi":"10.4018/jdm.334710","DOIUrl":"https://doi.org/10.4018/jdm.334710","url":null,"abstract":"The Resource Description Framework (RDF) and RDF Schema (RDFS) recommended by World Wide Web Consortium (W3C) provide a flexible model for semantically representing data on the web. With the widespread acceptance of RDF(S) (RDF and RDFS for short), a large number of RDF(S) is available. Databases play an important role in managing RDF(S). However, there are few studies on using object-relational databases to store RDF(S). In this paper, the authors propose the formal definitions of RDF(S) model and object-relational databases model. Then they introduce the approach for storing RDF(S) in object-relational databases based on the formal definitions. They implement a prototype system to demonstrate the feasibility of the approach and test the performance and semantic retention ability of this prototype system with the benchmark dataset.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138979725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Based on the relationship between client load and overall system performance, the authors propose a sample-aware deep deterministic policy gradient model. Specifically, they improve sample quality by filtering out sample noise caused by the fluctuations of client load, which accelerates the model convergence speed of the intelligent tuning system and improves the tuning effect. Also, the hardware resources and client load consumed by the database in the working process are added to the model for training. This can enhance the performance characterization ability of the model and improve the recommended parameters of the algorithm. Meanwhile, they propose an improved closed-loop distributed comprehensive training architecture of online and offline training to quickly obtain high-quality samples and improve the efficiency of parameter tuning. Experimental results show that the configuration parameters can make the performance of the database system better and shorten the tuning time.
{"title":"A Sample-Aware Database Tuning System With Deep Reinforcement Learning","authors":"Zhongliang Li, Yaofeng Tu, Zongmin Ma","doi":"10.4018/jdm.333519","DOIUrl":"https://doi.org/10.4018/jdm.333519","url":null,"abstract":"Based on the relationship between client load and overall system performance, the authors propose a sample-aware deep deterministic policy gradient model. Specifically, they improve sample quality by filtering out sample noise caused by the fluctuations of client load, which accelerates the model convergence speed of the intelligent tuning system and improves the tuning effect. Also, the hardware resources and client load consumed by the database in the working process are added to the model for training. This can enhance the performance characterization ability of the model and improve the recommended parameters of the algorithm. Meanwhile, they propose an improved closed-loop distributed comprehensive training architecture of online and offline training to quickly obtain high-quality samples and improve the efficiency of parameter tuning. Experimental results show that the configuration parameters can make the performance of the database system better and shorten the tuning time.","PeriodicalId":51086,"journal":{"name":"Journal of Database Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135192052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：