|
PACELC Theorem
In theoretical computer science, the PACELC theorem is an extension to the CAP theorem. It states that in case of network partitioning (P) in a distributed computer system, one has to choose between availability (A) and consistency (C) (as per the CAP theorem), but else (E), even when the system is running normally in the absence of partitions, one has to choose between latency (L) and consistency (C). Overview PACELC builds on the CAP theorem. Both theorems describe how distributed databases have limitations and tradeoffs regarding consistency, availability, and partition tolerance. PACELC however goes further and states that an additional trade-off exists: between latency and consistency, even in absence of partitions, thus providing a more complete portrayal of the potential consistency trade-offs for distributed systems. A high availability requirement implies that the system must replicate data. As soon as a distributed system replicates data, a trade-off between consisten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The Association for Computing Machinery, ACM's ACM SIGACT, Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved. Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of Hebbian learning, learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Apache HBase
HBase is an open-source non-relational distributed database modeled after Google's Bigtable and written in Java. It is developed as part of Apache Software Foundation's Apache Hadoop project and runs on top of HDFS (Hadoop Distributed File System) or Alluxio, providing Bigtable-like capabilities for Hadoop. That is, it provides a fault-tolerant way of storing large quantities of sparse data (small amounts of information caught within a large collection of empty or unimportant data, such as finding the 50 largest items in a group of 2 billion records, or finding the non-zero items representing less than 0.1% of a huge collection). HBase features compression, in-memory operation, and Bloom filters on a per-column basis as outlined in the original Bigtable paper. Tables in HBase can serve as the input and output for MapReduce jobs run in Hadoop, and may be accessed through the Java API but also through REST, Avro or Thrift gateway APIs. HBase is a wide-column store and has been w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trilemma
A trilemma is a difficult choice from three options, each of which is (or appears) unacceptable or unfavourable. There are two logically equivalent ways in which to express a trilemma: it can be expressed as a choice among three unfavourable options, one of which must be chosen, or as a choice among three favourable options, only two of which are possible at the same time. The term derives from the much older term ''dilemma'', a choice between two or more difficult or unfavourable alternatives. The earliest recorded use of the term was by the British preacher Philip Henry in 1672, and later, apparently independently, by the preacher Isaac Watts in 1725. In religion Epicurus' trilemma One of the earliest uses of the trilemma formulation is that of the Greek philosopher Epicurus, rejecting the idea of an omnipotent and omnibenevolent God (as summarised by David Hume): # If God is unable to prevent evil, then he is not all-powerful. # If God is not willing to prevent evil, then ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Raft (computer Science)
A raft is any flat structure for support or transportation over water. It is usually of basic design, characterized by the absence of a hull. Rafts are usually kept afloat by using any combination of buoyant materials such as wood, sealed barrels, or inflated air chambers (such as pontoons), and are typically not propelled by an engine. Rafts are an ancient mode of transport; naturally-occurring rafts such as entwined vegetation and pieces of wood have been used to traverse water since the dawn of humanity. Human-made rafts Traditional or primitive rafts were constructed of wood or reeds. Modern rafts may also use pontoons, drums, or extruded polystyrene blocks. Inflatable rafts up to the 20th century used flotation chambers made of goat- or buffalo-skins, but most now use durable, multi-layered rubberized fabrics. Depending on its use and size, it may have a superstructure, masts, or rudders. Timber rafting is used by the logging industry for the transportation of logs, b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Project Management Triangle
The project management triangle (called also the ''triple constraint'', ''iron triangle'' and ''project triangle'') is a model of the constraints of project management. While its origins are unclear, it has been used since at least the 1950s. It contends that: # The quality (business), quality of work is constrained by the project's budget, deadlines and scope (features). # The project manager can trade between constraints. # Changes in one constraint necessitate changes in others to compensate or quality will suffer. For example, a project can be completed faster by increasing budget or cutting scope. Similarly, increasing scope may require equivalent increases in budget and schedule. Cutting budget without adjusting schedule or scope will lead to lower quality. "Good, fast, cheap. Choose two." as stated in the Common law of business balance, Common Law of Business Balance (often expressed as "You get what you pay for.") which is attributed to John Ruskin but without any evidence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paxos (computer Science)
Paxos is a family of protocols for solving consensus in a network of unreliable or fallible processors. Consensus is the process of agreeing on one result among a group of participants. This problem becomes difficult when the participants or their communications may experience failures. Consensus protocols are the basis for the state machine replication approach to distributed computing, as suggested by Leslie Lamport and surveyed by Fred Schneider. State machine replication is a technique for converting an algorithm into a fault-tolerant, distributed implementation. Ad-hoc techniques may leave important cases of failures unresolved. The principled approach proposed by Lamport et al. ensures all cases are handled safely. The Paxos protocol was first submitted in 1989 and named after a fictional legislative consensus system used on the Paxos island in Greece, where Lamport wrote that the parliament had to function "even though legislators continually wandered in and out of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fallacies Of Distributed Computing
The fallacies of distributed computing are a set of assertions made by L Peter Deutsch and others at Sun Microsystems describing false assumptions that programmers new to distributed applications invariably make. The fallacies The fallacies are # The network is reliable; # Latency is zero; # Bandwidth is infinite; # The network is secure; # Topology doesn't change; # There is one administrator; # Transport cost is zero; # The network is homogeneous. The effects of the fallacies # Software applications are written with little error-handling on networking errors. During a network outage, such applications may stall or infinitely wait for an answer packet, permanently consuming memory or other resources. When the failed network becomes available, those applications may also fail to retry any stalled operations or require a (manual) restart. # Ignorance of network latency, and of the packet loss it can cause, induces application- and transport-layer developers to allow unbounded t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Consistency Model
In computer science, a consistency model specifies a contract between the programmer and a system, wherein the system guarantees that if the programmer follows the rules for operations on memory, memory will be consistent and the results of reading, writing, or updating memory will be predictable. Consistency models are used in distributed systems like distributed shared memory systems or distributed data stores (such as filesystems, databases, optimistic replication systems or web caching). Consistency is different from coherence, which occurs in systems that are cached or cache-less, and is consistency of data with respect to all processors. Coherence deals with maintaining a global order in which writes to a single location or single variable are seen by all processors. Consistency deals with the ordering of operations to multiple locations with respect to all processors. High level languages, such as C++ and Java, maintain the consistency contract by translating memory operat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MongoDB
MongoDB is a source-available cross-platform document-oriented database program. Classified as a NoSQL database program, MongoDB uses JSON-like documents with optional schemas. MongoDB is developed by MongoDB Inc. and licensed under the Server Side Public License (SSPL) which is deemed non-free by several distributions. History 10gen software company began developing MongoDB in 2007 as a component of a planned platform as a service product. In 2009, the company shifted to an open-source development model, with the company offering commercial support and other services. In 2013, 10gen changed its name to MongoDB Inc. On October 20, 2017, MongoDB became a publicly traded company, listed on NASDAQ as MDB with an IPO price of $24 per share. MongoDB is a global company with US headquarters in New York City, USA and International headquarters in Dublin, Ireland. On October 30, 2019, MongoDB teamed up with Alibaba Cloud, who will offer its customers a MongoDB-as-a-service solutio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bigtable
Bigtable is a fully managed wide-column and key-value NoSQL database service for large analytical and operational workloads as part of the Google Cloud portfolio. History Bigtable development began in 2004.. It is now used by a number of Google applications, such as Google Analytics, web indexing, MapReduce, which is often used for generating and modifying data stored in Bigtable, Google Maps,. Google Books search, "My Search History", Google Earth, Blogger.com, Google Code hosting, YouTube, and Gmail. Google's reasons for developing its own database include scalability and better control of performance characteristics. Google's Spanner RDBMS is layered on an implementation of Bigtable with a Paxos group for two-phase commits to each table. Google F1 was built using Spanner to replace an implementation based on MySQL. Apache HBase and Cassandra are some of the best known open source projects that were modeled after Bigtable. On May 6, 2015, a public version of Bigtable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CAP Theorem
In theoretical computer science, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that any distributed data store can provide only two of the following three guarantees:Seth Gilbert and Nancy Lynch"Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services" ''ACM SIGACT News'', Volume 33 Issue 2 (2002), pg. 51–59. . ; Consistency: Every read receives the most recent write or an error. ; Availability: Every request receives a (non-error) response, without the guarantee that it contains the most recent write. ; Partition tolerance: The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes. When a network partition failure happens, it must be decided whether to do one of the following: * cancel the operation and thus decrease the availability but ensure consistency * proceed with the operation and thus provide availability but risk i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PostgreSQL
PostgreSQL (, ), also known as Postgres, is a free and open-source relational database management system (RDBMS) emphasizing extensibility and SQL compliance. It was originally named POSTGRES, referring to its origins as a successor to the Ingres database developed at the University of California, Berkeley. In 1996, the project was renamed to PostgreSQL to reflect its support for SQL. After a review in 2007, the development team decided to keep the name PostgreSQL and the alias Postgres. PostgreSQL features transactions with Atomicity, Consistency, Isolation, Durability (ACID) properties, automatically updatable views, materialized views, triggers, foreign keys, and stored procedures. It is designed to handle a range of workloads, from single machines to data warehouses or Web services with many concurrent users. It is the default database for macOS Server and is also available for Windows, Linux, FreeBSD, and OpenBSD. History PostgreSQL evolved from the Ingres proj ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
