Showing posts with label BigTable. Show all posts
Showing posts with label BigTable. Show all posts

Monday, August 25, 2014

Types of NoSQL databases

Hello everyone, in my last blog “NoSQL” I have just listed different categories of NoSQL databases. Now let’s see it in details one by one.
  1.  Key value store
  2. Document store
  3. Column Family store
  4. Graph based


1.     Key value store:
·        This type of model is the most simplest and easiest to implement. The main idea here is use of hash table in which there exist a unique key and a value associated with it.
·        There is no complexity around the key value store data model as it can be implemented very fast and easily.
·        The key can be synthetic or auto generated while the value can be string, JSON, BSON etc.
·         It is schema free and your value is stored as a key eg. In one column you will be having key “Name” and value would be “Kaveri” and in the second column, it’s not necessary mean that you must have the value of name again; it could be different kind of data in the same column in different row.
·        Following table shows the example of key value store data model :
key
Value
“India”
{“09, Sai Anand App, Gangapur Road, Nasik 422013 ,India”}
“US”
{“3975 Fair Ridge Drive. Suite 200 South, Fairfax, VA 22033″}
“CA”
{“47112,warm springs blvd #103 Fremont, CA, United States 94539”}

·        This key/value type database allow clients to read and write values using a key as follows:
§  Get(key): returns the value associated with the provided key.
§  Put(key, value): associates the value with the key.
§  Multi-get(key1, key2, .., keyN): returns the list of values associated with the list of keys.
§  Delete(key): removes the entry for the key from the data store.
·        Example of key value store databases are: Memcached, Coherence,  Redis ,Riak and Amazon’s DynamoDB are the most popular key-value store NoSQL databases.
2.     Document store:
·        These kinds of NoSQL databases are very interesting because instead of rows and columns data is stored in documents, this semi structured data is simply stored in JSON, BSON.
·        Document database were inspired by Lotus and are similar to key value store. The model is basically documents that are collection of other key value collections.
·        Document databases are next level of key value. It supports querying more efficiently.
·        Document database would look like,


·        Example of  document databases are: Mango,CouchDB,Cloudant.
3. Column family store: 
·        Column family types were created to store and process very large amount of data distributed over many machines.
·        This type of NoSQL databases are not schema free. They are kinds of semi structured database which means you need to specify a group of column in these databases and they are called column families.
·        There are still keys but they point to multiple column arranged by column family.
·        A column family database can have different column on each row so is not relational and doesn’t qualifies in an RDBMS as a table
·        The implementation of column family much similar to the Google’s BigTable .
·        Colum family work better with complex dataset.
·        Example of column family databases are BigTable,Hbase,Accumulo.
4. Graph databases:
·        Instead of table of rows and columns and fixed structure of SQL, a flexible graph model is used which can gain scale across the multiple machines.
·        Graph structures are used with edges, nodes and properties which provides index-free adjacency. Data can be easily transformed from one model to the other using a Graph Base NoSQL database.
·        Graph database takes the document database to the extreme by introducing the concept of type of relationship between document and nodes. For example relationship present between the people on social network such as Facebook.
·        It uses sophisticated shortest path algorithm to make data querying more efficient.
·        Although it is slower than its other NoSQL counter paths a graph database can have the most complex structure and still traverse billions of nodes and relationship with light speed.


·        Example of graph databases are: Neo4j,Sones, InfiniteGraph, AllegroGraph, OrientDB, InfoGrid

Tuesday, August 19, 2014

NoSQL Databases

       NoSQL is next generation DBMS which is used to store and retrieve the data which does not have specific format or table like structure. NoSQL database is also called as “Not only SQL” to emphasize that it does not use SQL language but It uses SQL-like language. The original intension has been modern web scale databases. The movement began in early 2009 and growing rapidly. NoSQL databases are mostly addressing some of the points:-
·         Non-relational
·         Distributed
·         Open source
·         Horizontally scale

          As we Know there are different types of Database Management System and RDBMS is most commonly used database management system. If we go back in history, first flat file systems were created then in 1970's Codd came up with Relational theory and based on that relational databases were developed. The problem was that in flat file system there was no standard way of storing data and no standard way of communicating with data. Everybody has implementing their own protocol and that was creating lots of inefficiency. So relational database standardized the way we communicate with database. Then life moved on and everything was going well and suddenly, we entered into Big data scenario. Relational databases are unable to handle huge amount of data so the answer was “NoSQL”. So NoSQL was created because of limitations of relational databases.
     The data is structured in relational databases. We have to define table structure in advance, we have to tell the system in advance like table will have 10 rows and 10 columns and each column will take particular data type and this would be the maximum value one can enter and so on. This way we can't handle unstructured data where there is no fixed format or format is always changing. So NoSQL handles both structured and unstructured data.
-NoSQL focused to provide:
·         Scalability
·         Performance
·         High Availability
·         Simple API
·         Schema free
·         Easy replication support
·         Eventually consistent(not ACID)
      NoSQL can handle large amount of data.  As data is keep on growing it provides scalability and high availability in terms of hardware failure. Ability of NoSQL is to handle large amount of data with amazing performance with comparison they offers less functionality than RDBMS.

     NoSQL is category which can be commonly further divided into three categories given below with example:
·         Key Value Store : Memcached,Coherence, Redis
·         Tabular : BigTable,Hbase,Accumulo
·         Document oriented : Mango,CouchDB,Cloudant
If you search you will find more categories. Here is the list of some:
·         Column store/Column family
·         Document store
·         Key value store/Tuple sore
·         Graph database
·         Multimodel database
·         Object database
·         Grid and Cloud solution
·         XML database
·         Multidimensional database
·         Event sourcing
·         Network model
·         Other NoSQL related databases
·         Unsolved and uncategorized

      So what is missing from NoSQL databases if you compare them with relational databases? Well Joins are not there because of this joins relational databases are not so scalable. So in NoSQL databases this functionality is not implemented hence scalability and performance comes in. The support for complex transaction is not there for example you can’t not do insert three records then update two records and check something if it’s not then rollback everything. Again constraint support is not there. Transaction support and constraint support is not there on database level but transaction support and constraint support can be applied on application level.

 What are the situations or scenarios where one can use NoSQL database?
·         The ability to store and retrieve great quantity of data is important.
·         Storing relationship between elements is not important.
·         Dealing with growing list of elements, example: Twitter post, Internet server logs, Blogs.
·         The data is not structured or the structure is changing with the time.
·          Prototype or fast application need to be developed
·         Constraints and validation logic is not required to be implemented in database.
What are the situations or scenarios where not to use NoSQL database?
·         Complex transactions need to be handled
·         Joins must be handled by databases
·         Validations must be handled by databases



  

     

Thursday, February 28, 2013

BigTable used by Google

In the world of cloud computing and many web based applications, the most essential is a database that can accommodate a large number of details of large numbers of users. Traditionally relational databases present a view that is composed of multiple tables, each with rows and named columns. And the queries mostly performed in SQL allow one to extract specific columns from a row where certain conditions are met. In traditional database, ACID properties i.e. atomic, consistent, isolated and durable are the main aspects. But many times it is impossible to guarantee consistency. So the ACID properties of database make uncomfortable for highly distributed environments. So the alternative storage system that highly distributed environments like Google used is BigTable.
 
BigTable is a distributed storage system that is structured as a large table that may be petabytes in size and distributed among thousands of machines. BigTable is described as a fast and extremely scalable DBMS (database management system). BigTable is a compressed, high performance and proprietary data storage system built on Google File System, Chubby Lock Service, SSTable and a few other Google technologies. But it is just used by Google and is not distributed outside Google although Google allows access to it as a part of Google App Engine.
 
                                                  Fig 1: Google BigTable
BigTable development was started in 2004 and now it is widely used by the Google applications such as web indexing, Google Reader, Google Maps, Google Book Search, Google Earth, Blogger.com, Orkut, YouTube, Gmail etc.
BigTable maps two arbitrary string values (row key and column key) and timestamp, hence three dimensional mapping into an associated arbitrary byte array. There can be multiple versions of a cell with different timestamps. In order to manage the huge tables, BigTable splits the tables at row boundaries and saves them as tablets. Each tablet is around 200MB, and each server serves about 100 tablets. This set up allows tablets from a single table to be spread among many machines. It also allows for load balancing, because if one table is receiving many queries, it can move the busy table to another machine that is not so busy. Also if some machine goes down, tables may be spread to other machines so that performance of all given machine is minimal. Tables are stored as immutable SSTables and logs of all the machines. When machine’s system memory is full, it compresses some tablets by using Google proprietary compression techniques such as Zippy and BMDiff. The locations of BigTable tablets are stored in cells. The particular tablet is handled by three-tiered system.
                                                                                                                                                                                     
                       
                                                     Fig 2: BigTable Architecture
BigTable is not like a relational database and can be defined as a sparse, distributed multi-dimensional sorted map.

Sparse:  The table is sparse which means that different rows in a table may use different columns, in which many of the columns that are used may be empty for that particular row.

distributed: BigTable’s data is distributed among many independent machines. As in Google, BigTable is built on top of Google File System.

sorted: In BigTable, a key is hashed to a position in a table. BigTable sorts its data by keys. This helps to keep the related data close together on the same machine.

Google has built its own database storage system for the reason of scalability and better control of performance characteristics.