{"title":"基于优先级的PCG算法在多数据库系统中的全局死锁检测和解决","authors":"O. Bukhres, Jeanne Alm, N. Boudriga","doi":"10.1109/RIDE.1993.281915","DOIUrl":null,"url":null,"abstract":"The paper presents a priority-based potential conflict graph algorithm for global deadlock-detection in a multidatabase system that extends the previous PCG algorithm by examining the following problems: unnecessary aborts, inefficient victim selections, and false deadlock reports. The PPCG algorithm addresses the problem of unnecessary aborts and provides for improved victim selection.<<ETX>>","PeriodicalId":302564,"journal":{"name":"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A priority-based PCG algorithm for global deadlock detection and resolution in multidatabase systems\",\"authors\":\"O. Bukhres, Jeanne Alm, N. Boudriga\",\"doi\":\"10.1109/RIDE.1993.281915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a priority-based potential conflict graph algorithm for global deadlock-detection in a multidatabase system that extends the previous PCG algorithm by examining the following problems: unnecessary aborts, inefficient victim selections, and false deadlock reports. The PPCG algorithm addresses the problem of unnecessary aborts and provides for improved victim selection.<<ETX>>\",\"PeriodicalId\":302564,\"journal\":{\"name\":\"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1993.281915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1993.281915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A priority-based PCG algorithm for global deadlock detection and resolution in multidatabase systems
The paper presents a priority-based potential conflict graph algorithm for global deadlock-detection in a multidatabase system that extends the previous PCG algorithm by examining the following problems: unnecessary aborts, inefficient victim selections, and false deadlock reports. The PPCG algorithm addresses the problem of unnecessary aborts and provides for improved victim selection.<>