SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Graph Computing @ Strangeloop 2013

by Technologist at Aurelius on Sep 21, 2013

  • 590 views

Problem solving in the 21st century increasingly depends on the analysis of complex systems. Developing new drugs, understanding risk in financial networks, searching for answers in knowledge graphs, ...

Problem solving in the 21st century increasingly depends on the analysis of complex systems. Developing new drugs, understanding risk in financial networks, searching for answers in knowledge graphs, personalization and recommendation in social networks all require the analysis of systems composed of interconnected entities that exhibit complex behavior as a whole. Graph computing provides a conceptual model and practical platform for developing such analyses.
This talk presents graph computing as an important component of every developer’s toolbox. We introduce the Aurelius graph cluster which is an open-source stack enabling graph computing at scale by building on distributed systems like Cassandra, HBase, and Hadoop. This stack addresses challenging problems in graph partitioning, graph query language design and graph algorithm development with solutions inspired by physics, biology and neuroscience.

Statistics

Views

Total Views
590
Views on SlideShare
572
Embed Views
18

Actions

Likes
3
Downloads
15
Comments
0

1 Embed 18

https://twitter.com 18

Accessibility

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

Graph Computing @ Strangeloop 2013 Graph Computing @ Strangeloop 2013 Presentation Transcript