Sciweavers

1168 search results - page 12 / 234
» Optimization strategies for complex queries
Sort
View
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 7 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
STACS
2010
Springer
14 years 2 months ago
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden h...
Nader H. Bshouty, Hanna Mazzawi