检索结果-内蒙古大学图书馆

cap theorem: Revision of Its Related Consistency Models

COMPUTER JOURNAL 2019年第6期62卷 943-960页

作者： Munoz-Escoi, Francesc D. de Juan-Marin, Ruben Garcia-Escriva, Jose-Ramon Gonzalez de Mendivil, J. R. Bernabeu-Auban, Jose M. Univ Politecn Valencia Inst Univ Mixto Tecnol Informat E-46022 Valencia Spain Univ Publ Navarra Dept Ingn Matemat & Informat Pamplona 31006 Spain

The cap theorem states that only two of these properties can be simultaneously guaranteed in a distributed service: (i) consistency, (ii) availability and (iii) network partition tolerance. This theorem was stated and proved assuming that consistency' refers to atomic consistency. However, multiple consistency models exist and atomic consistency is located at the strongest edge of that spectrum. Many distributed services deployed in cloud platforms should be highly available and scalable. Network partitions may arise in those deployments and should be tolerated. One way of dealing with cap constraints consists in relaxing consistency. Therefore, it is interesting to explore the set of consistency models not supported in an available and partition-tolerant service (cap-constrained models). Other weaker consistency models could be maintained when scalable services are deployed in partitionable systems (cap-free models). Three contributions arise: (i) multiple other cap-constrained models are identified, (ii) a borderline between cap-constrained and cap-free models is set and (iii) a hierarchy of consistency models depending on their strength and convergence is built.

关键词： inter-replica consistency cap theorem service availability network partition consistency model

来源：评论

学校读者我要写书评

暂无评论

Perspectives on the cap theorem

引用

COMPUTER 2012年第2期45卷 30-36页

作者： Gilbert, Seth Lynch, Nancy A. Natl Univ Singapore Dept Comp Sci Singapore Singapore MIT Dept Elect Engn & Comp Sci Theory Distributed Syst TDS Res Grp CSAIL Cambridge MA 02139 USA

The cap theorem is one example of a more general tradeoff between safety and liveness in unreliable systems. Viewing cap in this context provides insight into the inherent tradeoffs and the manner in which they can be... 详细信息

关键词： Distributed Computing cap theorem Fault Tolerance

来源：评论

学校读者我要写书评

暂无评论

Deploying Access Control Enforcement for IoT in the Cloud-Edge Continuum with the help of the cap theorem 20

Deploying Access Control Enforcement for IoT in the Cloud-Ed...

引用

25th ACM Symposium on Access Control Models and Technologies (SACMAT)

作者： Ahmad, Tahir Morelli, Umberto Ranise, Silvio FBK ICT Secur & Trust Unit Trento Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9781450375689

The cap theorem is used by distributed system practitioners to investigate the necessary trade-offs in the design and development of distributed systems, mainly databases and web applications. In this paper, we use it to reason about access control systems designed for the Internet of Things (IoT). We validate our approach by experimentally investigating alternative architectural designs to enforce access control in a smart lock system using the cloud-edge IoT platform offered by Amazon Web Services. We discuss the trade-off between security and performance that may help IoT designers choose the most suitable architecture supporting their requirements.

关键词： Access Control Internet of Things cap theorem

来源：评论

学校读者我要写书评

暂无评论

A Certain Freedom: Thoughts on the cap theorem 10

A Certain Freedom: Thoughts on the CAP Theorem

引用

29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

作者： Brewer, Eric Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9781605588889

