Scribd
Upload
74 views

NoSQL Data Management

The document discusses different types of NoSQL databases: 1) Key-value stores use a hash table to access data values with unique string keys, allowing flexible data formats. 2) Wide column stores are like key-value stores but with multi-dimensional keys to organize related data. 3) Graph databases represent data as nodes and edges to model interconnected data like social networks. 4) Document stores organize data into flexible, self-describing documents that can vary in structure, such as JSON or BSON documents.

Uploaded by

Kajal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
74 views

NoSQL Data Management

The document discusses different types of NoSQL databases: 1) Key-value stores use a hash table to access data values with unique string keys, allowing flexible data formats. 2) Wide column stores are like key-value stores but with multi-dimensional keys to organize related data. 3) Graph databases represent data as nodes and edges to model interconnected data like social networks. 4) Document stores organize data into flexible, self-describing documents that can vary in structure, such as JSON or BSON documents.

Uploaded by

Kajal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

UNIT-3 Topic : NoSQL Data Management

Kinds of NoSQL databases & its examples:

NoSQL refers to a general class of storage engines that store data in a non-relational format. This is in contrast to traditional RDBMS in which data is
stored in tables that have data that relate to each other. NoSQL stands for "Not Only SQL" and isn't meant as a rejection of traditional databases.

Such databases have existed since the late 1960s, but the name "NoSQL" was only coined in the early 21st century, triggered by the needs of Web 2.0
companies.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 or sit alongside SQL databases in polyglot-persistent architectures
Key - Value Column Family

Key-Value stores Key-Value based storage systems are basically


associative arrays, consisting of keys and values. Each key has to A wide column store can be seen as a Key-Value. store, with a two-
be unique to provide non-ambiguous identification of values dimensional key: A stored value is referenced by a column key and a row key.
While keys are mostly simple objects, values can be lists, sets or The key can be further extended by a timestamp, as is the case in Google’s
also hashes again, allowing for more complex data structures BigTable . Depending on the implementation, there are more extensions to
the key possible, mostly called “keyspaces” or “domains” Thus keys in wide
• Simplest NOSQL databases column stores can have many dimensions, resulting in a structure similar to a
multidimensional, associative array.
• The main idea is the use of a hash table An example for storing data in a wide column system using a two-
dimensional key is given in Figure 1.3.
• Access data (values) by strings called keys
• The column is lowest/smallest instance of data.
• Data has no required format data may have any format • It is a tuple that contains a name, a value and a timestamp
• Data model: (key, value) pairs • This is HBASE design
BasicOperations: Insert(key,value), Fetch(key), Update(key),  We’ll skip this case
Delete(key)
Graph data base
As the name indicates, in systems of this category data is represented by
graphs. Graph databases are best suited for representing data with a high,
yet flexible number of interconnections, especially when information about
those interconnections is at least as important as the represented data [2].
Such information can be, for example, social relations or geographic data.
Figure 1.4 shows how data can be represented by a graph. Graph databases
allow for queries on the graph structure, e.g. on relations between nodes or
shortest paths. Implementations of graph databases can support such
queries efficiently by using well studied graph algorithms [19][11]
Document store
In a document store, data is stored in so-called documents. Here the term documents refers to arbitrary data in some structured data format.
Examples for used formats are JSON [3], BSON (see Section 1.4.1) or XML [21]. While the type of data format is typically fixed by the document store,
the structure is flexible. In a JSON-based document store, for example, documents with completely different sets of attributes can be stored
together, as long as they are valid JSON documents. In Figure 1.5 data stored in a JSON-based document database is illustrated. The chosen data
format can be interpreted by the storage system. This allows the system to offer fine-grained read and write operations on properties of a stored
document, in contrary to a Key-Value system, where the stored value typically is not further understood by the system.• Pair each key with complex
data structure known as a document. • Documents can contain many different key-value pairs, or key-array pairs, or even nested documents.
Relational Database Vs NoSQL Database:

You might also like