Big Data/Analytics Zone is brought to you in partnership with:

I am a developer and project manager of CUBRID open source database. I often interact with CUBRID user community answering to their questions and helping them resolve CUBRID related issues. Beside the CUBRID project, I contribute to various open source projects like Hibernate, CodeIgniter, Yii, etc. Personally I am very interested in big data, scalability, and single page real-time Web apps. I enjoy reading (a lot!) and writing tech articles. I have written over one hundred blogs at http://www.cubrid.org/blog and even more tutorials. Esen is a DZone MVB and is not an employee of DZone and has posted 43 posts at DZone. You can read more from them at their website. View Full User Profile

Commercial and Open Source Big Data Platforms Comparison

10.04.2012
| 13799 views |
  • submit to reddit
Curator's note: This post was authored by Lee Kyu Jae.

 

Dealing with Future Problems

The reason why we need to be concerned over problems that have not yet occurred is to secure sufficient response time. Sufficient time will enable us to take full consideration before making decisions as well as preparation. Therefore, it is invaluable to predict upcoming events and be concerned about future problems.

To solve matters in hand, explicit recognition is needed.

What kind of skills do we need to solve problems?


Intuition
and data analysis skills. The merging of the two elements is critical. Intuition is necessary to determine which data to analize; also some degree of intuition is required as you have to deal with events that have not yet occurred, even if you handled massive data analysis well. It is obvious though that decision making based on data analysis is more trustworthy than intuition. Because it excludes tendency, taste, and experience of a decision marker, allowing an objective approach to problems.

This article covers technical details on how to effectively analyze data from a platform perspective. It is so-called “big data.” The big data technology allows storing a large amount of data, searching meaningful data for visualization, enabling predictive analysis, thereby, internalizing business process for application.

useful_tech_for_present_and_future.png

Figure 1: Useful technology for the present and the future.
(Big data, Analytics and the Path from Insights to Value, MIT Solan management review, Winter 2011.)

There are several priorities that we need to check before handling big data.

First, data is important by nature. The increased amount of data is not the reason. The increased amount of data has made it harder to process with the existing software.

Second, we can obtain significant results from data and technical elements only by interaction and repetitive action with people who analyze, use, and determine the elements. Understanding for applications and businesses is imperative and you must define clear definitions to resolve problems, including decision making on which data needs to be analyzed and processed. There is no such a system that automatically handles overall tasks, such as, how to process data, which analysis algorithm and processing systems to use, and how to interpret results.

Lastly, analysis based on data should be closely connected with business processes and management of the corresponding organization.

What is Big Data?

Big data means immense amount of data, so much so that it is difficult to collect, store, manage, and analyze via general database software. In general, the meaning of “immense amount of data” is classified into three types as follows:

  • Volume: There is too much data to be stored and require too many processes—semantic analysis/data processing. These are the two elements that we need to understand.
  • Velocity: It means storage and processing speed.
  • Variety: The demand for unstructured data, such as text and images is increasing as well as refined-type data that can be standardized and previously defined like the RDBMS table record.

In addition to the three aspects, “value” is added in the standpoint that value can be created only when data is analyzed.

What kind of data should be stored?


We can think of data produced by corporate environment, including customer information, service log, and ERP (Enterprise Resource Planning). There are also CDR (Call Detailed Record) generated from telecom companies, machinery such as planes, oil pipelines, and power cables, or sensor data and metering data of platforms. Web servers or application logs could be a target, and there is user created data from social media blogs, mail, and bulletin boards. In short, everything that can be measured and stored could be a target for analysis.

Such data has been managed and analyzed from long before. But why is it the term big data is emerging now?


Environmental Factor

It is necessary to mention briefly environmental factors that make it big data attractive.

what_makes_big_data_attractive.png

Figure 2: What makes big data attractive.

