Using a super column family is something similar to that in distributed data stores.

This is not the case in distributed data stores, where the concept of a table only vaguely exists.

The keyspace is the highest abstraction in a distributed data store.

A tombstone is a deleted record in a replica of a distributed data store.

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

In a distributed data store, it suffices to access only the second standard column family, as the rest of information is irrelevant.

Dynamo is a proprietary, highly available key-value structured storage system or a distributed data store.

Clustering elasticity is the ease of adding or removing nodes from the distributed data store.

A distributed data store is a computer network where information is stored on more than one node, often in a replicated fashion.

The Voldemort distributed data store has following properties:

There is no way to sort columns, nor to query an arbitrary query in distributed data stores.

Freenet is a censorship-resistant distributed data store.

According to the CAP theorem, distributed data stores cannot guarantee consistency, as availability is a more important issue.

Heroku uses Doozerd which implements Paxos for its consistent distributed data store.

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.

A column of a distributed data store is a NoSQL object of the lowest level in a keyspace.

Accessing the data in a distributed data store would be expensive (time-consuming), if it would be saved in form of a table.

The difference between a distributed file system and a distributed data store can be vague, but DFSes are generally geared towards use on local area networks.

In a distributed data store, the same table would be implemented by creating columns families for "UID, first name, surname", "birthdate, gender", etc.

So, in distributed data stores, the whole burden to handle rows that may even change from data-store update to update lies on the shoulders of the programmers.

Therefore, instead of deleting the information, the distributed data store makes out of the information to be deleted a tombstone, which does not appear anymore to the user.

(This is also why FEC is used in data storage systems such as RAID and distributed data store).

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.

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.

Keyspace (distributed data store), an object in NoSQL data stores that can be seen as a schema in RDBMS databases.