2514 search results - page 85 / 503 » On the Computation of Approximations of Database Queries |
224
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
164
click to vote
ICDT
2005
ACM
15 years 12 months ago
2005
ACM
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
259
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
278
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
166
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...