Difference between revisions of "NoSQL"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=== Key-Value Stores === | === Key-Value Stores === | ||
| − | * | + | * Data model: ''(key, value)'' pairs |
| − | + | * Interface: extremely simple | |
*# Operations: '''Insert'''(key, value), '''Fetch'''(key), '''Update'''(key), '''Delete'''(key) | *# Operations: '''Insert'''(key, value), '''Fetch'''(key), '''Update'''(key), '''Delete'''(key) | ||
*# Some allow (non-uniform) '''columns''' <u>within value</u>. | *# Some allow (non-uniform) '''columns''' <u>within value</u>. | ||
| Line 20: | Line 20: | ||
=== Document Stores === | === Document Stores === | ||
| + | |||
| + | * Data model: (key, <u>document</u>) pairs | ||
| + | ** <u>document</u>: JSON, XML, other semistructured formats. | ||
* Interface | * Interface | ||
| − | |||
| − | |||
** Basic operations: '''Insert'''(key, value), '''Fetch'''(key), '''Update'''(key), '''Delete'''(key) | ** Basic operations: '''Insert'''(key, value), '''Fetch'''(key), '''Update'''(key), '''Delete'''(key) | ||
| − | ** Also '''Fetch''' based on document contents (very system/format specific as of Nov 2011) | + | ** Also '''Fetch''' based on document contents (very system-/format-specific as of Nov 2011) |
* Example Systems (as of Nov 2011) | * Example Systems (as of Nov 2011) | ||
| Line 34: | Line 35: | ||
=== Graph Database Systems === | === Graph Database Systems === | ||
| − | + | * Data model: '''nodes''' and '''edges''' | |
| − | |||
** Nodes may have '''properties''' (including '''ID''') | ** Nodes may have '''properties''' (including '''ID''') | ||
** Edges may have '''labels''' or '''roles''' | ** Edges may have '''labels''' or '''roles''' | ||
| + | |||
| + | * Interface | ||
| + | ** Interfaces and query languages vary | ||
| + | ** Single-step vs. "path expressions" vs. full recursion | ||
* Example Systems (as of Nov 2011) | * Example Systems (as of Nov 2011) | ||
| − | ** | + | ** Neo4j |
| − | ** | + | ** FlockDB |
| − | ** | + | ** Pregel |
| − | ** | + | ** (RDF "triple stores" can map to graph databasees) |
Revision as of 18:26, 17 November 2013
Key-Value Stores
- Data model: (key, value) pairs
- Interface: extremely simple
- Operations: Insert(key, value), Fetch(key), Update(key), Delete(key)
- Some allow (non-uniform) columns within value.
- Some allow Fetch on range of keys.
- Implementation: efficiency, scalability, fault-tolerance
- Records distributed to nodes based on key
- Replication
- Single-record transactions, "eventual consistency".
- Example Systems (as of Nov 2011)
- Google BigTable
- Amazon Dynamo,
- Cassandra
- Voldemort
- HBase
Document Stores
- Data model: (key, document) pairs
- document: JSON, XML, other semistructured formats.
- Interface
- Basic operations: Insert(key, value), Fetch(key), Update(key), Delete(key)
- Also Fetch based on document contents (very system-/format-specific as of Nov 2011)
- Example Systems (as of Nov 2011)
- CouchDB
- MongoDB
- SimpleDB
Graph Database Systems
- Data model: nodes and edges
- Nodes may have properties (including ID)
- Edges may have labels or roles
- Interface
- Interfaces and query languages vary
- Single-step vs. "path expressions" vs. full recursion
- Example Systems (as of Nov 2011)
- Neo4j
- FlockDB
- Pregel
- (RDF "triple stores" can map to graph databasees)