A cost-based range estimation for mapping top-k selection queries over relational databases

Anteneh Ayanso, Paulo B Goes, Kumar Mehta

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods.

Original languageEnglish (US)
Pages (from-to)1-25
Number of pages25
JournalJournal of Database Management
Volume20
Issue number4
DOIs
StatePublished - Oct 2009

Fingerprint

Relational database systems
Costs
Data structures
Engines
Experiments

Keywords

  • Cost model
  • Query processing
  • Query-mapping
  • Relational databases
  • Top-k query
  • Tradeoff analysis
  • Uncertainty modeling

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture
  • Software

Cite this

A cost-based range estimation for mapping top-k selection queries over relational databases. / Ayanso, Anteneh; Goes, Paulo B; Mehta, Kumar.

In: Journal of Database Management, Vol. 20, No. 4, 10.2009, p. 1-25.

Research output: Contribution to journalArticle

@article{c70b4612fdaf48ceab9ed481c3c284ea,
title = "A cost-based range estimation for mapping top-k selection queries over relational databases",
abstract = "Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods.",
keywords = "Cost model, Query processing, Query-mapping, Relational databases, Top-k query, Tradeoff analysis, Uncertainty modeling",
author = "Anteneh Ayanso and Goes, {Paulo B} and Kumar Mehta",
year = "2009",
month = "10",
doi = "10.4018/jdm.2009062501",
language = "English (US)",
volume = "20",
pages = "1--25",
journal = "Journal of Database Management",
issn = "1063-8016",
publisher = "IGI Publishing",
number = "4",

}

TY - JOUR

T1 - A cost-based range estimation for mapping top-k selection queries over relational databases

AU - Ayanso, Anteneh

AU - Goes, Paulo B

AU - Mehta, Kumar

PY - 2009/10

Y1 - 2009/10

N2 - Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods.

AB - Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods.

KW - Cost model

KW - Query processing

KW - Query-mapping

KW - Relational databases

KW - Top-k query

KW - Tradeoff analysis

KW - Uncertainty modeling

UR - http://www.scopus.com/inward/record.url?scp=70350006824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350006824&partnerID=8YFLogxK

U2 - 10.4018/jdm.2009062501

DO - 10.4018/jdm.2009062501

M3 - Article

VL - 20

SP - 1

EP - 25

JO - Journal of Database Management

JF - Journal of Database Management

SN - 1063-8016

IS - 4

ER -