Return-Path: X-Original-To: apmail-giraph-user-archive@www.apache.org Delivered-To: apmail-giraph-user-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 4C97010798 for ; Mon, 18 Nov 2013 10:23:36 +0000 (UTC) Received: (qmail 57091 invoked by uid 500); 18 Nov 2013 10:23:35 -0000 Delivered-To: apmail-giraph-user-archive@giraph.apache.org Received: (qmail 56986 invoked by uid 500); 18 Nov 2013 10:23:34 -0000 Mailing-List: contact user-help@giraph.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: user@giraph.apache.org Delivered-To: mailing list user@giraph.apache.org Received: (qmail 56977 invoked by uid 99); 18 Nov 2013 10:23:33 -0000 Received: from nike.apache.org (HELO nike.apache.org) (192.87.106.230) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 18 Nov 2013 10:23:33 +0000 X-ASF-Spam-Status: No, hits=1.5 required=5.0 tests=HTML_MESSAGE,RCVD_IN_DNSWL_LOW,SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (nike.apache.org: domain of pascal@pascaljaeger.de designates 213.199.154.13 as permitted sender) Received: from [213.199.154.13] (HELO emea01-am1-obe.outbound.protection.outlook.com) (213.199.154.13) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 18 Nov 2013 10:23:26 +0000 Received: from AM3PR02MB084.eurprd02.prod.outlook.com (10.242.246.25) by AM3PR02MB081.eurprd02.prod.outlook.com (10.242.246.13) with Microsoft SMTP Server (TLS) id 15.0.820.5; Mon, 18 Nov 2013 10:23:05 +0000 Received: from AM3PR02MB084.eurprd02.prod.outlook.com ([169.254.4.183]) by AM3PR02MB084.eurprd02.prod.outlook.com ([169.254.4.183]) with mapi id 15.00.0820.005; Mon, 18 Nov 2013 10:23:04 +0000 From: =?iso-8859-1?Q?Pascal_J=E4ger?= To: "user@giraph.apache.org" Subject: Re: subGraph clustering maybe Thread-Topic: subGraph clustering maybe Thread-Index: Ac7kRV7CDyvuLwBtRHKcU2gLVSbwOQACyr8A Date: Mon, 18 Nov 2013 10:23:04 +0000 Message-ID: In-Reply-To: Accept-Language: de-DE, en-US Content-Language: de-DE X-MS-Has-Attach: X-MS-TNEF-Correlator: user-agent: Microsoft-MacOutlook/14.3.8.130913 x-originating-ip: [78.55.241.92] x-forefront-prvs: 00342DD5BC x-forefront-antispam-report: SFV:NSPM;SFS:(189002)(199002)(16236675002)(76482001)(81342001)(81542001)(19300405004)(77982001)(59766001)(79102001)(75402002)(56776001)(54316002)(65816001)(66066001)(80022001)(63696002)(74706001)(74876001)(15202345003)(74366001)(36756003)(31966008)(74662001)(74482001)(47446002)(74502001)(76786001)(76796001)(2656002)(81686001)(87266001)(4396001)(87936001)(53806001)(54356001)(15975445006)(85306002)(80976001)(51856001)(46102001)(76176001)(69226001)(49866001)(83506001)(47736001)(83322001)(56816003)(81816001)(77096001)(83072001)(47976001)(19580405001)(50986001)(19580395003)(244885003);DIR:OUT;SFP:;SCL:1;SRVR:AM3PR02MB081;H:AM3PR02MB084.eurprd02.prod.outlook.com;CLIP:78.55.241.92;FPR:;RD:InfoNoRecords;MX:1;A:1;LANG:en; Content-Type: multipart/alternative; boundary="_000_CEAFA8D46605pascalpascaljaegerde_" MIME-Version: 1.0 X-OriginatorOrg: pascaljaeger.de X-Virus-Checked: Checked by ClamAV on apache.org --_000_CEAFA8D46605pascalpascaljaegerde_ Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Hi, I'd suggest a graph database for that job - like neo4j. I never used one before, but it seems like the perfect job for a graph db. Regards Pascal Von: Phil Hoy > Antworten an: "user@giraph.apache.org" > Datum: Montag, 18. November 2013 11:04 An: "user@giraph.apache.org" > Betreff: subGraph clustering maybe Hi, We have graph data such that subsets of edges and vertexes occur multiple t= imes in the same configuration however these sub graph matches occur rather= infrequently. Would Giraph be a good tool to find these subsets, if so how= would one go about implementing the algorithm? Phil --_000_CEAFA8D46605pascalpascaljaegerde_ Content-Type: text/html; charset="iso-8859-1" Content-ID: <006BF31110C8F541B3F59F4F31E00011@eurprd02.prod.outlook.com> Content-Transfer-Encoding: quoted-printable
Hi,

I’d suggest a graph database for that job – like neo4j.
I never used one before, but it seems like the perfect job for a graph= db.

Regards

Pascal

Von: Phil Hoy <phoy@dctfh.com>
Antworten an: "user@giraph.apache.org" <user@giraph.apache.org>
Datum: Montag, 18. November 2013 11= :04
An: "user@giraph.apache.org" <user@giraph.apache.org>
Betreff: subGraph clustering maybe<= br>

Hi,

 

We have graph data su= ch that subsets of edges and vertexes occur multiple times in the same conf= iguration however these sub graph matches occur rather infrequently. Would = Giraph be a good tool to find these subsets, if so how would one go about implementing the algorithm?

Phil

 --_000_CEAFA8D46605pascalpascaljaegerde_--