Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Methods for Approximate Query Processing (AQP) are essential for dealing with massive data. They are often the only means of providing interactive response times when exploring massive datasets, and are also needed to handle high speed data streams. These methods proceed by computing a lossy, compact synopsis of the data, and then executing the query of interest against the synopsis rather than the entire dataset. We describe basic principles and recent developments in AQP. We focus on four key synopses: random samples, histograms, wavelets, and sketches. We consider issues such as accuracy, space and time efficiency, optimality, practicality, range of applicability, error bounds on query answers, and incremental maintenance.We also discuss the tradeoffs between the different synopsis types. © 2012 G. Cormode, M. Garofalakis, P. J. Haas and C. Jermaine.
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Nanda Kambhatla
ACL 2004