Minos Garofalakis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Minos Garofalakis has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Nilesh Dalvi
Yahoo! Research
2 shared publications - Chris Jermaine
Rice University , 6100 Main Street, Houston, TX 77005
1 shared publication - Graham Cormode
University of Warwick University of Warwick
1 shared publication - Peter J. Haas
IBM Almaden Research Center , 650 Harry Road, San Jose, CA 95120-6099
1 shared publication Vibhor Rastogi
Yahoo! Research
1 shared publication- Vibhor Rastogi
Technical University of Crete
1 shared publication
Latest Publications
- 7 December 2018
- Published by Springer Nature
- p. 1132-1139
Discrete Wavelet Transform and Wavelet Synopses
- 7 December 2018
- Published by Springer Nature
- p. 1132-1139
Discrete Wavelet Transform and Wavelet Synopses
- 7 December 2018
- Published by Springer Nature
- p. 1162-1170
Distributed Data Streams
- 7 December 2018
- Published by Springer Nature
- p. 4588-4595
Wavelets on Streams
- 1 January 2016
- Published by Springer Nature
- p. 1-8
Discrete Wavelet Transform and Wavelet Synopses
- 1 January 2016
- Published by Springer Nature
- p. 1-9
Distributed Data Streams
- 1 January 2016
- Published by Springer Nature
- p. 1-8
Wavelets on Streams
- Top Cited PapersOpen Access
- 31 December 2011
- Published by Emerald Publishing in Foundations and Trends® in Databases
- Vol. 4 (1-3) , 1-294
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
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.
- 31 December 2011
- Published by Emerald Publishing in Foundations and Trends® in Databases
- Vol. 4 (1-3) , 1-294
Top Cited PapersOpen AccessSynopses for Massive Data: Samples, Histograms, Wavelets, Sketches
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.
- Open Access
Large-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being applied in practical settings on large real-life datasets. Towards this end, we propose a principled framework to scale any generic EM algorithm. Our technique consists of running multiple instances of the EM algorithm on small neighborhoods of the data and passing messages across neighborhoods to construct a global solution. We prove formal properties of our framework and experimentally demonstrate the effectiveness of our approach in scaling EM algorithms.
Open AccessLarge-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being applied in practical settings on large real-life datasets. Towards this end, we propose a principled framework to scale any generic EM algorithm. Our technique consists of running multiple instances of the EM algorithm on small neighborhoods of the data and passing messages across neighborhoods to construct a global solution. We prove formal properties of our framework and experimentally demonstrate the effectiveness of our approach in scaling EM algorithms.
- Open Access
- 1 January 2011
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (4) , 208-218
Large-scale collective entity matching
- 1 January 2011
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (4) , 208-218
Open AccessLarge-scale collective entity matching