3368 search results - page 257 / 674 » The Complexity of Query Reliability |
190
click to vote
SSDBM
2005
IEEE
16 years 5 days ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
172
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
159
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
171
click to vote
PVLDB
2008
15 years 6 months ago
2008
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
157
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...