2850 search results - page 23 / 570 » Answering Queries using Humans, Algorithms and Databases |
ICDT
2005
ACM
14 years 1 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...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...