With the rise of personalized and social services, restructuring is occurring in the existing Internet service environment. From the Internet Web service environment that focused on searching/porter sites, there is demand for personalized & social services in the whole service area, such as telecommunication, game, music, search, shopping, etc. This is why the scale-out technology is becoming more important than the scale-up storage. Moreover, for complicated functions, storage size, and processing requirement that analyze the relationship between individuals or personal preference, data processing technology beyond the scope of OLTP is becoming increasingly important.

The universalization of the mobile environment generated the existing data and many changes were made to the consuming source environment. Users’ mobile and activity information is becoming data to be stored and analyzed. Cloud-based information processing technology for portability between different devices, such as smartphones, PCs, and TVs, is a reality.

It is now feasible to provide mass data storage, processing, and servicing at the appropriate level of investment through enhanced trend of the IT environment (IaaS), platform environment (PaaS), and service environment (SaaS), which are represented as cloud computing.

Large-scale data processing systems released by leading Internet firms, such as Google, are being recreated by open-source territory, which can be used in a development environment.

Efficient storage of large data and processing capability according to all the environmental factors are closely related to business competition.

Platformization of data storage and processing functionality by many software organizations and companies enable easy use of services. Small groups or companies are now able to utilize the big data technology, which used to be exclusive to large firms, due to the difficulty in securing specialized manpower and high costs.

Platform Technology that Handles Big Data

We will classify various platforms into three aspects — “Storage System”, “Handling”, and “Analysis Method” — and describe related products and technology. While some of them are unsuitable for such a classification standard, we believe the approach is easy to understand intuitively.

Storage System Aspect

  • Parallel DBMS
  • NoSQL

Both the Parallel DBMS and NoSQL are identical in that they use the scale-out expansion approach in order to store large data.

Note that there are also the existing storage technologies, namely SAN and NAS, and cloud file storage systems, known as Amazon S3 or OpenStack Swift, as well as distributed file systems, such as GFS and HDFS, which are technologies for storing large data.

Parallel DBMS

Michael Stonebraker, a pioneer who led PostgreSQL development, an open source database, made prototype systems, such as H-Store and C-Store, and demonstrated that while the existing RDBMS technology was designed to fit all areas with a single system, systems that have specialized in architecture are far more superior in handling OLAP, text, streaming, and high-dimensional data.[1]

According to Stonebraker, there have been many environmental changes compared to the time when RDBMS was first designed and implemented; thus, such changes should be reflected to the existing OLTP processing area. For example, he said that disk in the 1970s used to be regarded as memory nowadays. The disk log and disaster recovery system by tape backup should be changed to a high-cost structure of the “k-safe environment” (that is, duplication), and reconsider the concurrency technique of conventional lock method according to changes in process technology.

VoltDB

VoltDB is a system consisting of a suitable format to a high-performance OLTP environment. The system is not memory-based data processing or SQL, but it performs sequential processing for data split based on stored procedure and reduces lock overhead with communication, helping to configure the high-speed OLTP system through horizontal split for table data.[2]

voldb_architecture.png

Figure 3: VoltDB architecture.

Figure 3 displays that a certain task that requires to operate in just one partition is executed sequentially in the corresponding partition, and that a certain task that needs to be handled in several partitions are processed by a coordinator. If there are many operations that need to be processed in several partitions, large rows and sizes may not be good.

SAP HANA

SAP HANA is a memory-based storage made from SAP. Its characteristic is to organize a system optimized to analysis tasks, such as OLAP. If all data is inside system memory, maximizing CPU utilization is crucial and the key point is to reduce bottlenecks between memory and CPU cache. In order to minimize Cache miss, consecutive data for processing within the given time is more advantageous, meaning that configuration of column-oriented tables could be favorable when analyzing many OLAP.

There are many advantages of the column-oriented table configuration and typical examples are a high data compression ratio and processing speed. In case of the same data domain, several data domains are better for data compression than when they are combined together. Moreover, the configuration enables reducing CPU operations through a lightweight compression, such as RLE (Run length encoding) or dictionary encoding or executing desired operations without a recovery process for compressed data. The following figure shows a brief comparison with Row-oriented and Column-oriented methods.

comparison_row_oriented_and_column_oriented_methods.png

