Distributed data store: Difference between revisions

Revision as of 11:53, 18 February 2025

Latest revision as of 12:48, 10 August 2025

(3 intermediate revisions by 3 users not shown)

Line 1:

{{Short description|A computerComputer network with 2 or moremulitple nodes to store information}}

{{Essay-like|date=May 2012}}

{{Memory types}}

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 fact|urldate=https://www.sciencedirect.com/topics/computer-science/distributed-data-storageAugust |title=Distributed Data Storage - an overview &#124; ScienceDirect Topics |format= |accessdate=2025}}</ref>

==Distributed databases==

Line 36:

In peer network data stores, the user can usually reciprocate and allow other users to use their computer as a storage node as well. Information may or may not be accessible to other users depending on the design of the network.

Most [[peer-to-peer]] networks do not have distributed data stores in that the user's data is only available when their node is on the network. However, this distinction is somewhat blurred in a system such as [[BitTorrent (protocol)|BitTorrent]], where it is possible for the originating node to go offline but the content to continue to be served. Still, this is only the case for individual files requested by the redistributors, as contrasted with networks such as [[FreenetHyphanet]], [[Winny]], [[Share (P2P)|Share]] and [[Perfect Dark (P2P)|Perfect Dark]] where any node may be storing any part of the files on the network.

Distributed data stores typically use an [[error detection and correction]] technique.