5 Ways to Make Your Hive Queries Run Faster

Technique #1: Use Tez  Hive can use the Apache Tez execution engine instead of the venerable Map-reduce engine. I won’t go into details about the many benefits of using Tez which are mentioned here; instead, I want to make a simple recommendation: if it’s not turned on by default in your environment, use Tez by setting to ‘true’ the following in the beginning of your Hive query:    set hive.execution.engine=tez;   With the above setting, every HIVE query you execute will take advantage of Tez.  Technique #2: Use ORCFile  Hive supports ORCfile, a new table storage format that sports fantastic speed improvements through techniques like predicate push-down, compression and more.  Using ORCFile for every HIVE table should really be a no-brainer and extremely beneficial to get fast response times for your HIVE queries.  As an example, consider two large tables A and B (stored as text files, with some columns not all specified here), and a simple query like:    SELECT A.customerID, A.name, A.age, A.address join  B.role, B.department, B.salary  ON A.customerID=B.customerID;  This query may take a long time to execute since tables A and B are both stored as TEXT. Converting these tables to ORCFile format will usually reduce query time significantly:   CREATE TABLE A_ORC (  customerID int, name string, age int, address string  ) STORED AS ORC tblproperties (“orc.compress" = “SNAPPY”);  INSERT INTO TABLE A_ORC SELECT * FROM A;  CREATE TABLE B_ORC (  customerID int, role string, salary float, department string  ) STORED AS ORC tblproperties (“orc.compress" = “SNAPPY”);  INSERT INTO TABLE B_ORC SELECT * FROM B;  SELECT A_ORC.customerID, A_ORC.name,  A_ORC.age, A_ORC.address join  B_ORC.role, B_ORC.department, B_ORC.salary  ON A_ORC.customerID=B_ORC.customerID;  ORC supports compressed storage (with ZLIB or as shown above with SNAPPY) but also uncompressed storage.  Converting base tables to ORC is often the responsibility of your ingest team, and it may take them some time to change the complete ingestion process due to other priorities. The benefits of ORCFile are so tangible that I often recommend a do-it-yourself approach as demonstrated above – convert A into A_ORC and B into B_ORC and do the join that way, so that you benefit from faster queries immediately, with no dependencies on other teams. Technique #3: Use Vectorization  Vectorized query execution improves performance of operations like scans, aggregations, filters and joins, by performing them in batches of 1024 rows at once instead of single row each time.  Introduced in Hive 0.13, this feature significantly improves query execution time, and is easily enabled with two parameters settings:    set hive.vectorized.execution.enabled = true;  set hive.vectorized.execution.reduce.enabled = true;  Technique #4: cost based query optimization  Hive optimizes each query’s logical and physical execution plan before submitting for final execution. These optimizations are not based on the cost of the query – that is, until now.  A recent addition to Hive, Cost-based optimization, performs further optimizations based on query cost, resulting in potentially different decisions: how to order joins, which type of join to perform, degree of parallelism and others.  To use cost-based optimization (also known as CBO), set the following parameters at the beginning of your query:    set hive.cbo.enable=true;  set hive.compute.query.using.stats=true;  set hive.stats.fetch.column.stats=true;  set hive.stats.fetch.partition.stats=true;  Then, prepare the data for CBO by running Hive’s “analyze” command to collect various statistics on the tables for which we want to use CBO.  For example, in a table tweets we want to collect statistics about the table and about 2 columns: “sender” and “topic”:    analyze table tweets compute statistics;  analyze table tweets compute statistics for columns sender, topic;  With HIVE 0.14 (on HDP 2.2) the analyze command works much faster, and you don’t need to specify each column, so you can just issue:    analyze table tweets compute statistics for columns;  That’s it. Now executing a query using this table should result in a different execution plan that is faster because of the cost calculation and different execution plan created by Hive. Technique #5: Write good SQL  SQL is a powerful declarative language. Like other declarative languages, there is more than one way to write a SQL statement. Although each statement’s functionality is the same, it may have strikingly different performance characteristics.  Let’s look at an example. Consider a click-stream event table:    CREATE TABLE clicks (  timestamp date, sessionID string, url string, source_ip string  ) STORED as ORC tblproperties (“orc.compress” = “SNAPPY”);  Each record represents a click event, and we would like to find the latest URL for each sessionID.  One might consider the following approach:    SELECT clicks.* FROM clicks inner join  (select sessionID, max(timestamp) as max_ts from clicks  group by sessionID) latest  ON clicks.sessionID = latest.sessionID and  clicks.timestamp = latest.max_ts;  In the above query, we build a sub-query to collect the timestamp of the latest event in each session, and then use an inner join to filter out the rest.  While the query is a reasonable solution—from a functional point of view—it turns out there’s a better way to re-write this query as follows:    SELECT * FROM  (SELECT *, RANK() over (partition by sessionID,  order by timestamp desc) as rank  FROM clicks) ranked_clicks  WHERE ranked_clicks.rank=1;  Here we use Hive’s OLAP functionality (OVER and RANK) to achieve the same thing, but without a Join.  Clearly, removing an unnecessary join will almost always result in better performance, and when using big data this is more important than ever. I find many cases where queries are not optimal — so look carefully at every query and consider if a rewrite can make it better and faster. Summary  Apache Hive is a powerful tool in the hands of data analysts and data scientists, and supports a variety of batch and interactive workloads.  In this blog post, I’ve discussed some useful techniques—the ones I use most often and find most useful for my day-to-day work as a data scientist—to make Hive queries run faster.  Thankfully, the Hive community is not finished yet. Even between HIVE 0.13 and HIVE 0.14, there are dramatic improvements in ORCFiles, vectorization and CBO and how they positively impact query performance.  I’m really excited about Stinger.next, bringing performance improvements to the sub-second range.  I can’t wait.