Figure 4: A Comparison with Row-oriented and Column-oriented methods.

Vertica

Vertica is database specialized for OLAP, which stores data on disk via the column method. The Shared-nothing-oriented MPP structure comprises a storage optimized for writing so as to load data fast, a reading storage in a compressed type, and tuple mover that manages bilateral data flow. Figure 5 below helps to understand the Vertica structure.

vertica_structure.png

Figure 5: Vertica structure.

Greenplum

Greenplum database is a shared-nothing MPP structure, generated based on PostgreSQL. Data to be stored can select Row-oriented or Column-oriented methods accordingly to operations apply to the corresponding data. Data is stored in a server in segment and have availability because of segment unit replication of the log shipping method. A query engine, which was developed based on PostgreSQL, is configured to execute SQL basic operation (hash-join, hash-aggregation) or a map-reduce program so as to effectively process parallel query or map-reduced type programs. Each process node is connected to software-oriented data switch component.

greenplum_architecture.png

Figure 6: Greenplum architecture.

IBM Netezza Data Warehouse

IBM Netezza data warehouse has a two-tier type architecture consisted of SMP and MPP, called AMPP (Asymmetric Massively Parallel Processing).

  • A host with a SMP structure operates query execution plan and aggregation results, while S-blade nodes with a MPP structure handles query execution.
  • Each S-blade is connected by a special data processor called FPGA (Field Programmable Gate Array) and disk.
  • Each S-blade and host is connected to network that use IP addresses.

Unlike other systems, FPGA has filtering for data compression, record or column; in transaction processing, it enables filtering or transformation functions, such as visibility check during retrieving data from disk memory for real-time processing. When processing large-date, it adheres to the principles (processing close to the data source), which is to reduce as much unnecessary data as possible from transmission by performing data operation where data is located.

ibm_netezza_data_structure.png

Figure 7: IBM Netezza data architecture.

There are many other solutions for big data processing, namely Teradata, Sybase, and Essbase, traditional and powerful programs.

Parallel DBMS is advanced form of old RDBMS, which in many cases have a MPP structure. In addition, companies and organizations that develop parallel DBMS are taken over by IT conglomerates and are in the progress of development in the appliance type. The names of conglomerates and date of acquisition of aforementioned parallel DBMS are shown in the following table:

Table 1: Names of companies which acquired parallel RDBMS.
The names of companies acquired Database Year
SAP Sybase 2010
HP Vertica 2011
IBM Netezza 2010
Oracle Essbase (Hyperian Solutions) 2007
Teradata Aster Data 2011
EMC Greenplum 2010

NoSQL

In RDBMS, scaling out while supporting ACID (Atomicity, Consistency, Isolation, and Durability) is almost impossible. For storage, data had to be divided into several devices; to be satisfied with ACID that has divided data, you have to use complicated locking and replication methods, which will lead to performance degradation.

NoSQL, a general term for a new storage system has emerged in order to simplify data models for easy definition of shard, which is the basic of distribution, and to make requirements less strict (Eventual Consistency) in a distribution replication environment or constraint isolation.

Since NoSQL is covered many times in our DevPlatform Blogs and there are many places to obtain information, we will not go over the NoSQL products.

Processing Aspects

The key point of parallel processing is Divide and Conquer. That is, data is divided in an independent type and process it in parallel. Just imagine the matrix multiplication that can divide and process each operation. The meaning of big data process is dividing a problem into several small operations, and combine them into a single result. If there is operation dependence, it is certainly impossible to make the best use of the parallel operation. It is necessary to save and process data considering these factors.

Map-Reduce

The most widely known technology that helps to handle large-data would be a distribution data process framework of the Map-Reduce method, such as Apache Hadoop.

Data processing via the Map-reduce method has the following characteristics:

  • It operates via regular computer that uses built-in hard disk, not a special storage. Each computer has extremely weak correlation where expansion can be hundreds and thousands of computers.
  • Since many computers are participating in processing, system errors and hardware errors are assumed as general circumstances, rather than exceptional.
  • With a simplified and abstracted basic operation of Map and Reduce, you can solve many complicated problems. Programmers who are not familiar with parallel programs can easily perform parallel processing for data.
  • It supports high throughput by using many computers.

