You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@hadoop.apache.org by Sigurd Spieckermann <si...@gmail.com> on 2012/11/06 10:00:00 UTC

Re: Data locality of map-side join

Thanks for all your answers so far! There's still one question open which I
can't seem to find an answer for in the source code or documentation. When
I specify the two source directories of my two datasets to be joined
through CompositeInputFormat and say dataset A comes first and B second,
will Hadoop MR try to run the map task on a datanode that stores a
(replication of a) split of A, on a datanode that stores the corresponding
split of B, or at least on any datanode that stores either the split of A
or B? Since Hadoop MR takes the location of splits into account I believe
there must be some strategy how it handles the case when there are two
splits per map task, but it is not clear to me how exactly it behaves in
this case.
Am 25.10.2012 09:17 schrieb "Bertrand Dechoux" <de...@gmail.com>:

> One underlying issue is that you would like your tool to be able to detect
> which dataset is the largest and how large is it because with this
> information different strategies can be chosen. This implies that somehow
> your tool needs to create/keep/update statistics about your datasets. And
> that's clearly something which is relevant for an external tool (like hive
> or pig) but it might not make sense to build that into the core
> mapred/mapreduce. That would increase coupling for something which is not
> necessarily relevant for the core of the platform.
>
> I know about about Hive. And you could be interested in reading more about
> it.
> https://cwiki.apache.org/Hive/statsdev.html
>
> Statistics such as the number of rows of a table or partition and the
>> histograms of a particular interesting column are important in many ways.
>> One of the key use cases of statistics is query optimization. Statistics
>> serve as the input to the cost functions of the optimizer so that it can
>> compare different plans and choose among them. Statistics may sometimes
>> meet the purpose of the users' queries. Users can quickly get the answers
>> for some of their queries by only querying stored statistics rather than
>> firing long-running execution plans. Some examples are getting the quantile
>> of the users' age distribution, the top 10 apps that are used by people,
>> and the number of distinct sessions.
>>
>
> I don't know if Pig has something similar.
>
> Regards
>
> Bertrand
>
>
> On Thu, Oct 25, 2012 at 7:49 AM, Harsh J <ha...@cloudera.com> wrote:
>
>> Hi Sigurd,
>>
>> From what I've generally noticed, the client-end frameworks (Hive,
>> Pig, etc.) have gotten much more cleverness and efficiency packed in
>> their join parts than the MR join package which probably exists to
>> serve as an example or utility today more than anything else (but
>> works well for what it does).
>>
>> Per the code in the join package, there are no such estimates made
>> today. There is zero use of DistributedCache - the only decisions are
>> made based on the expression (i.e. to select which form of joining
>> record reader to use).
>>
>> Enhancements to this may be accepted though, so feel free to file some
>> JIRAs if you have something to suggest/contribute. Hopefully one day
>> we could have a unified library between client-end tools for common
>> use-cases such as joins, etc. over MR, but there isn't such a thing
>> right now (AFAIK).
>>
>> On Tue, Oct 23, 2012 at 2:52 PM, Sigurd Spieckermann
>> <si...@gmail.com> wrote:
>> > Interesting to know that Hive and Pig are doing something in this
>> direction.
>> > I'm dealing with the Hadoop join-package which doesn't use
>> DistributedCache
>> > though but it rather pulls the other partition over the network before
>> > launching the map task. This is under the assumption that both
>> partitions
>> > are too big to load into DC or it's just undesirable to use DC. Is
>> there a
>> > similar mechanism implemented in the join-package that considers the
>> size of
>> > the two partitions to be joined trying to execute the map task on the
>> > datanode that holds the bigger partition?
>> >
>> >
>> > 2012/10/23 Bejoy KS <be...@gmail.com>
>> >>
>> >> Hi Sigurd
>> >>
>> >> Mapside joins are efficiently implemented in Hive and Pig. I'm talking
>> in
>> >> terms of how mapside joins are implemented in hive.
>> >>
>> >> In map side join, the smaller data set is first loaded into
>> >> DistributedCache. The larger dataset is streamed as usual and the
>> smaller
>> >> dataset in memory. For every record in larger data set the look up is
>> made
>> >> in memory on the smaller set and there by joins are done.
>> >>
>> >> In later versions of hive the hive framework itself intelligently
>> >> determines the smaller data set. In older versions you can specify the
>> >> smaller data set using some hints in query.
>> >>
>> >>
>> >> Regards
>> >> Bejoy KS
>> >>
>> >> Sent from handheld, please excuse typos.
>> >>
>> >> -----Original Message-----
>> >> From: Sigurd Spieckermann <si...@gmail.com>
>> >> Date: Mon, 22 Oct 2012 22:29:15
>> >> To: <us...@hadoop.apache.org>
>> >> Reply-To: user@hadoop.apache.org
>> >> Subject: Data locality of map-side join
>> >>
>> >> Hi guys,
>> >>
>> >> I've been trying to figure out whether a map-side join using the
>> >> join-package does anything clever regarding data locality with respect
>> >> to at least one of the partitions to join. To be more specific, if I
>> >> want to join two datasets and some partition of dataset A is larger
>> than
>> >> the corresponding partition of dataset B, does Hadoop account for this
>> >> and try to ensure that the map task is executed on the datanode storing
>> >> the bigger partition thus reducing data transfer (if the other
>> partition
>> >> does not happen to be located on that same datanode)? I couldn't
>> >> conclude the one or the other behavior from the source code and I
>> >> couldn't find any documentation about this detail.
>> >>
>> >> Thanks for clarifying!
>> >> Sigurd
>> >
>> >
>>
>>
>>
>> --
>> Harsh J
>>
>
>
>
> --
> Bertrand Dechoux
>