Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Optimizing disjunctive queries with expensive predicates
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An adaptive query execution system for data integration
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Personalization of Queries in Database Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Progressive skylining over web-accessible databases
Data & Knowledge Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
SaLSa: computing the skyline without scanning the whole sky
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic skyline queries in metric spaces
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficient evaluation of k-NN queries using spatial mashups
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks
Distributed and Parallel Databases
A group based approach for path queries in road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Parallel computation of skyline and reverse skyline queries using mapreduce
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
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).