PrefJoin: An efficient preference-aware join operator

Mohamed E. Khalefa, Mohamed Mokbel, Justin J. Levandoski

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

16 Citations (Scopus)

Abstract

Preference queries are essential to a wide spectrum of applications including multi-criteria decision-making tools and personalized databases. Unfortunately, most of the evaluation techniques for preference queries assume that the set of preferred attributes are stored in only one relation, waiving on a wide set of queries that include preference computations over multiple relations. This paper presents PrefJoin, an efficient preference-aware join query operator, designed specifically to deal with preference queries over multiple relations. PrefJoin consists of four main phases: Local Pruning, Data Preparation, Joining, and Refining that filter out, from each input relation, those tuples that are guaranteed not to be in the final preference set, associate meta data with each non-filtered tuple that will be used to optimize the execution of the next phases, produce a subset of join result that are relevant for the given preference function, and refine these tuples respectively. An interesting characteristic of PrefJoin is that it tightly integrates preference computation with join hence we can early prune those tuples that are guaranteed not to be an answer, and hence it saves significant unnecessary computations cost. PrefJoin supports a variety of preference function including skyline, multi-objective and k-dominance preference queries. We show the correctness of PrefJoin. Experimental evaluation based on a real system implementation inside PostgreSQL shows that PrefJoin consistently achieves from one to three orders of magnitude performance gain over its competitors in various scenarios.

Original languageEnglish
Title of host publication2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
Pages995-1006
Number of pages12
DOIs
Publication statusPublished - 6 Jun 2011
Externally publishedYes
Event2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 - Hannover, Germany
Duration: 11 Apr 201116 Apr 2011

Other

Other2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
CountryGermany
CityHannover
Period11/4/1116/4/11

Fingerprint

Metadata
Joining
Refining
Decision making
Costs

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Khalefa, M. E., Mokbel, M., & Levandoski, J. J. (2011). PrefJoin: An efficient preference-aware join operator. In 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 (pp. 995-1006). [5767894] https://doi.org/10.1109/ICDE.2011.5767894

PrefJoin : An efficient preference-aware join operator. / Khalefa, Mohamed E.; Mokbel, Mohamed; Levandoski, Justin J.

2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. p. 995-1006 5767894.

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

Khalefa, ME, Mokbel, M & Levandoski, JJ 2011, PrefJoin: An efficient preference-aware join operator. in 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011., 5767894, pp. 995-1006, 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011, Hannover, Germany, 11/4/11. https://doi.org/10.1109/ICDE.2011.5767894
Khalefa ME, Mokbel M, Levandoski JJ. PrefJoin: An efficient preference-aware join operator. In 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. p. 995-1006. 5767894 https://doi.org/10.1109/ICDE.2011.5767894
Khalefa, Mohamed E. ; Mokbel, Mohamed ; Levandoski, Justin J. / PrefJoin : An efficient preference-aware join operator. 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. pp. 995-1006
@inproceedings{8922b738cc714858bce94e52a725ecc3,
title = "PrefJoin: An efficient preference-aware join operator",
abstract = "Preference queries are essential to a wide spectrum of applications including multi-criteria decision-making tools and personalized databases. Unfortunately, most of the evaluation techniques for preference queries assume that the set of preferred attributes are stored in only one relation, waiving on a wide set of queries that include preference computations over multiple relations. This paper presents PrefJoin, an efficient preference-aware join query operator, designed specifically to deal with preference queries over multiple relations. PrefJoin consists of four main phases: Local Pruning, Data Preparation, Joining, and Refining that filter out, from each input relation, those tuples that are guaranteed not to be in the final preference set, associate meta data with each non-filtered tuple that will be used to optimize the execution of the next phases, produce a subset of join result that are relevant for the given preference function, and refine these tuples respectively. An interesting characteristic of PrefJoin is that it tightly integrates preference computation with join hence we can early prune those tuples that are guaranteed not to be an answer, and hence it saves significant unnecessary computations cost. PrefJoin supports a variety of preference function including skyline, multi-objective and k-dominance preference queries. We show the correctness of PrefJoin. Experimental evaluation based on a real system implementation inside PostgreSQL shows that PrefJoin consistently achieves from one to three orders of magnitude performance gain over its competitors in various scenarios.",
author = "Khalefa, {Mohamed E.} and Mohamed Mokbel and Levandoski, {Justin J.}",
year = "2011",
month = "6",
day = "6",
doi = "10.1109/ICDE.2011.5767894",
language = "English",
isbn = "9781424489589",
pages = "995--1006",
booktitle = "2011 IEEE 27th International Conference on Data Engineering, ICDE 2011",

}

TY - GEN

T1 - PrefJoin

T2 - An efficient preference-aware join operator

AU - Khalefa, Mohamed E.

AU - Mokbel, Mohamed

AU - Levandoski, Justin J.

PY - 2011/6/6

Y1 - 2011/6/6

N2 - Preference queries are essential to a wide spectrum of applications including multi-criteria decision-making tools and personalized databases. Unfortunately, most of the evaluation techniques for preference queries assume that the set of preferred attributes are stored in only one relation, waiving on a wide set of queries that include preference computations over multiple relations. This paper presents PrefJoin, an efficient preference-aware join query operator, designed specifically to deal with preference queries over multiple relations. PrefJoin consists of four main phases: Local Pruning, Data Preparation, Joining, and Refining that filter out, from each input relation, those tuples that are guaranteed not to be in the final preference set, associate meta data with each non-filtered tuple that will be used to optimize the execution of the next phases, produce a subset of join result that are relevant for the given preference function, and refine these tuples respectively. An interesting characteristic of PrefJoin is that it tightly integrates preference computation with join hence we can early prune those tuples that are guaranteed not to be an answer, and hence it saves significant unnecessary computations cost. PrefJoin supports a variety of preference function including skyline, multi-objective and k-dominance preference queries. We show the correctness of PrefJoin. Experimental evaluation based on a real system implementation inside PostgreSQL shows that PrefJoin consistently achieves from one to three orders of magnitude performance gain over its competitors in various scenarios.

AB - Preference queries are essential to a wide spectrum of applications including multi-criteria decision-making tools and personalized databases. Unfortunately, most of the evaluation techniques for preference queries assume that the set of preferred attributes are stored in only one relation, waiving on a wide set of queries that include preference computations over multiple relations. This paper presents PrefJoin, an efficient preference-aware join query operator, designed specifically to deal with preference queries over multiple relations. PrefJoin consists of four main phases: Local Pruning, Data Preparation, Joining, and Refining that filter out, from each input relation, those tuples that are guaranteed not to be in the final preference set, associate meta data with each non-filtered tuple that will be used to optimize the execution of the next phases, produce a subset of join result that are relevant for the given preference function, and refine these tuples respectively. An interesting characteristic of PrefJoin is that it tightly integrates preference computation with join hence we can early prune those tuples that are guaranteed not to be an answer, and hence it saves significant unnecessary computations cost. PrefJoin supports a variety of preference function including skyline, multi-objective and k-dominance preference queries. We show the correctness of PrefJoin. Experimental evaluation based on a real system implementation inside PostgreSQL shows that PrefJoin consistently achieves from one to three orders of magnitude performance gain over its competitors in various scenarios.

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

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

U2 - 10.1109/ICDE.2011.5767894

DO - 10.1109/ICDE.2011.5767894

M3 - Conference contribution

AN - SCOPUS:79957877042

SN - 9781424489589

SP - 995

EP - 1006

BT - 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011

ER -