Paper Info
Title
PAQO: Preference-aware query optimization for decentralized database systems
Abstract
The declarative nature of SQL has traditionally been a major strength. Users simply state what information they are interested in, and the database management system determines the best plan for retrieving it. A consequence of this model is that should a user ever want to specify some aspect of how their queries are evaluated (e.g., a preference to read data from a specific replica, or a requirement for all joins to be performed by a single server), they are unable to. This can leave database administrators shoehorning evaluation preferences into database cost models. Further, for distributed database users, it can result in query evaluation plans that violate data handling best practices or the privacy of the user. To address such issues, we have developed a framework for declarative, user-specified constraints on the query optimization process and implemented it within PosgreSQL. Our Preference-Aware Query Optimizer (PAQO) upholds both strict requirements and partially ordered preferences that are issued alongside of the queries that it processes. In this paper, we present the design of PAQO and thoroughly evaluate its performance.
Year
DOI
Venue
2014
10.1109/ICDE.2014.6816670
Data Engineering
Keywords
Field
DocType
SQL,query processing,relational databases,PAQO optimization,PosgreSQL,Structured Query Languages,data handling best practices,database cost models,database management system,decentralized database systems,preference-aware query optimization,query evaluation,query optimization process,user privacy,user-specified constraints
Query optimization,Data mining,Query language,Database tuning,Computer science,View,Database design,Query by Example,Online aggregation,Materialized view,Database
Conference
ISSN
Citations 
PageRank 
1084-4627
5
0.56
References 
Authors
15
4
Name
Order
Citations
PageRank
Nicholas L. Farnan1193.22
Adam J. Lee2214.70
Panos K. Chrysanthis31755343.06
Ting Yu42093150.43