1039 search results - page 94 / 208 » Query reformulation with constraints |
143
click to vote
CL
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
190
click to vote
ECIR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
198
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
161
Voted
ADBIS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
236
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...