Mailing-List: contact user-help@hadoop.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@hadoop.apache.org
Received-SPF: neutral (athena.apache.org: local policy)
MIME-Version: 1.0
In-Reply-To: 
 <CAOTz1wB6z7TuJbVjX09GtjsZg1=YcWoyD8b+GGE2J=02bVM1ew@mail.gmail.com>
References: 
 <CAOTz1wB6z7TuJbVjX09GtjsZg1=YcWoyD8b+GGE2J=02bVM1ew@mail.gmail.com>
From: Ted Dunning <tdunning@maprtech.com>
Date: Fri, 19 Oct 2012 12:45:17 -0700
Message-ID: 
 <CAND0qzv+WtBCq8QTDXis=2kKPzZ63U0UBLWENjOUy3sOKxyfaw@mail.gmail.com>
Subject: Re: rules engine with Hadoop
To: user@hadoop.apache.org
Content-Type: multipart/alternative; boundary=f46d0444eec17c9a4704cc6ebf14

--f46d0444eec17c9a4704cc6ebf14
Content-Type: text/plain; charset=ISO-8859-1

Unification in a parallel cluster is a difficult problem.  Writing very
large scale unification programs is an even harder problem.

What problem are you trying to solve?

One option would be that you need to evaluate a conventionally-sized
rulebase against many inputs.  Map-reduce should be trivially capable of
this.

Another option would be that you want to evaluate a huge rulebase against a
few inputs.  It isn't clear that this would be useful given the problems of
huge rulebases and the typically super-linear cost of resolution algorithms.

Another option is that you want to evaluate many conventionally-sized
rulebases against one or many inputs in order to implement a boosted rule
engine.  Map-reduce should be relatively trivial for this as well.

What is it that you are trying to do?

On Fri, Oct 19, 2012 at 12:25 PM, Luangsay Sourygna <luangsay@gmail.com>wrote:

> Hi,
>
> Does anyone know any (opensource) project that builds a rules engine
> (based on RETE) on top Hadoop?
> Searching a bit on the net, I have only seen a small reference to
> Concord/IBM but there is barely any information available (and surely
> it is not open source).
>
> Alpha and beta memories would be stored on HBase. Should be possible, no?
>
> Regards,
>
> Sourygna
>

--f46d0444eec17c9a4704cc6ebf14
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

Unification in a parallel cluster is a difficult problem. =A0Writing very l=
arge scale unification programs is an even harder problem.<div><br></div><d=
iv>What problem are you trying to solve?</div><div><br></div><div>One optio=
n would be that you need to evaluate a conventionally-sized rulebase agains=
t many inputs. =A0Map-reduce should be trivially capable of this.</div>

<div><br></div><div>Another option would be that you want to evaluate a hug=
e rulebase against a few inputs. =A0It isn&#39;t clear that this would be u=
seful given the problems of huge rulebases and the typically super-linear c=
ost of resolution algorithms.</div>

<div><br></div><div>Another option is that you want to evaluate many conven=
tionally-sized rulebases against one or many inputs in order to implement a=
 boosted rule engine. =A0Map-reduce should be relatively trivial for this a=
s well.</div>

<div><br></div><div>What is it that you are trying to do?<br><br><div class=
=3D"gmail_quote">On Fri, Oct 19, 2012 at 12:25 PM, Luangsay Sourygna <span =
dir=3D"ltr">&lt;<a href=3D"mailto:luangsay@gmail.com" target=3D"_blank">lua=
ngsay@gmail.com</a>&gt;</span> wrote:<br>

<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">Hi,<br>
<br>
Does anyone know any (opensource) project that builds a rules engine<br>
(based on RETE) on top Hadoop?<br>
Searching a bit on the net, I have only seen a small reference to<br>
Concord/IBM but there is barely any information available (and surely<br>
it is not open source).<br>
<br>
Alpha and beta memories would be stored on HBase. Should be possible, no?<b=
r>
<br>
Regards,<br>
<br>
Sourygna<br>
</blockquote></div><br></div>

--f46d0444eec17c9a4704cc6ebf14--