You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@spark.apache.org by "Reynold Xin (JIRA)" <ji...@apache.org> on 2016/07/25 04:54:20 UTC

[jira] [Resolved] (SPARK-16699) Fix performance bug in hash aggregate on long string keys

     [ https://issues.apache.org/jira/browse/SPARK-16699?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Reynold Xin resolved SPARK-16699.
---------------------------------
       Resolution: Fixed
         Assignee: Qifan Pu
    Fix Version/s:     (was: 2.0.0)
                   2.1.0
                   2.0.1

> Fix performance bug in hash aggregate on long string keys
> ---------------------------------------------------------
>
>                 Key: SPARK-16699
>                 URL: https://issues.apache.org/jira/browse/SPARK-16699
>             Project: Spark
>          Issue Type: Bug
>          Components: Spark Core
>    Affects Versions: 2.0.0
>            Reporter: Qifan Pu
>            Assignee: Qifan Pu
>             Fix For: 2.0.1, 2.1.0
>
>
> In the following code in `VectorizedHashMapGenerator.scala`:
> ```
>     def hashBytes(b: String): String = {
>       val hash = ctx.freshName("hash")
>       s"""
>          |int $result = 0;
>          |for (int i = 0; i < $b.length; i++) {
>          |  ${genComputeHash(ctx, s"$b[i]", ByteType, hash)}
>          |  $result = ($result ^ (0x9e3779b9)) + $hash + ($result << 6) + ($result >>> 2);
>          |}
>        """.stripMargin
>     }
> ```
> when b=input.getBytes(), the current 2.0 code results in getBytes() being called n times, n being length of input. getBytes() involves memory copy is thus expensive and causes a performance degradation.
> Fix is to evaluate getBytes() before the for loop.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org