The Reykjavik Chapter meets MEETING INFORMATION
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Location: LOCATION ADDRESS
Sign-up: Please RSVP for meetings via LINK NAME
#1 => TAO: Facebook's Distributed Data Store for the Social Graph
This time it will be very informal, we will meet up at the coffee house Stofan Café as they have comfortable couches, beers and good coffee.
Instead of having a speaker giving a talk on the paper we will simply try to explain it to each other and have some fun discussions that almost always go way off topic :)
Reading the paper is highly recommended but don't stress it.
The paper we will discuss is "TAO: Facebook's Distributed Data Store for the Social Graph".
"A single Facebook page may aggregate and filter hundreds of items from the social graph. We present each user with content tailored to them, and we filter every item with privacy checks that take into account the current viewer. This extreme customization makes it infeasible to perform most aggregation and filtering when content is created; instead we resolve data dependencies and check privacy each time the content is viewed. As much as p…
#0 => Ólafur R. Helgason - Chord: A Scalable Peer-to-peer Lookup Protocol for..
For our first meetup Ólafur R. Helgason will present and lead the discussion on Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications.
We hope to see as many as possible and I hope we can make these meetups a regular thing.
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulation…