
692 Sagiv
algorithms can be found, then more heuristics should be developed for finding
tgds that may show redundancy.
Acknowledgments
The author thanks Jeff Finger, Georg Gottlob, Paris Kanellakis, Michael Kifer,
Dave Maier, Oded Shmueli, Jeff Ullman, and Allen Van Gelder for helpful
comments and discussions.
This work was done when the author visited Stanford University, Stanford,
California 94305-2085. It was supported by a grant from the AT&T Foun-
dation, a grant from the IBM Corporation, and National Science Foundation
grant 1ST-84-12791. At Hebrew University, this research was supported in
part by grant 85-00082 from the United States-Israe ...