Distributed data store: Difference between revisions

Revision as of 11:03, 23 December 2022

Revision as of 16:38, 29 March 2023

Line 8:

|edition = Distributed Storage: Concepts, Algorithms, and Implementations

|ol = 25423189M

}}</ref> It is usually specifically used to refer to either a [[distributed database]] where users store information on a ''number of nodes'', or a [[computer network]] in which users store information on a ''number of peer network nodes''.<ref name="urlDistributed Data Storage - an overview | ScienceDirect Topics">{{cite web |url=https://www.sciencedirect.com/topics/computer-science/distributed-data-storage |title=Distributed Data Storage - an overview &#124; ScienceDirect Topics |format= |work= |accessdate=}}</ref>

==Distributed databases==

Line 29:

| quote = Dynamo: a highly available and scalable distributed data store

| url = http://www.cs.uwaterloo.ca/~kdaudjee/courses/cs848/slides/sarah1.pdf}}</ref>

and [[Azure Services Platform|Microsoft Azure Storage]].<ref>{{cite web|url=http://www.microsoft.com/windowsazure/features/storage/|title=Windows Azure Storage|website=[[Microsoft]] |date=2011-09-16|access-date=6 November 2011|url-status=dead|archive-url=https://web.archive.org/web/20111109002826/http://www.microsoft.com/windowsazure/features/storage/|archive-date=9 November 2011}}</ref>

As the ability of arbitrary querying is not as important as the [[availability]], designers of distributed data stores have increased the latter at an expense of consistency. But the high-speed read/write access results in reduced consistency, as it is not possible to guarantee both [[Consistency (database systems)|consistency]] and availability on a partitioned network, as stated by the [[CAP theorem]].