777 search results - page 53 / 156 » Optimization of Relational Preference Queries |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
A lot of recent research on content-based P2P searching for file-sharing applications has focused on exploiting semantic relations between peers to facilitate searching. To the be...
SIGECOM
2003
ACM
14 years 2 months ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
ECAI
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...