13 search results - page 3 / 3 » A correct proof of the heuristic GCD algorithm |
SIGMOD
1995
ACM
13 years 9 months ago
1995
ACM
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
KR
1994
Springer
13 years 9 months ago
1994
Springer
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
IS
2010
13 years 3 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...