Farouk Toumani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Farouk Toumani has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Chao Zhang
University of Waterloo, Waterloo, Canada
3 shared publications - Alain Eschalier
Analgesia Institute, Clermont-Ferrand, France
2 shared publications - Alice Corteval
Analgesia Institute, Clermont-Ferrand, France
2 shared publications - Anne Tournadre
Rheumatology Department, Clermont-Ferrand University Hospital, INRAe and University Clermont Auvergne, Clermont-Ferrand
2 shared publications - Bruno Pereira
DRCI, Unité de Biostatistiques, CHU Clermont-Ferrand, Université Clermont Auvergne, Clermont-Ferrand, France
2 shared publications - Christian Dualé
Inserm U1107 Neuro-Dol, Faculté de Médecine, Place Henri Dunant, 63001 Clermont-Ferrand, France; CHU Clermont-Ferrand, Direction de la Recherche Clinique et des Innovations, 7 place Henri Dunant, 63000 Clermont-Ferrand, France; CHU Clermont-Ferrand, Plateforme d'Investigation Clinique (Inserm CIC1405), 58 rue Montalembert, 63000 Clermont-Ferrand, France
2 shared publications
Latest Publications
- 27 August 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (5) , 83
Parallelization of incremental aggregations over sliding windows
- 27 August 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (5) , 83
Parallelization of incremental aggregations over sliding windows
- Open Access
- 7 August 2025
- Published by Taylor & Francis in Assessment & Evaluation in Higher Education
- Vol. 51 (2) , 379-397
Development and validation of a scale to assess students’ perceptions of team feedback in collaborative tasks
- 7 August 2025
- Published by Taylor & Francis in Assessment & Evaluation in Higher Education
- Vol. 51 (2) , 379-397
Open AccessDevelopment and validation of a scale to assess students’ perceptions of team feedback in collaborative tasks
- Open Access
- 10 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 49 (2) , 1-46
Sharing Queries with Nonequivalent User-defined Aggregate Functions
This article presents Sharing User-Defined Aggregate Function (SUDAF), a declarative framework that allows users to write User-defined Aggregate Functions (UDAFs) as mathematical expressions and use them in Structured Query Language statements. SUDAF rewrites partial aggregates of UDAFs using built-in aggregate functions and supports efficient dynamic caching and reusing of partial aggregates. Our experiments show that rewriting UDAFs using built-in functions can significantly speed up queries with UDAFs, and the proposed sharing approach can yield up to two orders of magnitude improvement in query execution time. The article studies also an extension of SUDAF to support sharing partial results between arbitrary queries with UDAFs. We show a connection with the problem of query rewriting using views and introduce a new class of rewritings, called SUDAF rewritings, which enables to use views that have aggregate functions different from the ones used in the input query. We investigate the underlying rewriting-checking and rewriting-existing problem. Our main technical result is a reduction of these problems to, respectively, rewriting-checking and rewriting-existing of the so-called aggregate candidates , a class of rewritings that has been deeply investigated in the literature.
- 10 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 49 (2) , 1-46
Open AccessSharing Queries with Nonequivalent User-defined Aggregate Functions
This article presents Sharing User-Defined Aggregate Function (SUDAF), a declarative framework that allows users to write User-defined Aggregate Functions (UDAFs) as mathematical expressions and use them in Structured Query Language statements. SUDAF rewrites partial aggregates of UDAFs using built-in aggregate functions and supports efficient dynamic caching and reusing of partial aggregates. Our experiments show that rewriting UDAFs using built-in functions can significantly speed up queries with UDAFs, and the proposed sharing approach can yield up to two orders of magnitude improvement in query execution time. The article studies also an extension of SUDAF to support sharing partial results between arbitrary queries with UDAFs. We show a connection with the problem of query rewriting using views and introduce a new class of rewritings, called SUDAF rewritings, which enables to use views that have aggregate functions different from the ones used in the input query. We investigate the underlying rewriting-checking and rewriting-existing problem. Our main technical result is a reduction of these problems to, respectively, rewriting-checking and rewriting-existing of the so-called aggregate candidates , a class of rewritings that has been deeply investigated in the literature.
- Open Access
- 14 January 2022
- Published by JMIR Publications Inc. in Journal of Medical Internet Research
- Vol. 24 (1) , e32362
Fine Detection of Human Motion During Activities of Daily Living as a Clinical Indicator for the Detection and Early Treatment of Chronic Diseases: The E-Mob Project
Methods to measure physical activity and sedentary behaviors typically quantify the amount of time devoted to these activities. Among patients with chronic diseases, these methods can provide interesting behavioral information, but generally do not capture detailed body motion and fine movement behaviors. Fine detection of motion may provide additional information about functional decline that is of clinical interest in chronic diseases. This perspective paper highlights the need for more developed and sophisticated tools to better identify and track the decomposition, structuration, and sequencing of the daily movements of humans. The primary goal is to provide a reliable and useful clinical diagnostic and predictive indicator of the stage and evolution of chronic diseases, in order to prevent related comorbidities and complications among patients.
- 14 January 2022
- Published by JMIR Publications Inc. in Journal of Medical Internet Research
- Vol. 24 (1) , e32362
Open AccessFine Detection of Human Motion During Activities of Daily Living as a Clinical Indicator for the Detection and Early Treatment of Chronic Diseases: The E-Mob Project
Methods to measure physical activity and sedentary behaviors typically quantify the amount of time devoted to these activities. Among patients with chronic diseases, these methods can provide interesting behavioral information, but generally do not capture detailed body motion and fine movement behaviors. Fine detection of motion may provide additional information about functional decline that is of clinical interest in chronic diseases. This perspective paper highlights the need for more developed and sophisticated tools to better identify and track the decomposition, structuration, and sequencing of the daily movements of humans. The primary goal is to provide a reliable and useful clinical diagnostic and predictive indicator of the stage and evolution of chronic diseases, in order to prevent related comorbidities and complications among patients.
- Open Access
- 24 July 2021
- Published by JMIR Publications Inc. in JMIR Preprints
Fine Detection of Human Motion During Activities of Daily Living as a Clinical Indicator for the Detection and Early Treatment of Chronic Diseases: The E-Mob Project (Preprint)
UNSTRUCTURED Methods to measure physical activity and sedentary behaviors typically quantify the amount of time devoted to these activities. Among patients with chronic diseases, these methods can provide interesting behavioral information, but generally do not capture detailed body motion and fine movement behaviors. Fine detection of motion may provide additional information about functional decline that is of clinical interest in chronic diseases. This perspective paper highlights the need for more developed and sophisticated tools to better identify and track the decomposition, structuration, and sequencing of the daily movements of humans. The primary goal is to provide a reliable and useful clinical diagnostic and predictive indicator of the stage and evolution of chronic diseases, in order to prevent related comorbidities and complications among patients.
- 24 July 2021
- Published by JMIR Publications Inc. in JMIR Preprints
Open AccessFine Detection of Human Motion During Activities of Daily Living as a Clinical Indicator for the Detection and Early Treatment of Chronic Diseases: The E-Mob Project (Preprint)
UNSTRUCTURED Methods to measure physical activity and sedentary behaviors typically quantify the amount of time devoted to these activities. Among patients with chronic diseases, these methods can provide interesting behavioral information, but generally do not capture detailed body motion and fine movement behaviors. Fine detection of motion may provide additional information about functional decline that is of clinical interest in chronic diseases. This perspective paper highlights the need for more developed and sophisticated tools to better identify and track the decomposition, structuration, and sequencing of the daily movements of humans. The primary goal is to provide a reliable and useful clinical diagnostic and predictive indicator of the stage and evolution of chronic diseases, in order to prevent related comorbidities and complications among patients.
- Open Access
A relational framework for inconsistency-aware query answering
We introduce a novel framework for encoding inconsistency into relational tuples and tackling query answering for union of con-junctive queries (UCQs) with respect to a set of denial constraints (DCs). We define a notion of inconsistent tuple with respect to a set of DCs and define four measures of inconsistency degree of an answer tuple of a query. Two of these measures revolve around the minimal number of inconsistent tuples necessary to compute the answer tuples of a UCQ, whereas the other two rely on the maximum number of inconsistent tuples under set-and bag-semantics, respectively. In order to compute these measures of inconsistency degree, we leverage two models of provenance semiring, namely why-provenance and provenance polynomials, which can be computed in polynomial time in the size of the relational instances for UCQs. Hence, these measures of inconsistency degree are also computable in polynomial time in data complexity. We also investigate top-k and bounded query answering by ranking the answer tuples by their inconsistency degrees. We explore both a full materialized approach and a semi-materialized approach for the computation of top-k and bounded query results.
Open AccessA relational framework for inconsistency-aware query answering
We introduce a novel framework for encoding inconsistency into relational tuples and tackling query answering for union of con-junctive queries (UCQs) with respect to a set of denial constraints (DCs). We define a notion of inconsistent tuple with respect to a set of DCs and define four measures of inconsistency degree of an answer tuple of a query. Two of these measures revolve around the minimal number of inconsistent tuples necessary to compute the answer tuples of a UCQ, whereas the other two rely on the maximum number of inconsistent tuples under set-and bag-semantics, respectively. In order to compute these measures of inconsistency degree, we leverage two models of provenance semiring, namely why-provenance and provenance polynomials, which can be computed in polynomial time in the size of the relational instances for UCQs. Hence, these measures of inconsistency degree are also computable in polynomial time in data complexity. We also investigate top-k and bounded query answering by ranking the answer tuples by their inconsistency degrees. We explore both a full materialized approach and a semi-materialized approach for the computation of top-k and bounded query results.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1750-1753
SUDAF: Sharing User-Defined Aggregate Functions
We present SUDAF (Sharing User-Defined Aggregate Functions), a declarative framework that allows users to formulate UDAFs as mathematical expressions and use them in SQL statements. SUDAF rewrites partial aggregates of UDAFs using built-in aggregate functions and supports efficient dynamic caching and reusing of partial aggregates. Our evaluation shows that using SUDAF on top of Spark SQL can lead from one to two orders of magnitude improvement in query execution times compared to the original Spark SQL.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1750-1753
SUDAF: Sharing User-Defined Aggregate Functions
We present SUDAF (Sharing User-Defined Aggregate Functions), a declarative framework that allows users to formulate UDAFs as mathematical expressions and use them in SQL statements. SUDAF rewrites partial aggregates of UDAFs using built-in aggregate functions and supports efficient dynamic caching and reusing of partial aggregates. Our evaluation shows that using SUDAF on top of Spark SQL can lead from one to two orders of magnitude improvement in query execution times compared to the original Spark SQL.