6 months of hard coding and supervising by me are over and end with a huge success! After analyzing 80 GB of Google ngrams data Paul and Till put them to a neo4j graph data base in order to make predictions for fast scentence completion. Today was the award ceremony and the two students from …
Year: 2012
Why Musicians should have a Bandpage on Google Plus!
The following info graphic for businesses was released by Chris Brogan and demonstrates quite well why musicians should get on Google Plus and how to use it. It is released under a creative commons licence http://creativecommons.org/licenses/by-nc-sa/2.0/ Very good work!
Google Video on Search Quality Meeting: Spelling for Long Queries by Lars Hellsten
Amazing! Today I had a discussion with a coworker about transparency and the way companies should be more open about what they are doing! And what happens on the same day? One of my favourite webcompanies has decided to publish a short video taken from the weekly search quality meeting! The proposed change by Lars …
Related-work.net – Product Requirement Document released!
Recently I visited my friend Heinrich Hartmann in Oxford. We talked about various issues how research is done in these days and how the web could theoretically help to spread information faster and more efficiently connect people interested in the same paper / topics. The idea of http://www.related-work.net was born. A scientific platform which is …
Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)
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. …
Wishlist of features for a distributed graph data base technology
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 …
From Graph (batch) processing towards a distributed graph data base
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 …
Question of the Day: How the hell do we reach more people?
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 …
Google Pregel vs Signal Collect for distributed Graph Processing – pros and cons
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 …
President Obama on Google+ talking to people
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 …