Technique #1: Use Tez  Hive can use the Apache Tez execution engine instead of the venerable Map-reduce engine. I won’t go into details about the many benefits of using Tez which are mentioned here; instead, I want to make a simple recommendation: if it’s not turned on by default in your environment, use Tez by setting to ‘true’ the following in the beginning of your Hive query:    set hive.execution.engine=tez;   With the above setting, every HIVE query you execute will take advantage of Tez.  Technique #2: Use ORCFile  Hive supports ORCfile, a new table storage format that sports fantastic speed improvements through techniques like predicate push-down, compression and more.  Using ORCFile for every HIVE table should really be a no-brainer and extremely beneficial to get fast response times for your HIVE queries.  As an example, consider two large tables A and B (stored as text files, with some columns not all specified here), and a simple query like:    SELECT A.customerID, A.name, A.age, A.address join  B.role, B.department, B.salary  ON A.customerID=B.customerID;  This query may take a long time to execute since tables A and B are both stored as TEXT. Converting these tables to ORCFile format will usually reduce query time significantly:   CREATE TABLE A_ORC (  customerID int, name string, age int, address string  ) STORED AS ORC tblproperties (“orc.compress" = “SNAPPY”);  INSERT INTO TABLE A_ORC SELECT * FROM A;  CREATE TABLE B_ORC (  customerID int, role string, salary float, department string  ) STORED AS ORC tblproperties (“orc.compress" = “SNAPPY”);  INSERT INTO TABLE B_ORC SELECT * FROM B;  SELECT A_ORC.customerID, A_ORC.name,  A_ORC.age, A_ORC.address join  B_ORC.role, B_ORC.department, B_ORC.salary  ON A_ORC.customerID=B_ORC.customerID;  ORC supports compressed storage (with ZLIB or as shown above with SNAPPY) but also uncompressed storage.  Converting base tables to ORC is often the responsibility of your ingest team, and it may take them some time to change the complete ingestion process due to other priorities. The benefits of ORCFile are so tangible that I often recommend a do-it-yourself approach as demonstrated above – convert A into A_ORC and B into B_ORC and do the join that way, so that you benefit from faster queries immediately, with no dependencies on other teams. Technique #3: Use Vectorization  Vectorized query execution improves performance of operations like scans, aggregations, filters and joins, by performing them in batches of 1024 rows at once instead of single row each time.  Introduced in Hive 0.13, this feature significantly improves query execution time, and is easily enabled with two parameters settings:    set hive.vectorized.execution.enabled = true;  set hive.vectorized.execution.reduce.enabled = true;  Technique #4: cost based query optimization  Hive optimizes each query’s logical and physical execution plan before submitting for final execution. These optimizations are not based on the cost of the query – that is, until now.  A recent addition to Hive, Cost-based optimization, performs further optimizations based on query cost, resulting in potentially different decisions: how to order joins, which type of join to perform, degree of parallelism and others.  To use cost-based optimization (also known as CBO), set the following parameters at the beginning of your query:    set hive.cbo.enable=true;  set hive.compute.query.using.stats=true;  set hive.stats.fetch.column.stats=true;  set hive.stats.fetch.partition.stats=true;  Then, prepare the data for CBO by running Hive’s “analyze” command to collect various statistics on the tables for which we want to use CBO.  For example, in a table tweets we want to collect statistics about the table and about 2 columns: “sender” and “topic”:    analyze table tweets compute statistics;  analyze table tweets compute statistics for columns sender, topic;  With HIVE 0.14 (on HDP 2.2) the analyze command works much faster, and you don’t need to specify each column, so you can just issue:    analyze table tweets compute statistics for columns;  That’s it. Now executing a query using this table should result in a different execution plan that is faster because of the cost calculation and different execution plan created by Hive. Technique #5: Write good SQL  SQL is a powerful declarative language. Like other declarative languages, there is more than one way to write a SQL statement. Although each statement’s functionality is the same, it may have strikingly different performance characteristics.  Let’s look at an example. Consider a click-stream event table:    CREATE TABLE clicks (  timestamp date, sessionID string, url string, source_ip string  ) STORED as ORC tblproperties (“orc.compress” = “SNAPPY”);  Each record represents a click event, and we would like to find the latest URL for each sessionID.  One might consider the following approach:    SELECT clicks.* FROM clicks inner join  (select sessionID, max(timestamp) as max_ts from clicks  group by sessionID) latest  ON clicks.sessionID = latest.sessionID and  clicks.timestamp = latest.max_ts;  In the above query, we build a sub-query to collect the timestamp of the latest event in each session, and then use an inner join to filter out the rest.  While the query is a reasonable solution—from a functional point of view—it turns out there’s a better way to re-write this query as follows:    SELECT * FROM  (SELECT *, RANK() over (partition by sessionID,  order by timestamp desc) as rank  FROM clicks) ranked_clicks  WHERE ranked_clicks.rank=1;  Here we use Hive’s OLAP functionality (OVER and RANK) to achieve the same thing, but without a Join.  Clearly, removing an unnecessary join will almost always result in better performance, and when using big data this is more important than ever. I find many cases where queries are not optimal — so look carefully at every query and consider if a rewrite can make it better and faster. Summary  Apache Hive is a powerful tool in the hands of data analysts and data scientists, and supports a variety of batch and interactive workloads.  In this blog post, I’ve discussed some useful techniques—the ones I use most often and find most useful for my day-to-day work as a data scientist—to make Hive queries run faster.  Thankfully, the Hive community is not finished yet. Even between HIVE 0.13 and HIVE 0.14, there are dramatic improvements in ORCFiles, vectorization and CBO and how they positively impact query performance.  I’m really excited about Stinger.next, bringing performance improvements to the sub-second range.  I can’t wait.

