Skip to main content

Tez - The race for secure low latency Hadoop picks up more speed



We had been expecting this… honestly, yes. Hortonworks, a Yahoo spin-off for Hadoop, has made the headlines again. So while Marissa Mayer was busy revealing a new version of Yahoo.com home page in a purple Facebook avatar, the erudite guys at Hortonworks revealed the open source Apache Hadoop immediate roadmap.

Hortonwoks, the Palo Alto based company revealed its 3 pronged strategy to stay ahead of the sharp competition in the Hadoop ecosystem. The key drivers of its strategy include:
(1)   Accelerate enterprise adoption of Hadoop
(2)  Providing a low latency based SQL type query interface for Hadoop
(3)  Making Hadoop cluster more secure

With these in mind, the company revealed 3 components of its strategy:
(1)   Stinger initiative
(2)  Tez framework
(3)  Knox Gateway

Stinger seems to be a strategic move to keep Hive as the central interface for Hadoop querying. Just this week, hadoopsphere.com published a post citing HCatalog could become partof Hive project. With Stinger, the company plans to make use of community driven contributions to add more SQL like querying clause to HQL (Hive Query language). Also, it claims to have achieved 90% reduction in Hive query result time. Another significant addition is the introduction of ORCFile in direct competition to Trevni and to tide over RC File format limitations. Tez framework described in next paragraph also constitutes part of Stinger initiative. Future additions include Buffer Caching, Vector Querying engine and Query Planner.



Tez is one of the most exciting revelations of the day. It is a “general-purpose, highly customizable framework that creates simplifies data-processing tasks across both small scale (low-latency) and large-scale (high throughput) workloads in Hadoop.”
(Tez in Hindi language means fast speed) 
Tez apparently throws a challenge to Cloudera Impala. Currently, proposed as an Apache incubator project with seed work already done, the project already has 22 committers which tells us something about the exciting race here. Tez aims to optimize the latency by running the query in a single job rather than multiple MapReduce jobs. Further it aims to leverage YARN to share data processing primitives across Apache Pig, Apache Hive, Cascading and others.


Knox is the other significant project which has been proposed for Apache incubation. Since security is one of the key focus areas, it “provides a single point of authentication and access for Apache Hadoop services in a cluster”. Earlier, hadoopsphere.com had proposed comprehensive security architecture forApache Hadoop cluster which could be implemented with custom built utilities or custom off the shelf tools. Knox fills in the vital authentication layer of the security architecture instead of just relying on Kerberos. However, it still needs to do a bit of work on cloud integration and web interface for the Hadoop cluster.

Overall, Hortonworks has shown its commitment to open source once again and driving upon the fact that community based contributions can be innovative, exciting and ‘tez’ (fast).




ps: Arun Murthy/folks at Hortonworks, please excuse the discretion of using Arun’s image in Speed movie look-alike poster. And of course, kudos to many more heroes in the team.

All other images in this post taken from Hortonworks blog

Comments

Popular posts from this blog

Data deduplication tactics with HDFS and MapReduce

As the amount of data continues to grow exponentially, there has been increased focus on stored data reduction methods. Data compression, single instance store and data deduplication are among the common techniques employed for stored data reduction.
Deduplication often refers to elimination of redundant subfiles (also known as chunks, blocks, or extents). Unlike compression, data is not changed and eliminates storage capacity for identical data. Data deduplication offers significant advantage in terms of reduction in storage, network bandwidth and promises increased scalability.
From a simplistic use case perspective, we can see application in removing duplicates in Call Detail Record (CDR) for a Telecom carrier. Similarly, we may apply the technique to optimize on network traffic carrying the same data packets.
Some of the common methods for data deduplication in storage architecture include hashing, binary comparison and delta differencing. In this post, we focus on how MapReduce and…

In-memory data model with Apache Gora

Open source in-memory data model and persistence for big data framework Apache Gora™ version 0.3, was released in May 2013. The 0.3 release offers significant improvements and changes to a number of modules including a number of bug fixes. However, what may be of significant interest to the DynamoDB community will be the addition of a gora-dynamodb datastore for mapping and persisting objects to Amazon's DynamoDB. Additionally the release includes various improvements to the gora-core and gora-cassandra modules as well as a new Web Services API implementation which enables users to extend Gora to any cloud storage platform of their choice. This 2-part post provides commentary on all of the above and a whole lot more, expanding to cover where Gora fits in within the NoSQL and Big Data space, the development challenges and features which have been baked into Gora 0.3 and finally what we have on the road map for the 0.4 development drive.
Introducing Apache Gora Although there are var…

Large scale graph processing with Apache Hama

Recently Apache Hama team released official 0.7.0 version. According to the release announcement, there were big improvements in Graph package. In this article, we provide an overview of the newly improved Graph package of Apache Hama, and the benchmark results that performed by cloud platform team at Samsung Electronics.

Large scale datasets are being increasingly used in many fields. Graph algorithms are becoming important for analyzing big data. Data scientists are able to predict the behavior of the customer, the trends of the market, and make a decision by analyzing the graph structure and characteristics. Currently there are a variety of open source graph analytic frameworks, such as Google’s Pregel[1], Apache Giraph[2], GraphLab[3] and GraphX[4]. These frameworks are aimed at computations varying from classical graph traversal algorithms to graph statistics calculations such as triangle counting to complex machine learning algorithms. However these frameworks have been developed…