Approximation schemes for many-objective query optimization

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Multi-Objective Parametric Query Optimization

Immanuel Trummer, Christoph Koch

Classical query optimization compares query plans according to one cost metric and associates each plan with a constant cost value. In this paper, we introduce the Multi-Objective Parametric Query Optimization (MPQ) problem where query plans are compared a ...

Assoc Computing Machinery2015

Runtime Prediction for Scale-Out Data Analytics

Adrian Daniel Popescu

Many analytics applications generate mixed workloads, i.e., workloads comprised of analytical tasks with different processing characteristics including data pre-processing, SQL, and iterative machine learning algorithms. Examples of such mixed workloads ca ...

EPFL2015

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Immanuel Trummer, Christoph Koch

Query plans offer diverse tradeoffs between conflicting cost metrics such as execution time, energy consumption, or execution fees in a multi-objective scenario. It is convenient for users to choose the desired cost tradeoff in an interactive process, dyna ...

2015

Adaptive Query Processing on Raw Data Files

Ioannis Alagiannis

Nowadays, business and scientific applications accumulate data at an increasing pace. This growth of information has already started to outgrow the capabilities of database management systems (DBMS). In a typical DBMS usage scenario, the user should define ...

EPFL2015

Approximation Schemes for Many-Objective Query Optimization

Immanuel Trummer, Christoph Koch

The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conflicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive ...

2014

Efficient Indexing and Query Processing of Model-View Sensor Data in the Cloud

Karl Aberer, Tian Guo

As the number of sensors that pervade our lives increases (e.g., environmental sensors, phone sensors, etc.), the eﬃcient management of massive amount of sensor data is becoming increasingly important. The inﬁnite nature of sensor data poses a serious chal ...

2014

Reactive and Proactive Sharing Across Concurrent Analytical Queries

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Iraklis Psaroudakis, Matthaios Alexandros Olma

Today an ever increasing amount of data is collected and analyzed by researchers, businesses, and scientists in data warehouses (DW). In addition to the data size, the number of users and applications querying data grows exponentially. The increasing concu ...

2014

Adaptive Query Processing on RAW Data

Anastasia Ailamaki, Ioannis Alagiannis, Miguel Sérgio De Oliveira Branco, Manolis Karpathiotakis

Database systems deliver impressive performance for large classes of workloads as the result of decades of research into optimizing database engines. High performance, however, is achieved at the cost of versatility. In particular, database systems only op ...

2014

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Sharing Data and Work Across Concurrent Analytical Queries

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Iraklis Psaroudakis

Today's data deluge enables organizations to collect massive data, and analyze it with an ever-increasing number of concurrent queries. Traditional data warehouses (DW) face a challenging problem in executing this task, due to their query-centric model: ea ...

2013

Constrained Binary Identification Problem

Amin Karbasi, Morteza Zadimoghaddam

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...

2013

Page 2 sur 2