分布式数据库系统中副本控制的多树仲裁算法

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-12-01 DOI:10.1109/SPDP.1992.242733

S. M. Chung, Cailin Cao

{"title":"分布式数据库系统中副本控制的多树仲裁算法","authors":"S. M. Chung, Cailin Cao","doi":"10.1109/SPDP.1992.242733","DOIUrl":null,"url":null,"abstract":"A novel replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in distributed database systems. This algorithm provides a high availability for read and write operations by imposing a logical structure of multiple trees on data copies. With the MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, the MTQ requires lower message cost for an operation while providing higher availability.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multiple tree quorum algorithm for replica control in distributed database systems\",\"authors\":\"S. M. Chung, Cailin Cao\",\"doi\":\"10.1109/SPDP.1992.242733\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in distributed database systems. This algorithm provides a high availability for read and write operations by imposing a logical structure of multiple trees on data copies. With the MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, the MTQ requires lower message cost for an operation while providing higher availability.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPDP.1992.242733\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

针对分布式数据库系统中的复制数据管理问题，提出了一种新的副本控制算法——多树仲裁算法(MTQ)。该算法通过在数据副本上施加多树的逻辑结构，为读写操作提供了高可用性。使用MTQ算法，读取操作仅限于几个数据副本，只要树的大多数根和所选每个节点的大多数子节点可用，就允许写操作。与其他算法相比，MTQ需要更低的操作消息成本，同时提供更高的可用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multiple tree quorum algorithm for replica control in distributed database systems

A novel replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in distributed database systems. This algorithm provides a high availability for read and write operations by imposing a logical structure of multiple trees on data copies. With the MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, the MTQ requires lower message cost for an operation while providing higher availability.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量