一种完全去中心化的算法,用于在点对点环境中对交易进行时间戳

S. Hemam, Khaled-Walid Hidouci
{"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}
引用次数: 2

摘要

在本文中,我们研究了一种在点对点(P2P)环境中部分复制的复制数据库中对事务进行时间戳的分散方法。为了解决并发更新和节点故障的问题,我们提出了一种基于仲裁的体系结构,该体系结构允许为每个分布式事务分配唯一的时间戳,选择服务器副本并协调事务的分布式执行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信