Supporting top-k join queries in relational databases

Ihab F. Ilyas, Walid G. Aref, Ahmed Elmagarmid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

118 Citations (Scopus)

Abstract

Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.

Original languageEnglish
Title of host publicationProceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
PublisherMorgan Kaufmann
Pages754-765
Number of pages12
ISBN (Electronic)0127224424, 9780127224428
Publication statusPublished - 1 Jan 2003
Externally publishedYes
Event29th International Conference on Very Large Data Bases, VLDB 2003 - Berlin, Germany
Duration: 9 Sep 200312 Sep 2003

Other

Other29th International Conference on Very Large Data Bases, VLDB 2003
CountryGermany
CityBerlin
Period9/9/0312/9/03

Fingerprint

Mathematical operators
Joining
Engines
Relational database
Join
Query
Top-k
Operator

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Information Systems and Management
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Ilyas, I. F., Aref, W. G., & Elmagarmid, A. (2003). Supporting top-k join queries in relational databases. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003 (pp. 754-765). Morgan Kaufmann.

Supporting top-k join queries in relational databases. / Ilyas, Ihab F.; Aref, Walid G.; Elmagarmid, Ahmed.

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. p. 754-765.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ilyas, IF, Aref, WG & Elmagarmid, A 2003, Supporting top-k join queries in relational databases. in Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, pp. 754-765, 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, 9/9/03.
Ilyas IF, Aref WG, Elmagarmid A. Supporting top-k join queries in relational databases. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann. 2003. p. 754-765
Ilyas, Ihab F. ; Aref, Walid G. ; Elmagarmid, Ahmed. / Supporting top-k join queries in relational databases. Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. pp. 754-765
@inproceedings{6b34435ec5b54b768add9aa5ed14816d,
title = "Supporting top-k join queries in relational databases",
abstract = "Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.",
author = "Ilyas, {Ihab F.} and Aref, {Walid G.} and Ahmed Elmagarmid",
year = "2003",
month = "1",
day = "1",
language = "English",
pages = "754--765",
booktitle = "Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003",
publisher = "Morgan Kaufmann",

}

TY - GEN

T1 - Supporting top-k join queries in relational databases

AU - Ilyas, Ihab F.

AU - Aref, Walid G.

AU - Elmagarmid, Ahmed

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.

AB - Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.

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

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

M3 - Conference contribution

AN - SCOPUS:85012120419

SP - 754

EP - 765

BT - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

PB - Morgan Kaufmann

ER -