Panagiota Fatourou - Concurrent Indexes Supporting Complex Queries
About the speaker:
Panagiota Fatourou is a Professor at the Department of Computer Science of the University of Crete, Greece and the Institute of Computer Science (ICS) of the Foundation for Research and Technology - Hellas (FORTH). She has been (twice) a visiting Professor at the School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne in Switzerland. She has worked as a postdoc at Max-Planck Institut für Informatik, Saarbrücken, Germany, and at the Computer Science Department of the University of Toronto, Canada. Her research interests focus on the principles of parallel and distributed computing.
Panagiota Fatourou is the chair of the ACM Europe Council (and since July 2015, an elected member of the council, currently serving her second term). She has served as the editor of the Distributed Computing Column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS), and as the General Chair of the ACM Symposium on Principles of Distributed Computing (PODC 2013), the top conference in her field. She is a member-at-large of the steering committees of the ACM Symposium on Principles of Distributed Computing (PODC) and the International Conference on Principles of Distributed Systems (OPODIS). She has served as the PC Chair of the 20th International Conference on Principles of Distributed Systems (OPODIS 2016) (together with Fernando Pedone, University of Lugano, Switzerland), and of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’17), track “Distributed Computing and Communication Networks” (together with Sergio Rajsbaum, UNAM, Mexico). She has participated in the PC of more than 40 conferences. She has been an ACM Distinguished Speaker and a Featured ACM Member. She has been awarded an FSMP Distinguished Professor Fellowship from the Foundation Sciences Mathématiques de Paris, and a Marie Curie Individual Fellowship.
Concurrent dictionaries lie in the heart of most modern concurrent applications. We present implementations of search indexes in asynchronous shared-memory systems. We also present how to support complex queries (such as range queries, etc.) on top of such indexes, in addition to supporting standard index operations such as Insert, Delete and Find. Such queries are required in many big-data applications, where shared in-memory tree-based data indices must be created for fast data retrieval and useful data analytics.