||The neutrality of this article's introduction is disputed. (July 2015)|
A NoSQL (originally referring to "non SQL") database provides a mechanism for storage and retrieval of data that is modeled in means other than the tabular relations used in traditional relational databases. Such databases have existed since the late 1960s, but did not obtain the "NoSQL" moniker until during a surge in popularity in the early twenty-first century, triggered by the storage needs of Web 2.0 companies such as Facebook, Google and Amazon.com.
Motivations for this approach include simplicity of design; simpler "horizontal" scaling to clusters of machine, which is a problem for relational databases; and finer control over availability. The data structures used by NoSQL databases (e.g. key-value, graph, or document) differ slightly from those used by default in relational databases, making some operations faster in NoSQL and others faster in relational databases. The particular suitability of a given NoSQL database depends on the problem it must solve. Sometimes the data structures used by noSQL databases are also viewed as "more flexible" than relational database tables.
NoSQL databases are increasingly used in big data and real-time web applications. NoSQL systems are also sometimes called "Not only SQL" to emphasize that they may support SQL-like query languages.
Many NoSQL stores compromise consistency (in the sense of the CAP theorem) in favor of availability, partition tolerance, and speed. Barriers to the greater adoption of NoSQL stores include the use of low-level query languages (instead of SQL, for instance the lack of ability to perform ad-hoc JOIN's across tables), lack of standardized interfaces, and huge previous investments in existing relational databases. Most NoSQL stores lack true ACID transactions, although a few recent systems, such as FairCom c-treeACE, Google Spanner (though technically a NewSQL database), FoundationDB, Symas LMDB and OrientDB have made them central to their designs. (See ACID and JOIN Support.) Instead they offer a concept of "eventual consistency" in which database changes are propagated to all nodes "eventually" (typically with milliseconds) so queries for data might not return updated data immediately.
Unfortunately, not all NoSQL systems live up to the promised "eventual consistency" and partition tolerance, but in experiments with network partitioning often exhibited lost writes and other forms of data loss. Fortunately, some NoSQL systems provide concepts such as "Write Ahead Logging" to avoid data loss. Current relational databases also "do not allow referential integrity constraints to span databases" as well.
- 1 History
- 2 Types and examples of NoSQL databases
- 3 Performance
- 4 Handling relational data
- 5 ACID and JOIN Support
- 6 See also
- 7 References
- 8 Further reading
- 9 External links
The term NoSQL was used by Carlo Strozzi in 1998 to name his lightweight, Strozzi NoSQL open-source relational database that did not expose the standard SQL interface, but was still relational. His NoSQL RDBMS is distinct from the circa-2009 general concept of NoSQL databases. Strozzi suggests that, as the current NoSQL movement "departs from the relational model altogether; it should therefore have been called more appropriately 'NoREL'", referring to 'No Relational'.
Eric Evans reintroduced the term NoSQL in early 2009 when Johan Oskarsson of Last.fm organized an event to discuss open-source distributed databases. The name attempted to label the emergence of an increasing number of non-relational, distributed data stores. Most of the early NoSQL systems did not attempt to provide atomicity, consistency, isolation and durability guarantees, contrary to the prevailing practice among relational database systems.
Types and examples of NoSQL databases
There have been various approaches to classify NoSQL databases, each with different categories and subcategories, some of which overlap. A basic classification based on data model, with examples:
- Column: Accumulo, Cassandra, Druid, HBase, Vertica
- Document: Clusterpoint, Apache CouchDB, Couchbase, DocumentDB, HyperDex, Lotus Notes, MarkLogic, MongoDB, OrientDB, Qizx
- Key-value: CouchDB, Oracle NoSQL Database, Dynamo, FoundationDB, HyperDex, MemcacheDB, Redis, Riak, FairCom c-treeACE, Aerospike, OrientDB, MUMPS
- Graph: Allegro, Neo4J, InfiniteGraph, OrientDB, Virtuoso, Stardog
- Multi-model: OrientDB, FoundationDB, ArangoDB, Alchemy Database, CortexDB
A more detailed classification is the following, based on one from Stephen Yen:
|Type||Examples of this type|
|Key-Value Cache||Coherence, eXtreme Scale, GigaSpaces, GemFire, Hazelcast, Infinispan, JBoss Cache, Memcached, Repcached, Terracotta, Velocity|
|Key-Value Store||Flare, Keyspace, RAMCloud, SchemaFree, Hyperdex, Aerospike|
|Key-Value Store (Eventually-Consistent)||DovetailDB, Oracle NoSQL Database Dynamo, Riak, Dynomite, MotionDb, Voldemort, SubRecord|
|Key-Value Store (Ordered)||Actord, FoundationDB, Lightcloud, LMDB, Luxio, MemcacheDB, NMDB, Scalaris, TokyoTyrant|
|Tuple Store||Apache River, Coord, GigaSpaces|
|Object Database||DB4O, Objectivity/DB, Perst, Shoal, ZopeDB,|
|Document Store||Clusterpoint, Couchbase, CouchDB, DocumentDB, Lotus Notes, MarkLogic, MongoDB, Qizx, XML-databases|
|Wide Columnar Store||BigTable, Cassandra, Druid, HBase, Hypertable, KAI, KDI, OpenNeptune, Qbase|
Correlation databases are model-independent, and instead of row-based or column-based storage, use value-based storage.
Key-value (KV) stores use the associative array (also known as a map or dictionary) as their fundamental data model. In this model, data is represented as a collection of key-value pairs, such that each possible key appears at most once in the collection.
The key-value model is one of the simplest non-trivial data models, and richer data models are often implemented on top of it. The key-value model can be extended to an ordered model that maintains keys in lexicographic order. This extension is powerful, in that it can efficiently process key ranges.
Key-value stores can use consistency models ranging from eventual consistency to serializability. Some support ordering of keys. Some maintain data in memory (RAM), while others employ solid-state drives or rotating disks.
The central concept of a document store is the notion of a "document". While each document-oriented database implementation differs on the details of this definition, in general, they all assume that documents encapsulate and encode data (or information) in some standard formats or encodings. Encodings in use include XML, YAML, and JSON as well as binary forms like BSON. Documents are addressed in the database via a unique key that represents that document. One of the other defining characteristics of a document-oriented database is that in addition to the key lookup performed by a key-value store, the database offers an API or query language that retrieves documents based on their contents
Different implementations offer different ways of organizing and/or grouping documents:
- Non-visible metadata
- Directory hierarchies
Compared to relational databases, for example, collections could be considered analogous to tables and documents analogous to records. But they are different: every record in a table has the same sequence of fields, while documents in a collection may have fields that are completely different.
This kind of database is designed for data whose relations are well represented as a graph (elements interconnected with an undetermined number of relations between them). The kind of data could be social relations, public transport links, road maps or network topologies, for example.
- Graph databases and their query language
|DEX/Sparksee||C++, Java, .NET, Python||High-performance graph database|
|IBM DB2||SPARQL||RDF GraphStore added in DB2 10|
|InfiniteGraph||Java||High-performance, scalable, distributed graph database|
|OWLIM||Java, SPARQL 1.1||RDF graph store with reasoning|
|Sqrrl Enterprise||Java||Distributed, real-time graph database featuring cell-level security|
|OpenLink Virtuoso||C++, C#, Java, SPARQL||middleware and database engine hybrid|
|Stardog||Java, SPARQL||semantic graph database|
- InterSystems Caché
- NeoDatis ODB
- OpenLink Virtuoso
- Versant Object Database
Triple/quad store (RDF) database
- Apache JENA (It's a framework, not a database)
- Oracle NoSQL database
- Virtuoso Universal Server
- Amazon DynamoDB
- Amazon SimpleDB
- Datastore on Google Appengine
- Clusterpoint database
- Cloudant Data Layer (CouchDB)
- OpenLink Virtuoso
- D3 Pick database
- Extensible Storage Engine (ESE/NT)
- InterSystems Caché
- Northgate Information Solutions Reality, the original Pick/MV Database
- Revelation Software's OpenInsight
- Rocket U2
Ben Scofield rated different categories of NoSQL databases as follows: 
|Key–Value Store||high||high||high||none||variable (none)|
|Document-Oriented Store||high||variable (high)||high||low||variable (low)|
|Graph Database||variable||variable||high||high||graph theory|
|Relational Database||variable||variable||low||moderate||relational algebra|
Performance and scalability comparisons are sometimes done with the YCSB benchmark.
Handling relational data
Since most NoSQL databases lack ability for joins in queries, the database schema generally needs to be designed differently. There are three main techniques for handling relational data in a NoSQL database. (See table Join and ACID Support for NoSQL databases that support joins.)
Instead of retrieving all the data with one query, it's common to do several queries to get the desired data. NoSQL queries are often faster than traditional SQL queries so the cost of having to do additional queries may be acceptable. If an excessive number of queries would be necessary, one of the other two approaches is more appropriate.
Instead of only storing foreign keys, it's common to store actual foreign values along with the model's data. For example, each blog comment might include the username in addition to a user id, thus providing easy access to the username without requiring another lookup. When a username changes however, this will now need to be changed in many places in the database. Thus this approach works better when reads are much more common than writes.
With document databases like MongoDB it's common to put more data in a smaller number of collections. For example in a blogging application, one might choose to store comments within the blog post document so that with a single retrieval one gets all the comments. Thus in this approach a single document contains all the data you need for a specific task.
ACID and JOIN Support
If a database is marked as supporting ACID or joins, then the documentation for the database makes that claim. The degree to which the capability is fully supported in a manner similar to most SQL databases or the degree to which it meets the needs of a specific application is left up to the reader to assess.
- CAP theorem
- Comparison of object database management systems
- Comparison of structured storage software
- Correlation database
- Distributed cache
- Faceted search
- MultiValue database
- Multi-model database
- http://www.eventbrite.com/e/nosql-meetup-tickets-341739151 especially "Don't mind trading a query language for scalability? "
- Leavitt, Neal (2010). "Will NoSQL Databases Live Up to Their Promise?" (PDF). IEEE Computer.
- Mohan, C. (2013). History Repeats Itself: Sensible and NonsenSQL Aspects of the NoSQL Hoopla (PDF). Proc. 16th Int'l Conf. on Extending Database Technology.
- http://www.eventbrite.com/e/nosql-meetup-tickets-341739151 "Dynamo clones and BigTables"
- http://www.wired.com/2012/01/amazon-dynamodb/ "Amazon helped start the “NoSQL” movement."
- http://www.allthingsdistributed.com/2012/01/amazon-dynamodb.html "Customers like SimpleDB’s table interface and its flexible data model. Not having to update their schemas when their systems evolve makes life much easier"
- "RDBMS dominate the database market, but NoSQL systems are catching up". DB-Engines.com. 21 Nov 2013. Retrieved 24 Nov 2013.
- "NoSQL (Not Only SQL)".
NoSQL database, also called Not Only SQL
- Fowler, Martin. "NosqlDefinition".
many advocates of NoSQL say that it does not mean a "no" to SQL, rather it means Not Only SQL
- Grolinger, K.; Higashino, W. A.; Tiwari, A.; Capretz, M. A. M. (2013). "Data management in cloud environments: NoSQL and NewSQL data stores" (PDF). JoCCASA, Springer. Retrieved 8 Jan 2014.
- Martin Zapletal: Large volume data analysis on the Typesafe Reactive Platform, ScalaDays 2015, Slides
- http://www.dummies.com/how-to/content/10-nosql-misconceptions.html "NoSQL databases lose data" section
- Lith, Adam; Mattson, Jakob (2010). "Investigating storage solutions for large data: A comparison of well performing and scalable data storage solutions for real time extraction and batch insertion of data" (PDF). Göteborg: Department of Computer Science and Engineering, Chalmers University of Technology. p. 70. Retrieved 12 May 2011.
Carlo Strozzi first used the term NoSQL in 1998 as a name for his open source relational database that did not offer a SQL interface[...]
- "NoSQL Relational Database Management System: Home Page". Strozzi.it. 2 October 2007. Retrieved 29 March 2010.
- "NoSQL 2009". Blog.sym-link.com. 12 May 2009. Retrieved 29 March 2010.
- Chapple, Mike. "The ACID Model".
- "DB-Engines Ranking". Retrieved 2015=07-31. Check date values in:
- Yen, Stephen. "NoSQL is a Horseless Carriage" (PDF). NorthScale. Retrieved 2014-06-26..
- Sandy (14 January 2011). "Key Value stores and the NoSQL movement". http://dba.stackexchange.com/questions/607/what-is-a-key-value-store-database: Stackexchange. Retrieved 1 January 2012.
Key-value stores allow the application developer to store schema-less data. This data usually consists of a string that represents the key, and the actual data that is considered the value in the "key-value" relationship. The data itself is usually some kind of primitive of the programming language (a string, an integer, or an array) or an object that is being marshaled by the programming language's bindings to the key-value store. This structure replaces the need for a fixed data model and allows proper formatting.
- Seeger, Marc (21 September 2009). "Key-Value Stores: a practical overview" (PDF). http://blog.marc-seeger.de/2009/09/21/key-value-stores-a-practical-overview/: Marc Seeger. Retrieved 1 January 2012.
Key-value stores provide a high-performance alternative to relational database systems with respect to storing and accessing data. This paper provides a short overview of some of the currently available key-value stores and their interface to the Ruby programming language.
- Katsov, Ilya (1 March 2012). "NoSQL Data Modeling Techniques". Ilya Katsov. Retrieved 8 May 2014.
- Scofield, Ben (2010-01-14). "NoSQL - Death to Relational Databases(?)". Retrieved 2014-06-26.
- "Making the Shift from Relational to NoSQL" (PDF). Couchbase.com. Retrieved December 5, 2014.
- Sadalage, Pramod; Fowler, Martin (2012). NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence. Addison-Wesley. ISBN 0-321-82662-0.
- McCreary, Dan; Kelly, Ann (2013). Making Sense of NoSQL: A guide for managers and the rest of us. ISBN 9781617291074.
- Strauch, Christof (2012). "NoSQL Databases" (PDF).
- Moniruzzaman, A. B.; Hossain, S. A. (2013). "NoSQL Database: New Era of Databases for Big data Analytics - Classification, Characteristics and Comparison". arXiv:1307.0191.
- Orend, Kai (2013). "Analysis and Classification of NoSQL Databases and Evaluation of their Ability to Replace an Object-relational Persistence Layer". CiteSeerX: 10
.1 .1 .184 .483.
- Krishnan, Ganesh; Kulkarni, Sarang; Dadbhawala, Dharmesh Kirit. "Method and system for versioned sharing, consolidating and reporting information".
- Strauch, Christoph. "NoSQL whitepaper" (PDF). Stuttgart: Hochschule der Medien.
- Edlich, Stefan. "NoSQL database List".
- Neubauer, Peter (2010). "Graph Databases, NOSQL and Neo4j".
- Bushik, Sergey (2012). "A vendor-independent comparison of NoSQL databases: Cassandra, HBase, MongoDB, Riak". NetworkWorld.
- Zicari, Roberto V. (2014). "NoSQL Data Stores – Articles, Papers, Presentations". odbms.org.