{"title":"基于树的网络中部分复制数据库系统的最优分配","authors":"A. Stephens, Y. Yesha, K. Humenik","doi":"10.1109/PCCC.1992.200548","DOIUrl":null,"url":null,"abstract":"The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"72 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Optimal allocation for partially replicated database systems on tree-based networks\",\"authors\":\"A. Stephens, Y. Yesha, K. Humenik\",\"doi\":\"10.1109/PCCC.1992.200548\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"72 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200548\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal allocation for partially replicated database systems on tree-based networks
The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
