Search Results for author: Olga Papaemmanouil

Found 5 papers, 1 papers with code

Multi-agent Databases via Independent Learning

no code implementations28 May 2022 Chi Zhang, Olga Papaemmanouil, Josiah P. Hanna, Aditya Akella

Thus, the paper attempts to address the question "Is it possible to design a database consisting of various learned components that cooperatively work to improve end-to-end query latency?".

Multi-agent Reinforcement Learning Scheduling

Buffer Pool Aware Query Scheduling via Deep Reinforcement Learning

no code implementations21 Jul 2020 Chi Zhang, Ryan Marcus, Anat Kleiman, Olga Papaemmanouil

In this extended abstract, we propose a new technique for query scheduling with the explicit goal of reducing disk reads and thus implicitly increasing query performance.

reinforcement-learning Reinforcement Learning (RL) +1

Flexible Operator Embeddings via Deep Learning

no code implementations25 Jan 2019 Ryan Marcus, Olga Papaemmanouil

Integrating machine learning into the internals of database management systems requires significant feature engineering, a human effort-intensive process to determine the best way to represent the pieces of information that are relevant to a task.

Feature Engineering Management

Deep Reinforcement Learning for Join Order Enumeration

no code implementations28 Feb 2018 Ryan Marcus, Olga Papaemmanouil

However, modern query optimizers typically employ static join enumeration algorithms that do not receive any feedback about the quality of the resulting plan.

Decision Making reinforcement-learning +1

WiSeDB: A Learning-based Workload Management Advisor for Cloud Databases

1 code implementation29 Jan 2016 Ryan Marcus, Olga Papaemmanouil

Workload management for cloud databases must deal with the tasks of resource provisioning, query placement and query scheduling in a manner that meets the application's performance goals while minimizing the cost of using cloud resources.

Databases

Cannot find the paper you are looking for? You can Submit a new open access paper.