8413 search results - page 1549 / 1683 » Ordering Problem Subgoals |
140
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
141
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
142
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
122
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
129
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...