Eric Simon
Eric Simon has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Antonios Ntroumpogiannis
University of Crete
2 shared publications - Bernd Amann
Sorbonne Université, CNRS, LIP6
2 shared publications - Dennis Shasha
Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA
2 shared publications - Gabriel Weber
Amazon, São Paulo, Brazil
2 shared publications - Ioannis Tsamardinos
University of Crete
2 shared publications - Juliana Freire
New York University, New York City, NY, USA
2 shared publications
Latest Publications
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 15 (2) , 1-41
Controlling the Correctness of Aggregation Operations During Sessions of Interactive Analytic Queries
We present a comprehensive set of conditions and rules to control the correctness of aggregation queries within an interactive data analysis session. The goal is to extend self-service data preparation and Business Intelligence (BI) tools to automatically detect semantically incorrect aggregate queries on analytic tables and views built by using the common analytic operations including filter, project, join, aggregate, union, difference, and pivot. We introduceaggregable propertiesto describe for any attribute of an analytic table, which aggregation functions correctly aggregate the attribute along which sets of dimension attributes. These properties can also be used to formally identify attributes that aresummarizablewith respect to some aggregation function along a given set of dimension attributes. This is particularly helpful to detect incorrect aggregations of measures obtained through the use of non-distributive aggregation functions like average and count. We extend the notion of summarizability by introducing a newgeneralized summarizability conditionto control the aggregation of attributes after any analytic operation. Finally, we definepropagation rulesthat transform aggregable properties of the query input tables into new aggregable properties for the result tables, preserving summarizability and generalized summarizability.
- 23 June 2023
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 15 (2) , 1-41
Open AccessControlling the Correctness of Aggregation Operations During Sessions of Interactive Analytic Queries
We present a comprehensive set of conditions and rules to control the correctness of aggregation queries within an interactive data analysis session. The goal is to extend self-service data preparation and Business Intelligence (BI) tools to automatically detect semantically incorrect aggregate queries on analytic tables and views built by using the common analytic operations including filter, project, join, aggregate, union, difference, and pivot. We introduceaggregable propertiesto describe for any attribute of an analytic table, which aggregation functions correctly aggregate the attribute along which sets of dimension attributes. These properties can also be used to formally identify attributes that aresummarizablewith respect to some aggregation function along a given set of dimension attributes. This is particularly helpful to detect incorrect aggregations of measures obtained through the use of non-distributive aggregation functions like average and count. We extend the notion of summarizability by introducing a newgeneralized summarizability conditionto control the aggregation of attributes after any analytic operation. Finally, we definepropagation rulesthat transform aggregable properties of the query input tables into new aggregable properties for the result tables, preserving summarizability and generalized summarizability.
- 14 January 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (4) , 845-886
A meta-level analysis of online anomaly detectors
- 14 January 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (4) , 845-886
A meta-level analysis of online anomaly detectors
- Open Access
A Meta-level Analysis of Online Anomaly Detectors
Real-time detection of anomalies in streaming data is receiving increasing attention as it allows us to raise alerts, predict faults, and detect intrusions or threats across industries. Yet, little attention has been given to compare the effectiveness and efficiency of anomaly detectors for streaming data (i.e., of online algorithms). In this paper, we present a qualitative, synthetic overview of major online detectors from different algorithmic families (i.e., distance, density, tree or projection-based) and highlight their main ideas for constructing, updating and testing detection models. Then, we provide a thorough analysis of the results of a quantitative experimental evaluation of online detection algorithms along with their offline counterparts. The behavior of the detectors is correlated with the characteristics of different datasets (i.e., meta-features), thereby providing a meta-level analysis of their performance. Our study addresses several missing insights from the literature such as (a) how reliable are detectors against a random classifier and what dataset characteristics make them perform randomly; (b) to what extent online detectors approximate the performance of offline counterparts; (c) which sketch strategy and update primitives of detectors are best to detect anomalies visible only within a feature subspace of a dataset; (d) what are the tradeoffs between the effectiveness and the efficiency of detectors belonging to different algorithmic families; (e) which specific characteristics of datasets yield an online algorithm to outperform all others.
Open AccessA Meta-level Analysis of Online Anomaly Detectors
Real-time detection of anomalies in streaming data is receiving increasing attention as it allows us to raise alerts, predict faults, and detect intrusions or threats across industries. Yet, little attention has been given to compare the effectiveness and efficiency of anomaly detectors for streaming data (i.e., of online algorithms). In this paper, we present a qualitative, synthetic overview of major online detectors from different algorithmic families (i.e., distance, density, tree or projection-based) and highlight their main ideas for constructing, updating and testing detection models. Then, we provide a thorough analysis of the results of a quantitative experimental evaluation of online detection algorithms along with their offline counterparts. The behavior of the detectors is correlated with the characteristics of different datasets (i.e., meta-features), thereby providing a meta-level analysis of their performance. Our study addresses several missing insights from the literature such as (a) how reliable are detectors against a random classifier and what dataset characteristics make them perform randomly; (b) to what extent online detectors approximate the performance of offline counterparts; (c) which sketch strategy and update primitives of detectors are best to detect anomalies visible only within a feature subspace of a dataset; (d) what are the tradeoffs between the effectiveness and the efficiency of detectors belonging to different algorithmic families; (e) which specific characteristics of datasets yield an online algorithm to outperform all others.
- 13 June 2022
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (2) , 473
Correction to: BugDoc Iterative debugging and explanation of pipeline executions
- 13 June 2022
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (2) , 473
Correction to: BugDoc Iterative debugging and explanation of pipeline executions
- Open Access
Controlling the Correctness of Aggregation Operations During Sessions of Interactive Analytic Queries
We present a comprehensive set of conditions and rules to control the correctness of aggregation queries within an interactive data analysis session. The goal is to extend self-service data preparation and BI tools to automatically detect semantically incorrect aggregate queries on analytic tables and views built by using the common analytic operations including filter, project, join, aggregate, union, difference, and pivot. We introduce aggregable properties to describe for any attribute of an analytic table which aggregation functions correctly aggregates the attribute along which sets of dimension attributes. These properties can also be used to formally identify attributes which are summarizable with respect to some aggregation function along a given set of dimension attributes. This is particularly helpful to detect incorrect aggregations of measures obtained through the use of non-distributive aggregation functions like average and count. We extend the notion of summarizability by introducing a new generalized summarizability condition to control the aggregation of attributes after any analytic operation. Finally, we define propagation rules which transform aggregable properties of the query input tables into new aggregable properties for the result tables, preserving summarizability and generalized summarizability.
Open AccessControlling the Correctness of Aggregation Operations During Sessions of Interactive Analytic Queries
We present a comprehensive set of conditions and rules to control the correctness of aggregation queries within an interactive data analysis session. The goal is to extend self-service data preparation and BI tools to automatically detect semantically incorrect aggregate queries on analytic tables and views built by using the common analytic operations including filter, project, join, aggregate, union, difference, and pivot. We introduce aggregable properties to describe for any attribute of an analytic table which aggregation functions correctly aggregates the attribute along which sets of dimension attributes. These properties can also be used to formally identify attributes which are summarizable with respect to some aggregation function along a given set of dimension attributes. This is particularly helpful to detect incorrect aggregations of measures obtained through the use of non-distributive aggregation functions like average and count. We extend the notion of summarizability by introducing a new generalized summarizability condition to control the aggregation of attributes after any analytic operation. Finally, we define propagation rules which transform aggregable properties of the query input tables into new aggregable properties for the result tables, preserving summarizability and generalized summarizability.
- 12 July 2020
- Published by Springer Nature
- p. 72-78
Data Pipelines for Personalized Exploration of Rated Datasets
- 12 July 2020
- Published by Springer Nature
- p. 72-78
Data Pipelines for Personalized Exploration of Rated Datasets
- Open Access
- 1 September 2001
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 30 (3) , 70-75
The Ecobase project
A very large number of data sources on environment, energy, and natural resources are available worldwide. Unfortunately, users usually face several problems when they want to search and use relevant information. In the Ecobase project, we address these problems in the context of several environmental applications in Brazil and Europe. We propose a distributed architecture for environmental information systems (EIS) based on the Le Select middleware developed at INRIA. In this paper, we present this architecture and its capabilities, and discuss the lessons learned and open issues.
- 1 September 2001
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 30 (3) , 70-75
Open AccessThe Ecobase project
A very large number of data sources on environment, energy, and natural resources are available worldwide. Unfortunately, users usually face several problems when they want to search and use relevant information. In the Ecobase project, we address these problems in the context of several environmental applications in Brazil and Europe. We propose a distributed architecture for environmental information systems (EIS) based on the Le Select middleware developed at INRIA. In this paper, we present this architecture and its capabilities, and discuss the lessons learned and open issues.