Graph Processing

Archived; click post to view. Excerpt: Davy really nicely introduced the problem of looking at a snapshot of a data base. This problem obviously exists for any data base technology. You have a lot of timestamped records but running a query as if you fired it a couple of month ago is always a difficult [...]

Continue reading about Davy Suvee on FluxGraph – Towareds a time aware graph built on Datomic

René Pickhardt on March 27th, 2012

Archived; click post to view. Excerpt: Over the last week we had our off campus meeting with a lot of communication training (very good and fruitful) as well as a special treatment for some PhD students called “massage your diss”. I was one of the lucky students who were able to discuss our research ideas [...]

Continue reading about PhD proposal on distributed graph data bases

René Pickhardt on February 24th, 2012

Archived; click post to view. Excerpt: I am just dreaming this does not exist and needs to be refined in a later stage. Fast traversals: Jumping from one vertex of the graph to another should be possible in O(1) Online processing: “Standard queries” (<–whatever this means) should compute within miliseconds. As an example: Local recommendations [...]

Continue reading about Wishlist of features for a distributed graph data base technology

René Pickhardt on February 23rd, 2012

Archived; click post to view. Excerpt: Yesterdays meeting of the reading club was quite nice. We all agreed that the papers where of good quality and we gained some nice insights. The only drawback of the papers was that it did not directly tell us how to achieve our goal for a real time distributed [...]

Continue reading about From Graph (batch) processing towards a distributed graph data base

Archived; click post to view. Excerpt: One of the reading club assignments was to read the paper about Google Pregel and Signal Collect, compare them and point out pros and cons of both approaches. So after I read both papers as well as Claudios overview on Pregel clones and took some notes here are my [...]

Continue reading about Google Pregel vs Signal Collect for distributed Graph Processing – pros and cons

Archived; click post to view. Excerpt: Nils Grunwald works at the french startup Linkefluence. Their product is more or less social network analysis and graph processing. They crawl the web and blogs or get other social network data and provide solutions with statistics and insights for their customers.  In this scenario obviously big data is [...]

Continue reading about Nils Grunwald from Linkfluence talks at FOSDEM about Cascalog for graph processing

Archived; click post to view. Excerpt: Claudio Martella introduces Apache Giraph which according to him is a loose implementation of Google Pregel which was introduced  on SIGMOD in 2010. He points out that Map Reduce cannot be used to do graph processing. He then gave an example on how MapReduce can be used to to do page rank calculation. He points [...]

Continue reading about Claudio Martella talks @ FOSDEM about Apache Giraph: Distributed Graph Processing in the Cloud

Close

Subscribe to my newsletter

You don't like mail?