{"title":"一种完全去中心化的算法,用于在点对点环境中对交易进行时间戳","authors":"S. Hemam, Khaled-Walid Hidouci","doi":"10.1109/ICMWI.2010.5647903","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate a decentralized approach to timestamping transactions in a replicated database, under partial replication in Peer-To-Peer (P2P) environments. In order to solve problems of concurrent updates and node failures, we propose an architecture based on quorums, this architecture allows assigning a unique timestamp to each distributed transaction, to select the servers replicas and to coordinate the distributed execution of the transaction.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A fully decentralized algorithm to timestamping transactions in a peer-to-peer environments\",\"authors\":\"S. Hemam, Khaled-Walid Hidouci\",\"doi\":\"10.1109/ICMWI.2010.5647903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate a decentralized approach to timestamping transactions in a replicated database, under partial replication in Peer-To-Peer (P2P) environments. In order to solve problems of concurrent updates and node failures, we propose an architecture based on quorums, this architecture allows assigning a unique timestamp to each distributed transaction, to select the servers replicas and to coordinate the distributed execution of the transaction.\",\"PeriodicalId\":404577,\"journal\":{\"name\":\"2010 International Conference on Machine and Web Intelligence\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Machine and Web Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMWI.2010.5647903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Machine and Web Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMWI.2010.5647903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fully decentralized algorithm to timestamping transactions in a peer-to-peer environments
In this paper, we investigate a decentralized approach to timestamping transactions in a replicated database, under partial replication in Peer-To-Peer (P2P) environments. In order to solve problems of concurrent updates and node failures, we propose an architecture based on quorums, this architecture allows assigning a unique timestamp to each distributed transaction, to select the servers replicas and to coordinate the distributed execution of the transaction.