The following figure displays the implementation flow of the map-reduce method. Data stored in the HDFS storage is divided to available worker and expressed (Map) a value type, and results are stored in a local disk. The data is complied by reducing worker and generate a result file.

map_reduce_execution.png

Figure 8: Map-Reduce execution.

Depending on the characteristics of a data storage, make the best use of locality by reducing the gap between a node which is processing data and source data location by placing worker in the location (based on network switch) where data is stored. Each worker can be implemented in various languages through streaming interface (standard in/out).

Dryad

Like Dryad, there is a framework that enables processing parallel data by forming the data channel between programs in a graph type. Developers who use Map/reduce framework should write Map and Reduce functions; thus, if using Dryad, they need to make a graph which processes the corresponding data. Figure 9 below describes data processing in Dryad in comparison with the UNIX’s pipe.

dtyad_data_processing.png

Figure 9: Dryad data processing.

Dryad enables data flow processing of the DAG (Direct Acyclic Graph) type.

Despite parallel data operation framework offers enough functions for processing big data, there are the barriers to entry in using the system for inexperienced developers, data analyzers, and data minors. As a result, we need a method that helps easier data processing through higher standard abstract.

Apache Pig

Apache Pig provides a high-standard data processing structure, allowing large data processing through combination. It supports a language called, Pig Latin, and shows the following characteristics:

  • It provides a high-standard structure, such as relation, bag, and tuple, including int, long, and double basic types.
  • It supports relation (relation and table) operation, such as FILTER, FOREACH, GROUP, JOIN, LOAD, and STORE.
  • You can specify a user defined function.

A data processing program, which is specified via Pig Latin, converts to a logical execution plan and this is again conversed to a Map-Reduce execution plan for execution. Figure 10 below shows Pig operation process.

converting_process_of_pig_latin_to_map_reduce.png

Figure 10: Converting process of Pig Latin to Map-Reduce.

Apache Pig is an access method, enabling a large data processing program in procedural programming languages, namely C or Java. Another similar access method is Google’s Sawzall.

Some technologies help declarative data processing, like SQL, without specifying data processing procedures as in programming languages. Typical examples are Apache Hive, Google Tenzing, and SCOPE of Microsoft.

Apache Hive

Apache Hive helps to analyze large data by using the query language called HiveQL for data source, such as HDFS or HBase. Architecture is divided into Map-Reduce-oriented execution, meta data information for a data storage, and an execution part that receives a query from user or applications for execution.

hive_architecture.png

Figure 11: HIVE architecture.

To support expansion by user, it allows user specified function at the scalar value, aggregation, and table level.

Analysis Aspects

We reviewed systems that store big data and procedural/declarative technologies that display processing and how to process large data. Finally, let us look into technology that analyzes big data.

The process of finding meaning in data is called KDD (Knowledge Discovery in Databases). KDD is to store data, process/analyze the whole or part of interested data in order to extract progress or meaning value, or discover facts that were so far unknown and make them into knowledge ultimately.

For this, various technologies are comprehensively applied, such as artificial intelligence, machine learning, statistics, and database.

GNU R

gnu_r.pngGNU R is a software environment comprising program languages specialized for statistics analysis and graphics (visualization) and packages. It ensures a smooth process of vector and matrix data so as to be optimized for statistical calculations in terms of language. You can easily acquire desired statistics process library because of the R package site known as CRAN (Comprehensive R Archive Network). It can be touted as an open source in the field of statistics.

In the past, R used to put data to be processed into the memory of a computer for analyzing using a single CPU. There has been much progress due to ever increasing data to be processed. Some of the typical examples are as follows:

  • doSMP package: It uses multi-core.
  • Bigmemory package: It stores data in the shared memory. It stores only the reference for memory value and stores the value in a disk.
  • snow package: It enables the R program execution in the computer cluster environment.