5 Ways to Make Your Hive Queries Run Faster的更多相关文章

  1. 关于tez-ui的"All DAGs"和"Hive Queries"页面信息为空的问题解决过程

    近段时间发现公司的HDP大数据平台的tez-ui页面不能用了,页面显示为空,导致通过hive提交的sql不能方便地查找到Yarn上对应的applicationId,只能通过beeline的屏幕输出信息 ...

  2. Optimizing Hive queries for ORC formatted tables

    Short Description: Hive configuration settings to optimize your HiveQL when querying ORC formatted t ...

  3. how to run faster

    题目大意: 已知 $$ b_i = \sum_{j=1}^n {(i,j)^d [i,j]^c x_j}$$,给定 $b_i$ 求解 $x_i$ 解法: 考虑 $f(n) = \sum_{d|n}{f ...

  4. HIVE的几种优化

    5 WAYS TO MAKE YOUR HIVE QUERIES RUN FASTER 今天看了一篇[文章] (http://zh.hortonworks.com/blog/5-ways-make-h ...

  5. 《Programming Hive》读书笔记(一)Hadoop和hive环境搭建

    <Programming Hive>读书笔记(一)Hadoop和Hive环境搭建             先把主要的技术和工具学好,才干更高效地思考和工作.   Chapter 1.Int ...

  6. Partitioning & Archiving tables in SQL Server (Part 1: The basics)

    Reference: http://blogs.msdn.com/b/felixmar/archive/2011/02/14/partitioning-amp-archiving-tables-in- ...

  7. Covering Indexes in MySQL, PostgreSQL, and MongoDB

    Covering Indexes in MySQL, PostgreSQL, and MongoDB - Orange Matter https://orangematter.solarwinds.c ...

  8. DeveloperGuide Hive UDAF

    Writing GenericUDAFs: A Tutorial User-Defined Aggregation Functions (UDAFs) are an excellent way to ...

  9. 【大数据系列】apache hive 官方文档翻译

    GettingStarted 开始 Created by Confluence Administrator, last modified by Lefty Leverenz on Jun 15, 20 ...

随机推荐

  1. mybatis传入map参数,map中包含list(输入参数)

    1.xml中配置: <!-- 根据条件查询满足条件的ID集合开始 --> <select id="getQuestionsIdsForExamPaper" res ...

  2. 【dll】关于__declspec的简记,由两个单词缩写而来!(转)

    关于declspec的一点说明 我遇到这个单词总觉得记不住,时间一长就忘了.今天在复习dll的时候又遇到了这个单词,我感觉应该是两个单词的缩写,但又不敢确定,特地发帖网上求助,得到两位高手的帮助.下面 ...

  3. 安装phpssdb扩展:

    安装 igbinary   扩展(安装phpssdb扩展时候要用到--enable-ssdb-igbinary): clone  https://github.com/igbinary/igbinar ...

  4. file中的一些常用方法

    1.exists();判断文件(目录)是否存在 2.mkdir();创建一级目录:mkdirs()创建多级目录 3.delete();删除文件(目录) 4.isDirectory();判断是否是一个目 ...

  5. SPOJ 1825 Free tour II (树的点分治)

    题目链接 Free tour II 题意:有$N$个顶点的树,节点间有权值, 节点分为黑点和白点. 找一条最长路径使得 路径上黑点数量不超过K个 这是树的点分治比较基本的题,涉及树上启发式合并……仰望 ...

  6. 计蒜客 微软大楼设计方案(RMQ)

    题目链接 微软大楼设计方案 中文题就不说题意了~ 首先是简单版本 满足$1 <= n, m <= 50$ 那么设$c[i][j]$为从第$i$幢楼到第$j$幢楼的最低的那幢楼的高度 计算两 ...

  7. UVA - 10615 Rooks

    建一下模,把行和列看成二分图的点,把车看成是二分图中的边,这样就变成了上一个博客的问题. 我们每次新加一条边,就把它加入一条 这条边两端点最小没有出现的颜色  交替出现的路径中去. #include& ...

  8. 某考试 T3 sine

    推完一波式子之后发现是个矩阵23333. 其实只要发现是矩阵之后就是个水题了. #include<bits/stdc++.h> #define ll long long using nam ...

  9. K&R——第五章 指针与数组

    #include <stdio.h> #define maxsize 5000 char buf[maxsize]; char *head = buf; char *new(int siz ...

  10. dtrace 网站

    Oracle SQL Tuning and CBO Internals: Based Optimizer with CBO Internals and SQL Tuning Optimization ...