BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Efficient Range Querying in Distributed Games - Sergey Legtchenko\
 , UPMC-LIP6 in Paris
DTSTART:20120319T110000Z
DTEND:20120319T120000Z
UID:TALK36982@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:In the last few years Massively Multiplayer Online Games (MMOG
 s) have become a popular class of distributed applications with millions o
 f users. Such applications need to be highly scalable to support the colos
 sal number of players and to be reactive with almost realtime constraints 
 to provide a satisfying gaming experience.  \n\nA range query is an operat
 ion that allows to retrieve/update all the objects located in a specified 
 zone of the virtual environment. Efficient range querying is a key require
 ment for MMOG systems\, because players moving through the game constantly
  need to display surrounding objects. This talk presents novel techniques 
 to improve the efficiency of range queries in MMOG systems.\n
LOCATION:Large lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR