Eventual Consistency: NoSQL, CAP Theorem, and BASE
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Explores 2PC principles, failure scenarios, and replication strategies in distributed transactions and discusses the transition from ACID to BASE properties in NoSQL systems.
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.