Distributed data store

A distributed data store is a blurred concept and means either a distributed database where users store their information on a number of nodes, or a network in which a user stores their information on a number of peer network nodes .

Distributed databases

Distributed data store are non-relational databases that make a quick access to data over a large number of nodes possible. Examples for this kind of data stores are Google's BigTable, which is much more than a distributed file system or a peer-to-peer network^[1], Amazon's Dynamo^[2] and Windows Azure Storage^[3].

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 have both consistency, availability, and partition tolerance of the network, as it has been proven by the CAP theorem.

Peer network node data stores

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 of the 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, 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 a network such as Freenet where all computers are made available to serve all files.

Distributed data stores typically use an error detection and correction technique. Some distributed data stores (such as Parchive over NNTP) use forward error correction techniques to recover the original file when parts of that file are damaged or unavailable. Others try again to download that file from a different mirror.

Examples

Distributed non-relational databases

• Apache Cassandra, the data store of Facebook
• BigTable, the data store of Google
• Dynamo of Amazon
• HBase
• Riak
• Voldemort

Peer network node data stores

• BitTorrent
• Chord project
• GNUnet
• Freenet
• NNTP (the distributed data storage protocol used for Usenet news)
• Mnet
• Storage@home

References

1. ^ "BigTable: Google's Distributed Data Store". http://the-paper-trail.org/: Paper Trail. http://the-paper-trail.org/blog/?p=86. Retrieved 2011-04-05. "Although GFS provides Google with reliable, scalable distributed file storage, it does not provide any facility for structuring the data contained in the files beyond a hierarchical directory structure and meaningful file names. It’s well known that more expressive solutions are required for large data sets. Google’s terabytes upon terabytes of data that they retrieve from web crawlers, amongst many other sources, need organising, so that client applications can quickly perform lookups and updates at a finer granularity than the file level. [...] The very first thing you need to know about BigTable is that it isn’t a relational database. This should come as no surprise: one persistent theme through all of these large scale distributed data store papers is that RDBMSs are hard to do with good performance. There is no hard, fixed schema in a BigTable, no referential integrity between tables (so no foreign keys) and therefore little support for optimised joins." 
2. ^ Sarah Pidcock (2011-01-31). "Dynamo: Amazon’s Highly Available Key-value Store". http://www.cs.uwaterloo.ca/: WATERLOO. p. 2/22. http://www.cs.uwaterloo.ca/~kdaudjee/courses/cs848/slides/sarah1.pdf. Retrieved 2011-04-05. "Dynamo: a highly available and scalable distributed data store" 
3. ^ "Windows Azure Storage". 2011-09-16. http://www.microsoft.com/windowsazure/features/storage/. Retrieved 6 November 2011. 

See also

Computer Science portal

• Data store
• Distributed file system
• Keyspace, the DDS schema
• Peer-to-peer
• Distributed hash table

This computer networking article is a stub. You can help Wikipedia by expanding it.v · Categories: Computer network stubs Data management Distributed data storage Distributed data stores Wikimedia Foundation. 2010. Игры ⚽ Нужна курсовая? Sledge Hammer! Bill of lading Look at other dictionaries: Column (data store) — A column consists of a (unique) name, a value, and a timestamp. A column of a distributed data store is a NoSQL object of the lowest level in a keyspace. It is a tuple (a key value pair) consisting of three elements:[1] Unique name: Used to… …   Wikipedia Data store — A data store is a data repository of a set of integrated objects. These objects are modeled using classes defined in database schemas.[1] Data store includes not only data repositories like databases, it is a more general concept that includes… …   Wikipedia Distributed Networking — is a distributed computing network system, said to be distributed when the computer programming and the data to be worked on are spread out over more than one computer, usually over a network. Prior to low cost computer power on the desktop,… …   Wikipedia Distributed file system — For other uses, see Distributed file system (disambiguation). In computing, a distributed file system or network file system is any file system that allows access to files from multiple hosts sharing via a computer network.[1] This makes it… …   Wikipedia Distributed database — A distributed database is a database in which storage devices are not all attached to a common CPU. It may be stored in multiple computers located in the same physical location, or may be dispersed over a network of interconnected computers.… …   Wikipedia Distributed file system (disambiguation) — A distributed file system is a file system where data is distributed across multiple nodes. Distributed file system can also refer to: Shared disk file system, a different approach, also known as cluster file system. Distributed File System… …   Wikipedia Distributed GIS — concerns itself with GI Systems that do not have all of the system components in the same physical location. This could be the processing, the database, the rendering or the user interface. Examples of distributed systems are web based GIS,… …   Wikipedia Data driven journalism — is a journalistic process based on analyzing and filtering large data sets for the purpose of creating a new story. Data driven journalism deals with open data that is freely available online and analyzed with open source tools.[1] Data driven… …   Wikipedia Data mining — Not to be confused with analytics, information extraction, or data analysis. Data mining (the analysis step of the knowledge discovery in databases process,[1] or KDD), a relatively young and interdisciplinary field of computer science[2][3] is… …   Wikipedia Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”