1039 search results - page 90 / 208 » Query reformulation with constraints |
226
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
135
click to vote
KI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
173
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
187
click to vote
COCOS
2003
Springer
15 years 10 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
159
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...