The following figure demonstrates how snow package processes in a cluster environment. A typical division and conquer method.

execution_environment_for_gnu_r_snow_package.png

Figure 12: Execution environment for GNU R and Snow Package.

As the Map-Reduce operation is becoming more common, we can see technologies, such as RHIPE, RHadoop package, and Ricardo, where MR operation and R are in the form of integration. There is also the rhive package, which combined with high-standard data processing technology, like Apache Hive.

Apache Mahout

Apache Mahout is implemented to expand data analysis algorithm. Not only Apache Hadoop, but it can be operated in a variety of environments. It also offers effective packages in terms of storing the mathematical library and Java Collection, such as vector matrix as well as a function to use DBMS or other NoSQL database as data sources.

Besides, there is a trend in which integrates and supports R to its own technology that is provided from a big data storage product of the existing MPP structure. For example, Oracle big data appliance enables execution of the R program, targeting data stored in Oracle database by integrating with R.

To summarize, the data analysis technology, such as GNU R is progressing towards technology convergence from the existing large data processing framework or operation on storage systems.

In Conclusion

We have looked into platform technology that processes big data by classifying it into storage, process, and analysis. We also briefly reviewed storage systems, large data processing and analysis technologies.

We wish to deliver that big data will eventually serve its role when the processing technology and the capability of people/organizations who use the technology are well combined.

By Lee Kyu Jae, Senior Engineer, Storage System Development Team, NHN Corporation.

Reference

  1. Steve LaValle, Eric Lesser, Rebecca Shockley, Michael S. Hopkins and Nina Kruschwitz (December 21, 2010), “Big data, Analytics and the Path from Insights to Value”.
  2. James Manyika, Michael Chui, Brad Brown, Jacques Bughin, Richard Dobbs, Charles Roxburgh, Angela Hung Byers (May 2011), “Big data: The next frontier for innovation, competition, and productivity”.
  3. Richard Winter (December 2011), “BIG DATA: BUSINESS OPPORTUNITIES, REQUIREMENTS AND ORACLE’S APPROACH” (PDF).
  4. Michael Stonebraker, Nabil Hachem, Pat Helland, “The End of an Architectural Era (It’s Time for a Complete Rewrite)”, VLDB 2007 (PDF).
  5. Michael Stonebraker et al., “One Size Fits All? – Part 2: Benchmarking Results”, CIDR 2007 (PDF).
  6. Daniel J. Abadi et al., “Integrating Compression and Execution in Column-Oriented Database Systems”, SIGMOD ‘06 (PDF).
  7. VoltDB | Lightning Fast, Rock Solid”.
  8. SAP HANA”.
  9. Real-Time Analytics Platform | Big Data Analytics | MPP Data Warehouse”.
  10. Greenplum is driving the future of Big Data analytics”.
  11. Data Warehouse Appliance, Data Warehouse Appliances, and Data Warehousing from Netezza”.
  12. Jeffrey Dean and Sanjay Chemawat, “MapReduce: Simplified Data Processing On Large Clusters”, CACM Jan. 2008 (PDF).
  13. Mihai Budiu (March 2008), “Cluster Computing with Dryad”, MSR-SVC LiveLabs (PPT)
  14. Hung-chih Yang et al., “Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters”, SIGMOD ‘07 (PPT).
  15. Welcome to Apache Hadoop”.
  16. The R Project for Statistical Computing”.

  1. C-Store is designed to fit the OLAP application, which was commercialized as Vertica, and was taken over by HP in 2011. H-Store is programmed to fit memory-based high-performance OLTP and was commercialized as VoltDB.  ↩

  2. Recent snap-shot and command logging methods support durability in disk, including read operation of the map-reduce style, and materialized view, which enhanced the analytic function (collection operation).  ↩

Published at DZone with permission of Esen Sagynov, author and DZone MVB. (source)

(Note: Opinions expressed in this article and its replies are the opinions of their respective authors and not those of DZone, Inc.)