Efficient Range Querying in Distributed Games

Add to your list(s) Download to your calendar using vCal

• Sergey Legtchenko, UPMC-LIP6 in Paris
• Monday 19 March 2012, 11:00-12:00
• Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

In the last few years Massively Multiplayer Online Games (MMOGs) have become a popular class of distributed applications with millions of users. Such applications need to be highly scalable to support the colossal number of players and to be reactive with almost realtime constraints to provide a satisfying gaming experience.

A range query is an operation that allows to retrieve/update all the objects located in a specified zone of the virtual environment. Efficient range querying is a key requirement 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.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Big Data
• Cambridge University Engineering Department Talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Featured lists
• Guy Emerson's list
• Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
• Methodology in design research
• Microsoft Research Cambridge, public talks
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• rp587

Note that ex-directory lists are not shown.