At PODC 2000, the cap theorem received its first broad audience. Surprisingly for an impossibility result, one important effect has been to free designers to explore a wider range of distributed systems. Designers of wide-area systems, in which network partitions are considered inevitable, know they cannot have both availability and consistency, and thus can now justify weaker consistency. The rise of the "NoSQL" movement ("Not Only SQL") is an expression of this *** choices of how and when to weaken consistency are often the defining characteristics of these systems, with new variations appearing every year. We review a variety of interesting places in the "cap Space" as a way to illuminate these issues and their consequences. For example, automatic teller machines (ATMs), which predate the cap theorem, surprisingly choose availability with weak consistency but with bounded ***, I explore a few of the options to try to "work around" the impossible. The most basic is the use of commutative operations, which make it easy to restore consistency after a partition heals. However, even many commutative operations have non-commutative exceptions in practice, which means that the exceptions may be incorrect or late. Adding the concept of "delayed exceptions" allows more operations to be considered commutative and simplifies eventual consistency during a partition. Furthermore, we can think of delayed exception handling as "compensation" - we execute a compensating transaction that restores *** exception handling with compensation appears to be what most real wide-area systems do - inconsistency due to limited communication is treated as an exception and some exceptional action, such as monetary compensation or even legal action, is used to fix it. This approach to wide-area systems puts the emphasis on audit trails and recovery rather than prevention, and implies that we should expand and formalize the role of compensation in the design of

关键词： cap theorem

来源：评论

学校读者我要写书评

暂无评论

Traquest Model 2.0 - A Model for Faster ACID Distributed Computing 21st

Traquest Model 2.0 - A Model for Faster ACID Distributed ...

引用

21st International Symposium on Distributed Computing and Artificial Intelligence, DCAI 2024

作者： B. Rátai, Dániel Horváth, Zoltán Porkoláb, Zoltán Tóth, Melinda ELTE Eötvös Loránd University Faculty of Informatics Budapest Hungary

ISBN: (纸本)9783031809453

The global state of a distributed system is most commonly stored in databases. Databases are responsible for ensuring that the data is available, durable, and correct at some level of consistency. However, this approach has its limitations. The computing nodes responsible for the application tier need to constantly communicate over the network to be able to interact with the global state and this comes with a performance limitation. Our Traquest model concept allows us to manage the data and even provide full ACID properties on the application tier level instead of the database level. In most cases, the data can be stored right next to the computation even in the same runtime environment. Our prototype measurements imply, that in some cases a Traquest model-based distributed system can provide even magnitudes larger throughput than the fastest in-memory databases today. The Traquest model also introduces a workaround for the famous cap theorem by introducing temporary availability. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： ACID cap theorem distributed computing fault tolerance transaction

来源：评论

学校读者我要写书评

暂无评论

EVENTUAL CONSISTENCY: ORIGIN AND SUPPORT

引用

COMPUTING AND INFORMATICS 2018年第5期37卷 1037-1072页

作者： Munoz-Escoi, Francesc D. Garcia-Escriva, Jose-Ramon Salvador Sendra-Roig, Juan Bernabeu-Auban, Jose M. Gonzalez de Mendivil, Jose Ramon Univ Politecn Valencia Inst Univ Mixto Tecnol Informat E-46022 Valencia Spain Univ Publ Navarra Dept Ingn Matemat & Informat Pamplona 31006 Spain

Eventual consistency is demanded nowadays in geo-replicated services that need to be highly scalable and available. According to the cap constraints, when network partitions may arise, a distributed service should choose between being strongly consistent or being highly available. Since scalable services should be available, a relaxed consistency (while the network is partitioned) is the preferred choice. Eventual consistency is not a common data-centric consistency model, but only a state convergence condition to be added to a relaxed consistency model. There are still several aspects of eventual consistency that have not been analysed in depth in previous works: 1. which are the oldest replication proposals providing eventual consistency, 2. which replica consistency models provide the best basis for building eventually consistent services, 3. which mechanisms should be considered for implementing an eventually consistent service, and 4. which are the best combinations of those mechanisms for achieving different concrete goals. This paper provides some notes on these important topics.

关键词： Eventual consistency consistency model cap theorem data replication

来源：评论

学校读者我要写书评

暂无评论

Consistency, availability, and partition tolerance in blockchain: a survey on the consensus mechanism over peer-to-peer networking

引用

ANNALS OF TELECOMMUNICATIONS 2020年第3-4期75卷 163-174页

