Le Gruenwald
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Le Gruenwald has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Sven Groppe
Professorship of Artificial Intelligence, Technische Universität Bergakademie, Freiberg, 09599, Germany
8 shared publications - Laurent D ' Orazio
Univ Rennes, CNRS, IRISA
6 shared publications - Egawati Panjei
Univ Oklahoma, Sch Comp Sci, Devon Energy Hall 110 W Boyd St, Norman, OK 73069 USA
3 shared publications - Eleazar Leal
Department of Computer Science, University of Minnesota Duluth, Duluth, USA
3 shared publications - Jorge Bernardino
Institute of Engineering of Coimbra—ISEC, Polytechnic University of Coimbra, Rua da Misericórdia, Lagar dos Cortiços, S. Martinho do Bispo, 3045-093 Coimbra, Portugal
3 shared publications - An-Truong Tran Phan
Vinh Long University of Technology Education
2 shared publications
Latest Publications
- Open Access
- 13 May 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (5) , 130
Automatic Index Tuning via Quantum Deep Reinforcement Learning
The Index Selection Problem (ISP) refers to the task of automatically identifying the most appropriate set of indexes for a given database workload that can minimize execution costs. However, ISP is a fundamental yet complex challenge in database management systems. In the era of data-intensive applications, efficient index strategies are increasingly necessary to maintain scalability and responsiveness. This paper presents a novel automated index selection algorithm for centralized databases that employs a Double Deep Q-Network (DDQN) as the classical learning backbone and extends it with quantum-enhanced variants. Two hybrid quantum variants were proposed: Quantum Double Deep Q-Network Mixed (QDDQNM), which incorporates a residual classical pathway, and Quantum Double Deep Q-Network Boosted (QDDQNB), a boosted model without residuals. All variants were systematically evaluated using the TPC-H benchmark at two small scale factors, 10 MB and 100 MB. Experimental results show that the evaluated Deep Reinforcement Learning (DRL)-based methods improve on the SMARTIX baseline within this proof-of-concept setting. The quantum-enhanced models achieved higher best-run accumulated rewards in the reported experiments, but they also incurred substantially higher simulation cost. The results therefore suggest interesting hybrid learning behavior under the tested conditions, while also highlighting that practical scalability and cost-performance trade-offs remain important limitations for future work.
- 13 May 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (5) , 130
Open AccessAutomatic Index Tuning via Quantum Deep Reinforcement Learning
The Index Selection Problem (ISP) refers to the task of automatically identifying the most appropriate set of indexes for a given database workload that can minimize execution costs. However, ISP is a fundamental yet complex challenge in database management systems. In the era of data-intensive applications, efficient index strategies are increasingly necessary to maintain scalability and responsiveness. This paper presents a novel automated index selection algorithm for centralized databases that employs a Double Deep Q-Network (DDQN) as the classical learning backbone and extends it with quantum-enhanced variants. Two hybrid quantum variants were proposed: Quantum Double Deep Q-Network Mixed (QDDQNM), which incorporates a residual classical pathway, and Quantum Double Deep Q-Network Boosted (QDDQNB), a boosted model without residuals. All variants were systematically evaluated using the TPC-H benchmark at two small scale factors, 10 MB and 100 MB. Experimental results show that the evaluated Deep Reinforcement Learning (DRL)-based methods improve on the SMARTIX baseline within this proof-of-concept setting. The quantum-enhanced models achieved higher best-run accumulated rewards in the reported experiments, but they also incurred substantially higher simulation cost. The results therefore suggest interesting hybrid learning behavior under the tested conditions, while also highlighting that practical scalability and cost-performance trade-offs remain important limitations for future work.
- 18 August 2025
- Published by Springer Nature
- p. 178-193
Energy and Performance Evaluation of Serverless and Serverful Models on Spark for Database Join Operations
- 18 August 2025
- Published by Springer Nature
- p. 178-193
Energy and Performance Evaluation of Serverless and Serverful Models on Spark for Database Join Operations
- Open Access
- 22 November 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (12) , 439
QRLIT: Quantum Reinforcement Learning for Database Index Tuning
Selecting indexes capable of reducing the cost of query processing in database systems is a challenging task, especially in large-scale applications. Quantum computing has been investigated with promising results in areas related to database management, such as query optimization, transaction scheduling, and index tuning. Promising results have also been seen when reinforcement learning is applied for database tuning in classical computing. However, there is no existing research with implementation details and experiment results for index tuning that takes advantage of both quantum computing and reinforcement learning. This paper proposes a new algorithm called QRLIT that uses the power of quantum computing and reinforcement learning for database index tuning. Experiments using the database TPC-H benchmark show that QRLIT exhibits superior performance and a faster convergence compared to its classical counterpart.
- 22 November 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (12) , 439
Open AccessQRLIT: Quantum Reinforcement Learning for Database Index Tuning
Selecting indexes capable of reducing the cost of query processing in database systems is a challenging task, especially in large-scale applications. Quantum computing has been investigated with promising results in areas related to database management, such as query optimization, transaction scheduling, and index tuning. Promising results have also been seen when reinforcement learning is applied for database tuning in classical computing. However, there is no existing research with implementation details and experiment results for index tuning that takes advantage of both quantum computing and reinforcement learning. This paper proposes a new algorithm called QRLIT that uses the power of quantum computing and reinforcement learning for database index tuning. Experiments using the database TPC-H benchmark show that QRLIT exhibits superior performance and a faster convergence compared to its classical counterpart.
- Open Access
- 19 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10706
Federated Learning: A Comparative Study of Defenses Against Poisoning Attacks
Federated learning is a new paradigm where multiple data owners, referred to as clients, work together with a global server to train a shared machine learning model without disclosing their personal training data. Despite its many advantages, the system is vulnerable to client compromise by malicious agents attempting to modify the global model. Several defense algorithms against untargeted and targeted poisoning attacks on model updates in federated learning have been proposed and evaluated separately. This paper compares the performances of six state-of-the art defense algorithms—PCA + K-Means, KPCA + K-Means, CONTRA, KRUM, COOMED, and RPCA + PCA + K-Means. We explore a variety of situations not considered in the original papers. These include varying the percentage of Independent and Identically Distributed (IID) data, the number of clients, and the percentage of malicious clients. This comprehensive performance study provides the results that the users can use to select appropriate defense algorithms to employ based on the characteristics of their federated learning systems.
- 19 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10706
Open AccessFederated Learning: A Comparative Study of Defenses Against Poisoning Attacks
Federated learning is a new paradigm where multiple data owners, referred to as clients, work together with a global server to train a shared machine learning model without disclosing their personal training data. Despite its many advantages, the system is vulnerable to client compromise by malicious agents attempting to modify the global model. Several defense algorithms against untargeted and targeted poisoning attacks on model updates in federated learning have been proposed and evaluated separately. This paper compares the performances of six state-of-the art defense algorithms—PCA + K-Means, KPCA + K-Means, CONTRA, KRUM, COOMED, and RPCA + PCA + K-Means. We explore a variety of situations not considered in the original papers. These include varying the percentage of Independent and Identically Distributed (IID) data, the number of clients, and the percentage of malicious clients. This comprehensive performance study provides the results that the users can use to select appropriate defense algorithms to employ based on the characteristics of their federated learning systems.
- 2 September 2024
- Published by Springer Nature
- p. 489-493
GUESS: MonitorinG Join qUery Execution in Serverless and Serverful Spark
- 2 September 2024
- Published by Springer Nature
- p. 489-493
GUESS: MonitorinG Join qUery Execution in Serverless and Serverful Spark
- 30 August 2024
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 154
Discovering outlying attributes of outliers in data streams
- 30 August 2024
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 154
Discovering outlying attributes of outliers in data streams
- 10 July 2023
- Published by Springer Nature
- p. 252-261
Quantum Data Management and Quantum Machine Learning for Data Management: State-of-the-Art and Open Challenges
- 10 July 2023
- Published by Springer Nature
- p. 252-261
Quantum Data Management and Quantum Machine Learning for Data Management: State-of-the-Art and Open Challenges
- Open Access
- 18 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Quantum Machine Learning for Join Order Optimization using Variational Quantum Circuits
The optimization of queries speeds up query processing in databases. One of the most time-consuming tasks in query processing is the join operation, where the order of the joins plays a crucial role in determining the number of tuples to be processed for intermediate results, and hence, the overall processing costs. In this paper, we use a variational quantum circuit (VQC) to create a hybrid classical-quantum machine learning algorithm to predict efficient join orders by learning from past join orders. We develop an encoding of the join order problem using a low number of qubits. We show that VQCs with filtering of cross joins outperform the classical dynamic programming optimizer of PostgreSQL with a 2.7% faster execution time.
- 18 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessQuantum Machine Learning for Join Order Optimization using Variational Quantum Circuits
The optimization of queries speeds up query processing in databases. One of the most time-consuming tasks in query processing is the join operation, where the order of the joins plays a crucial role in determining the number of tuples to be processed for intermediate results, and hence, the overall processing costs. In this paper, we use a variational quantum circuit (VQC) to create a hybrid classical-quantum machine learning algorithm to predict efficient join orders by learning from past join orders. We develop an encoding of the join order problem using a low number of qubits. We show that VQCs with filtering of cross joins outperform the classical dynamic programming optimizer of PostgreSQL with a 2.7% faster execution time.
- Open Access
- 4 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 309-310
Third International Workshop on Big Data in Emergent Distributed Environments (BiDEDE)
The Third International Workshop on Big Data in Emergent Distributed Environments (BiDEDE) is centered around addressing scalable data management issues in emerging computing environments such as (post) cloud and fog/edge/dew computing. These environments aim to incorporate efficient data management and processing into distributed systems to minimize communication and computational costs, while simultaneously enhancing application throughput, reducing latencies, and prolonging battery life for nodes. Despite over a decade of research in this area, there are still numerous challenges that remain unsolved due to technological advancements such as lightweight virtualization, greater node capabilities, and increased parallelization. This year we also welcome contributions on data management for or solved by quantum computing. The workshop provides a platform for active discussions in these and related topics.
- 4 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 309-310
Open AccessThird International Workshop on Big Data in Emergent Distributed Environments (BiDEDE)
The Third International Workshop on Big Data in Emergent Distributed Environments (BiDEDE) is centered around addressing scalable data management issues in emerging computing environments such as (post) cloud and fog/edge/dew computing. These environments aim to incorporate efficient data management and processing into distributed systems to minimize communication and computational costs, while simultaneously enhancing application throughput, reducing latencies, and prolonging battery life for nodes. Despite over a decade of research in this area, there are still numerous challenges that remain unsolved due to technological advancements such as lightweight virtualization, greater node capabilities, and increased parallelization. This year we also welcome contributions on data management for or solved by quantum computing. The workshop provides a platform for active discussions in these and related topics.