Amine Mhedhbi awarded coveted 2020 Microsoft Research PhD Fellowship

Friday, January 24, 2020

PhD candidate Amine Mhedhbi is one of 10 recipients across North America and the only recipient from Canada to receive a 2020 Microsoft Research PhD Fellowship. Established in 2008, these prestigious fellowships have supported more than 150 exceptional doctoral students to date. 

photo of Amine Mhedhbi in the Davis Centre

Microsoft Research PhD Fellowships are awarded for two years to doctoral candidates in their third year of study. In addition to a $42,000 USD stipend for each of two years, recipients are invited to interview for a salaried internship with leading Microsoft researchers who work on projects related to the recipient’s field of study. As well, recipients are invited to Microsoft’s PhD Summit — a two-day workshop in fall 2020 held at one of Microsoft Research’s labs, where fellows will meet with Microsoft researchers and other top students to share their research.

Supervised by Professor Semih Salihoglu, a member of the Cheriton School of Computer Science’s Data Systems Group, Amine’s research focuses on understanding and developing new techniques across the graph database stack to improve execution performance of graph analytical workloads. One of his recent projects explores the interplay between worst-case optimal join algorithms and traditional join processing under a hybrid cost-model. In addition, he is working on designing flexible storage for faster graph traversal and using factorized processing to improve graph database query executors.

“Amine leads an ambitious research project to develop a new in-memory graph database management system developed from scratch we call GraphflowDB,” said Professor Salihoglu. “Graph databases are software systems to store, query, and manage graph-structured data — the kind that’s typically thought of as networks. Such data appear in many areas, from social networks to financial networks to data centre traffic networks.

“Amine’s research focuses on two primary questions — how to perform very fast joins to detect complex patterns in graph-structured data, and how to scale an in-memory graph database system. For fast joins, he has worked on integrating fast multiway intersection-based join operators that seamlessly work with traditional join operators as well as operators that can factorize intermediate query results. To scale the system, Amine and two master’s students have been developing a compressed list-based indexing sub-system that allows users to benefit from GraphflowDB’s fast join capabilities for very complex queries, such as those that can detect complex fraud patterns in financial networks.

“In our internal benchmarks, GraphflowDB outperforms existing systems by several orders of magnitude on many workloads, demonstrating the practicality and efficiency of the techniques Amine has been working on. His work has been exceptional and I am very happy to see him get this fellowship.”

“Congratulations to Amine on receiving a prestigious 2020 Microsoft Research PhD Fellowship,” said Mark Giesbrecht, Director of the David R. Cheriton School of Computer Science. “He has also been a recipient of a David R. Cheriton Graduate Scholarship and now with this fellowship from Microsoft he will be able to further expand his exemplary and award-winning research on graph databases.”

The other nine doctoral students selected for the 2020 Microsoft Research PhD Fellowship are from Carnegie Mellon, Georgia Tech, Harvard, MIT, Princeton, University of Illinois at Urbana-Champaign, UCLA and Washington State University.

  1. 2020 (7)
    1. February (1)
    2. January (6)
  2. 2019 (90)
    1. December (3)
    2. November (8)
    3. October (6)
    4. September (9)
    5. August (7)
    6. July (8)
    7. June (10)
    8. May (5)
    9. April (11)
    10. March (6)
    11. February (10)
    12. January (7)
  3. 2018 (82)
    1. December (6)
    2. November (8)
    3. October (8)
    4. September (12)
    5. August (4)
    6. July (8)
    7. June (8)
    8. May (5)
    9. April (10)
    10. March (6)
    11. February (2)
    12. January (5)
  4. 2017 (50)
  5. 2016 (27)
  6. 2015 (41)
  7. 2014 (32)
  8. 2013 (46)
  9. 2012 (17)
  10. 2011 (20)