Guest Speaker: Ashwin Lall
The k-Regret Operator
The k-regret query is an operator for multi-criteria decision-making that can select k representative tuples from a database such that every user's ideal tuple in the entire database is similar to one of the k points in value, i.e., all users experience a small regret ratio from picking among these k points as opposed to from the entire database. This approach combines benefits of the methods top-k and skyline; it controls the size of the output but does not require knowledge of users' preferences. This talk will define the k-regret operator, give interesting related results, and list open problems in the area.
Ashwin Lall is an Associate Professor in the Department of Mathematics and Computer Science at Denison University. He was recently the Bayley-Bowen fellow at Denison (2013-16). Prior to Denison, he was a postdoc at Georgia Tech for two years. He received his Ph.D. from the University of Rochester, where he was a Sproull Fellow. His research interests include databases, networking, and natural language processing with a focus on algorithms for query optimization and data streaming.
Hosts: Srinivasan Parthasarathy & Chris Stewart