Abel Rodríguez Morffi, Luisa Manuela González González, Darien Rosa Paz, M. M. Hing
{"title":"An Intelligent Agent Using a Q-Learning Method to Allocate Replicated Data in a Distributed Database","authors":"Abel Rodríguez Morffi, Luisa Manuela González González, Darien Rosa Paz, M. M. Hing","doi":"10.1109/MICAI.2007.8","DOIUrl":null,"url":null,"abstract":"The data distribution problem is a critical one that affects the global performance of the distributed database systems because it directly influences the efficiency of the querying process. Due to the complexity of the problem, most of the proposed solutions divide the design process in two parts: the fragmentation and the allocation of the fragments on the different locations in the network. Here we consider the allocation problem with the possibility to replicate fragments, minimizing the total cost, which is in general NP-complete, and propose a method based on Q-learning to solve the allocation of fragments in the design of a distributed database. As a result we obtain for several cases, logical allocation of fragments in a reasonable time.","PeriodicalId":296192,"journal":{"name":"2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session (MICAI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session (MICAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MICAI.2007.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The data distribution problem is a critical one that affects the global performance of the distributed database systems because it directly influences the efficiency of the querying process. Due to the complexity of the problem, most of the proposed solutions divide the design process in two parts: the fragmentation and the allocation of the fragments on the different locations in the network. Here we consider the allocation problem with the possibility to replicate fragments, minimizing the total cost, which is in general NP-complete, and propose a method based on Q-learning to solve the allocation of fragments in the design of a distributed database. As a result we obtain for several cases, logical allocation of fragments in a reasonable time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
