Jul 2014
21 Mon
22 Tue
23 Wed 09:30 AM – 05:00 PM IST
24 Thu 09:45 AM – 05:00 PM IST
25 Fri 08:30 AM – 07:15 PM IST
26 Sat 08:30 AM – 07:15 PM IST
27 Sun
Inder Singh
Problem Statement - Fast Programmatic/self-serve analytics on linked data in an ad system by indexing it across all cuts, especially for traversals like -
As it’s evident from the above examples these class of queries are different from a typical pointed query like - “find my friends who have been to golden gate birdge in the last year and have liked hiking articles”. This class of query start with a point lookup and then a BFS traversal with appropiate filtering criteria which are addressed by db’s like neo4j, titan in a generic fashion.
Scope of the talk -
This work was motivated to store large amounts of linkeddata in an ad system and make it available for programmatic/analytics consumption.
This talk outlines our journey which started from researching existing graphdb’s/processing frameworks, why they didn’t work for us at our scale and then moving on to build something.
We will go in depth to explain the data-structures used and how we supported the tinker-pop graph API specification( used by all graph databases). We will also touch upon how our ad-system unique data model allowed us to come up with a fairly simplistic technique to shard the entire thing and query over it.
Takeaways from this talk -
Inder Singh - have been working on solving data related problems at Inmobi(World’s largest independent ad-network) for the past ~3 years.
{{ gettext('Login to leave a comment') }}
{{ gettext('Post a comment…') }}{{ errorMsg }}
{{ gettext('No comments posted yet') }}