Google Tech TalksJanuary, 23 2008ABSTRACTI will describe some algorithms for addressing some fundamental optimizationproblems that arise in the context of data storage and management. In thefirst part of the talk we will address the following question: How shouldwe store data in order to effectively cope with non-uniform demand fordata? How many copies of popular data objects do we need? Where shouldwe store them for effective load balancing?In the second part of the talk we will address the issue of movingdata objects quickly, to react to changing demand patterns. We willdevelop approximation algorithms for these problems.The first part of the talk is joint work with Golubchik, Khanna,Thurimella and Zhu. The second part is joint work with Kim and Wan.Speaker: Samir KhullerSamir Khuller received his M.S and Ph.D from Cornell University in 1989and 1990, respectively. He spent 2 years as a Research Associate at theInstitute for Advanced Computer Studies at the University of Maryland,before joining the Computer Science Department in 1992, where he is a Professorand Associate Chair in the Department of Computer Science.His research interests are in graph algorithms, discrete optimization, andcomputational geometry. He has published about 130 journal and conferencepapers, and several book chapters on these topics.He received the National Science Foundation's Career Development Award,the Dean's Teaching Excellence Award and also a CTE-Lilly Teaching Fellowship.In 2003, he and his students were awarded the "Best newcomer paper" award forthe ACM PODS Conference. He received the University of Maryland'sDistinguished Scholar Teacher Award in 2007.
Questions about Algorithms for Data Management and Migration
Want more info about Algorithms for Data Management and Migration?
Get free advice from education experts and Noodle community members.