Preference query evaluation over expensive attributes

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

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

17 Citations (Scopus)

Abstract

Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them expensive to compute relative to relational data stored in a heap or index. In addition, core support for efficient preference query processing has become an important objective in database systems. This paper addresses an important problem at the intersection of these two query processing objectives: efficient preference query evaluation involving expensive attributes. We explore an efficient framework for processing skyline and multi-objective queries in a database when the data involves a mix of "cheap" and "expensive" attributes. Our solution involves a three-phase approach that evaluates a correct final preference answer while aiming to minimizing the number of expensive attributes computations. Unlike previous works for distributed preference algorithms that assume sorted access over each attribute, our framework assumes expensive attribute requests are stateless, i.e., know nothing previous requests. Thus, the proposed approach is more in line with realistic system architectures. Our framework is implemented inside the query processor of PostgreSQL, and evaluated over both synthetic and real data sets involving computation of expensive attributes over real web-service data (e.g., Microsoft MapPoint).

Original languageEnglish
Title of host publicationCIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops
Pages319-328
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2010
Externally publishedYes
Event19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 - Toronto, ON, Canada
Duration: 26 Oct 201030 Oct 2010

Other

Other19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
CountryCanada
CityToronto, ON
Period26/10/1030/10/10

Fingerprint

Evaluation
Query
Data base
Query processing
Web services
System architecture
Microsoft

Keywords

  • Algorithms
  • Design
  • Performance

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Business, Management and Accounting(all)

Cite this

Levandoski, J. J., Mokbel, M., & Khalefa, M. E. (2010). Preference query evaluation over expensive attributes. In CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops (pp. 319-328) https://doi.org/10.1145/1871437.1871481

Preference query evaluation over expensive attributes. / Levandoski, Justin J.; Mokbel, Mohamed; Khalefa, Mohamed E.

CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. 2010. p. 319-328.

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

Levandoski, JJ, Mokbel, M & Khalefa, ME 2010, Preference query evaluation over expensive attributes. in CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. pp. 319-328, 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10, Toronto, ON, Canada, 26/10/10. https://doi.org/10.1145/1871437.1871481
Levandoski JJ, Mokbel M, Khalefa ME. Preference query evaluation over expensive attributes. In CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. 2010. p. 319-328 https://doi.org/10.1145/1871437.1871481
Levandoski, Justin J. ; Mokbel, Mohamed ; Khalefa, Mohamed E. / Preference query evaluation over expensive attributes. CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. 2010. pp. 319-328
@inproceedings{ea20ad47f3824986816f01b4687650d6,
title = "Preference query evaluation over expensive attributes",
abstract = "Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them expensive to compute relative to relational data stored in a heap or index. In addition, core support for efficient preference query processing has become an important objective in database systems. This paper addresses an important problem at the intersection of these two query processing objectives: efficient preference query evaluation involving expensive attributes. We explore an efficient framework for processing skyline and multi-objective queries in a database when the data involves a mix of {"}cheap{"} and {"}expensive{"} attributes. Our solution involves a three-phase approach that evaluates a correct final preference answer while aiming to minimizing the number of expensive attributes computations. Unlike previous works for distributed preference algorithms that assume sorted access over each attribute, our framework assumes expensive attribute requests are stateless, i.e., know nothing previous requests. Thus, the proposed approach is more in line with realistic system architectures. Our framework is implemented inside the query processor of PostgreSQL, and evaluated over both synthetic and real data sets involving computation of expensive attributes over real web-service data (e.g., Microsoft MapPoint).",
keywords = "Algorithms, Design, Performance",
author = "Levandoski, {Justin J.} and Mohamed Mokbel and Khalefa, {Mohamed E.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1145/1871437.1871481",
language = "English",
isbn = "9781450300995",
pages = "319--328",
booktitle = "CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops",

}

TY - GEN

T1 - Preference query evaluation over expensive attributes

AU - Levandoski, Justin J.

AU - Mokbel, Mohamed

AU - Khalefa, Mohamed E.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them expensive to compute relative to relational data stored in a heap or index. In addition, core support for efficient preference query processing has become an important objective in database systems. This paper addresses an important problem at the intersection of these two query processing objectives: efficient preference query evaluation involving expensive attributes. We explore an efficient framework for processing skyline and multi-objective queries in a database when the data involves a mix of "cheap" and "expensive" attributes. Our solution involves a three-phase approach that evaluates a correct final preference answer while aiming to minimizing the number of expensive attributes computations. Unlike previous works for distributed preference algorithms that assume sorted access over each attribute, our framework assumes expensive attribute requests are stateless, i.e., know nothing previous requests. Thus, the proposed approach is more in line with realistic system architectures. Our framework is implemented inside the query processor of PostgreSQL, and evaluated over both synthetic and real data sets involving computation of expensive attributes over real web-service data (e.g., Microsoft MapPoint).

AB - Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them expensive to compute relative to relational data stored in a heap or index. In addition, core support for efficient preference query processing has become an important objective in database systems. This paper addresses an important problem at the intersection of these two query processing objectives: efficient preference query evaluation involving expensive attributes. We explore an efficient framework for processing skyline and multi-objective queries in a database when the data involves a mix of "cheap" and "expensive" attributes. Our solution involves a three-phase approach that evaluates a correct final preference answer while aiming to minimizing the number of expensive attributes computations. Unlike previous works for distributed preference algorithms that assume sorted access over each attribute, our framework assumes expensive attribute requests are stateless, i.e., know nothing previous requests. Thus, the proposed approach is more in line with realistic system architectures. Our framework is implemented inside the query processor of PostgreSQL, and evaluated over both synthetic and real data sets involving computation of expensive attributes over real web-service data (e.g., Microsoft MapPoint).

KW - Algorithms

KW - Design

KW - Performance

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

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

U2 - 10.1145/1871437.1871481

DO - 10.1145/1871437.1871481

M3 - Conference contribution

AN - SCOPUS:78651315372

SN - 9781450300995

SP - 319

EP - 328

BT - CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops

ER -