Ok thanks!
Le jeu. 28 nov. 2019 à 11:27, Phillip Henry a
écrit :
> I saw a large improvement in my GraphX processing by:
>
> - using fewer partitions
> - using fewer executors but with much more memory.
>
> YMMV.
>
> Phillip
>
> On Mon, 25 Nov 2019, 19:14 mahzad kalantari,
> wrote:
>
>> Thanks
I saw a large improvement in my GraphX processing by:
- using fewer partitions
- using fewer executors but with much more memory.
YMMV.
Phillip
On Mon, 25 Nov 2019, 19:14 mahzad kalantari,
wrote:
> Thanks for your answer, my use case is friend recommandation for 200
> million profils.
>
> Le
Thanks for your answer, my use case is friend recommandation for 200
million profils.
Le lun. 25 nov. 2019 à 14:10, Jörn Franke a écrit :
> I think it depends what you want do. Interactive big data graph analytics
> are probably better of in Janusgraph or similar.
> Batch processing (once-off)
I think it depends what you want do. Interactive big data graph analytics are
probably better of in Janusgraph or similar.
Batch processing (once-off) can be still fine in graphx - you have though to
carefully design the process.
> Am 25.11.2019 um 20:04 schrieb mahzad kalantari :
>
>
> Hi
Hi all
My question is about GraphX, I 'm looking for user feedbacks on the
performance.
I read this paper written by Facebook team that says Graphx has very poor
performance.
https://engineering.fb.com/core-data/a-comparison-of-state-of-the-art-graph-processing-systems/
Has anyone already
