2514 search results - page 36 / 503 » On the Computation of Approximations of Database Queries |
162
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
286
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
261
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
169
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
253
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...