作者： Carrara, Gabriel R. Burle, Leonardo M. Medeiros, Dianne S. V. de Albuquerque, Celio Vinicius N. Mattos, Diogo M. F. Univ Fed Fluminense MidiaCom PGEET TET IC Niteroi RJ Brazil

Blockchain is a disruptive technology that relies on the distributed nature of the peer-to-peer network while performing an agreement, or consensus, a mechanism to achieve an immutable, global, and consistent registry of all transactions. Thus, a key challenge in developing blockchain solutions is to design the consensus mechanism properly. As a consequence of being a distributed application, any consensus mechanism is restricted to offer two of three properties: consistency, availability, and partition tolerance. In this paper, we survey the main consensus mechanisms on blockchain solutions, and we highlight the properties of each one. Moreover, we differentiate both deterministic and probabilistic consensus mechanisms, and we highlight coordination solutions that facilitate the data distribution on the blockchain, without the need for a sophisticated consensus mechanism.

关键词： Consensus mechanisms cap theorem Blockchain Peer-to-peer network

来源：评论

学校读者我要写书评

暂无评论

A quorum-based data consistency approach for non-relational database

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2022年第2期25卷 1515-1540页

作者： Noudoust, Nasim Naseri Seyedi Adabi, Sahar Rezaee, Ali Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Islamic Azad Univ Dept Comp Engn North Tehran Branch Tehran Iran

Quorum algorithm has become one of the most widely adopted approaches for storing data in the failure-prone distributed storage systems. In this paper, a new approach is proposed which is able to set different levels of data consistency in key-value NoSQL databases. The proposed approach is based on the parameters set in the NoSQL-dependent structure and is applied to distributed systems, using the quorum algorithm to adjust the consistency and to determine the different grades of data. In this paper, different data writing and reading and mix reading/writing operations are implemented test-bed to study the performance of the proposed approach. In addition to its main goal for improving data consistency, the proposed approach also satisfies the accepted compromise between the pillars of the cap and PACELC theorems. Evaluation of the results shows that the objectives for consistency and efficiency of the proposed approach have been met.

关键词： cap theorem Data consistency NoSQL databases PACELC theorem Quorum algorithm

来源：评论

学校读者我要写书评

暂无评论

BASE analysis of NoSQL database

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2015年 52卷 13-21页

作者： Chandra, Deka Ganesh Reg Vocat Training Inst Women Tura Meghalaya India Govt India Directorate Gen Training Minist Skill Dev & Entrepreneurship New Delhi India

NoSQL databases are designed to address performance and scalability requirements of web based application which cannot be addressed by traditional relational databases. Due to their contrast in priorities and architecture to conventional relational databases using SQL, these databases are referred as "NoSQL" databases since they incorporate lots of additional features in addition to the features of conventional databases. The relational databases strongly follow the ACID (Atomicity, Consistency, Isolation, and Durability) properties while the NoSQL databases follow BASE (Basically Available, Soft State, Eventual consistency) principles. This survey paper is an analytical study on BASE features of some of NoSQL databases. (C) 2015 Elsevier B.V. All rights reserved.

关键词： ACID BASE NoSQL cap theorem Soft state

来源：评论

学校读者我要写书评

暂无评论

Different Databases for Different Strokes

引用

IEEE SOFTWARE 2018年第2期35卷 80-85页

作者： Vial, Gregory HEC Montreals Dept Informat Technol Montreal PQ Canada

This article provides an overview of current database-management-system technologies and suppliers, along with a case study of an Internet application. The Web Extra at https://***/extra/*** consists of a table descri... 详细信息

关键词： Database Management Systems Internet Database Management System Technologies Internet Application Software Development Management Data Models Relational Databases Data Structures Search Engines Relational Databases Database Management Systems Relational Database Management Systems RDBMS Databases SQL No SQL cap theorem PACELC Spanner Google Software Engineering Software Development

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：