Archived; click post to view.
Excerpt: Today we finally had our reading club and discussed several papers from last week’s asignments.  Before I give my usual summary I want to introduce our new infrastructure for the reading club. Go to:  http://related-work.rene-pickhardt.de/ There you can find a question and answer system which we will use to discuss questions and answers of papers. Due to the included voting system we thought this is much more convenient than a closed unstructured mailing list. I hope this is of help to the entire community and I can only invite anyone to read and and discuss with us on http://related-work.rene-pickhardt.de/ Reading list for next meeting…

Sharing:

Tags: , , , , , ,

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 e.g. similar users in a bipartite “User – Band” graph should be possible to process online in less than a second. Query language: A programming model that supports pattern matching and traversals with one (or possibly several) starting nodes No SPARQL (too general for a reasonable graph application) support needed. Support for reading and writing new data (to disk)! Distribution…

Sharing:

Tags: , , , , , ,

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 graph data base technology. In the readings for next meeting (which will take place Wednesday March 7th 2pm CET) we tried to choose papers that don’t discuss these distributed graph / data processing techniques but   focus more on speed or point out the general challenges in parallel graph processing. Readinglist for…

Sharing:

Tags: , ,

René Pickhardt on February 19th, 2012

Archived; click post to view.
Excerpt: Recently I received an email from a musicians that wishes to stay unnamed telling me that many people out there love his music but it just hasn’t spread too far. His basic question is how can his band reach more people on the web especially with regard to a new upcoming video? His promoter suggested something like: You should send a press release to all music related websites You should show the videos to your  friends and ask them to reshare it with their friends You should make a riffle regarding the video Before I start with my thoughts. In this blog article I will explain…

Sharing:

Tags: , , , , , , , , , ,

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 thoughts but first a short summary of both papers. Summary of Google Pregel The methodology is heavily based on Bulk Sychronous Parallel Model (BSP) and also has some similarties to MapReduce (with just one superstep). The main idea is to spread the data over several machines and introduce some supersteps. For each superstep every…

Sharing:

Tags: , , , , , , , ,

René Pickhardt on February 16th, 2012

Archived; click post to view.
Excerpt: Not really news since it has happened like 20 days ago but here is a nice youtube summary of President Obamas public Hangout with the American folk. Kind of amazing that he actually did this. I am really looking forward to the time where these kind of events are not amazing anymore but rather standard like they should be. It is also interesting to see what technology he chose. Well I guess it was not for Google Plus’ publicity but rather for the brand recognition of Youtube. Anyway I didn’t see Facebook around there. Also I think questions like this…

Sharing:

Tags: , , ,

Archived; click post to view.
Excerpt: The first meeting of our reading club was quite a success. Everyone was well prepared and we discussed some issues about Google’s Map Reduce framework and I had the feeling that everyone now better understands what is going on there. I will now post a summary of what has been discussed and will also post some feedback and reading for next week to the end of this post. Most importantly: The reading club will meet next week Wednesday February 22nd at 2 o’clock pm CET.  Summary First take away which was well known is that there is a certain stack of Google papers…

Sharing:

Tags: , , ,

René Pickhardt on February 8th, 2012

Archived; click post to view.
Excerpt: Update: find a summary of last meeting and the current reading list for next week’s meeting here. Teaching classes is over for this term so for the next couple of weeks I want to spend a lot of time working on some research topics that are on my mind. My goal is to finnaly write down my PhD proposal and have a well organized written structure for the rest of my PhD time. The main topic for 2012 in the scientific part of my life can be summerized by these bullets points: Graph data bases distributed systems distributed computing distribution of graph data bases dynamic hash tables peer…

Sharing:
René Pickhardt on February 5th, 2012

Archived; click post to view.
Excerpt: Since one of the talks got canceled the organisers of the Graph Devroom at Fosdem used the opportunity to make a public discussions with all the developers to talk about some future trends in graph processing. I really liked the idea but unfortunately the discussion wasn’t really kicking off well. I guess for  a discussion like this people have to prepared in a better way. Topics were Blueprints (a common graph accass api) created by Marko Rodriguez as  Problem of real time graph processing  Benchmarking issues (we need standards for benchmarking).  A guy from OrientDB raised the question weather Graph databases should really have ACID…

Sharing:

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 envolved and the data carries a natural structure of a graph. He sais a system to process the data has the following constrains: The processing should not compromise the rest of the system Low maintenance costs Used for queries and rapid prototyping (so they want a “general” graph processing solution as customer needs changes) Flexible, hard…

Sharing:

Tags: , ,

Close

Subscribe to my newsletter

You don't like mail?