• Home
  • Search
  • An Incremental Anytime Algorithm for Multi-Objective Query Optimization
  • Open Access IconOpen Access
  • Cite Icon28
  • https://doi.org/10.1145/2723372.2746484Copy DOI Icon

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

  • May 27, 2015
  • Immanuel Trummer +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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, dynamically adding constraints and finally selecting the best plan based on a continuously refined visualization of optimal cost tradeoffs. Multi-objective query optimization (MOQO) algorithms must possess specific properties to support such an interactive process: First, they must be anytime algorithms, generating multiple result plan sets of increasing quality with low latency between consecutive results. Second, they must be incremental, meaning that they avoid regenerating query plans when being invoked several times for the same query but with slightly different user constraints. We present an incremental anytime algorithm for MOQO, analyze its complexity and show that it offers an attractive tradeoff between result update frequency, single invocation time complexity, and amortized time over multiple invocations. Those properties make it suitable to be used within an interactive query optimization process. We evaluate the algorithm in comparison with prior work on TPC-H queries; our implementation is based on the Postgres database management system.

Similar Papers
  • Research Article
  • Citations42

Multi-objective parametric query optimization

  • Nov 01, 2014
  • Proceedings of the VLDB Endowment
  • Immanuel Trummer +1
  • Research Article
  • Citations40

Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins

  • May 29, 2021
  • ACM Transactions on Database Systems
  • Amine Mhedhbi +2
  • Book Chapter
  • Citations12

Cost- and Robustness-Based Query Optimization for Linked Data Fragments

  • Jan 01, 2020
  • Lars Heling +1
  • Research Article
  • Citations25

Multi-route query processing and optimization

  • Oct 18, 2012
  • Journal of Computer and System Sciences
  • Rimma V Nehme +4
  • Conference Article
  • Citations11

Query processing on prefix trees live

  • Jun 22, 2013
  • Thomas Kissinger +3
  • Book Chapter
  • Citations14

Distributed query optimization in loosely coupled multidatabase systems

  • Jan 01, 1995
  • Silvio Salza +2
  • Research Article
  • Citations6

Logical query optimization for Cloudera Impala system

  • Nov 24, 2016
  • Journal of Systems and Software
  • Jiaoyang Ma +6
  • Research Article
  • Citations108

YourSQL

  • Aug 01, 2016
  • Proceedings of the VLDB Endowment
  • Insoon Jo +6
  • Research Article
  • Citations38

Processing and optimizing main memory spatial-keyword queries

  • Nov 01, 2015
  • Proceedings of the VLDB Endowment
  • Taesung Lee +5
  • Research Article
  • Citations10

A Comparative Study and Component Analysis of Query Plan Representation Techniques in ML4DB Studies

  • Dec 01, 2023
  • Proceedings of the VLDB Endowment
  • Yue Zhao +2
  • Book Chapter
  • Citations4

Rule-based generation of logical query plans with controlled complexity

  • Jan 01, 1997
  • Karl Aberer +2
  • Research Article
  • Citations30

A green framework for DBMS based on energy-aware query optimization and energy-efficient query processing

  • Feb 27, 2017
  • Journal of Network and Computer Applications
  • Binglei Guo +4
  • Conference Article
  • Citations2

New cost metrics for iterative task assignment algorithms in heterogeneous computing systems

  • May 01, 2000
  • R.D Venkataramana +1
  • Conference Article

Using similarity distance for performance prediction of the query optimization process

  • Jun 24, 2013
  • Anisoara Nica +1
  • Book Chapter
  • Citations130

Chapter 18 - Generic Database Cost Models for Hierarchical Memory Systems

  • Jan 01, 2002
  • Proceedings 2002 VLDB Conference
  • Stefan Manegold +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.