Priyank Jaini, PhD candidate
David R. Cheriton School of Computer Science
Gustavo Fortes Tondello, PhD candidate
David R. Cheriton School of Computer Science
Meng Tang, PhD candidate
David R. Cheriton School of Computer Science
Steve Mann, Department of Electrical and Computer Engineering
University of Toronto
Please note: This presentation has been moved to MC 4041.
Nastaran Naseri, Department of Information Systems
University of Cologne, Germany
Mohammad Ansarin, Rotterdam School of Management
Erasmus University, Netherlands
Lily Wang, University of Waterloo
A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element. Similarly, we can ask about the dual problem: for each element of an array of integers $A[i]$, what is the position of the furthest smaller element?
Kyle Jamieson
Department of Computer Science, Princeton University
Indexing is a game of tradeoffs: Organize your data now and be rewarded with lower read latencies later. The question of whether, how, or when to organize has led to a proliferation of many different, often highly-specialized index structures.
Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science