Title: On the Complexity of Testing Implications of Functional and Join Dependencies
Abstract: article Free AccessOn the Complexity of Testing Implications of Functional and Join Dependencies Authors: David Maier Department of Computer Science, SUNY at Stony Brook, Stony Brook, New York Department of Computer Science, SUNY at Stony Brook, Stony Brook, New YorkView Profile , Yehoshua Sagiv Institute of Mathematics and Computer Science, The Hebrew University of Jeruselam, Givat Ram 91904, Jerusalem, Israel and University of Illinois at Urbana-Champaign, Urbana, Illinois Institute of Mathematics and Computer Science, The Hebrew University of Jeruselam, Givat Ram 91904, Jerusalem, Israel and University of Illinois at Urbana-Champaign, Urbana, IllinoisView Profile , Mihalis Yannakakis Bell Laboratories, Murray Hill, New Jersey Bell Laboratories, Murray Hill, New JerseyView Profile Authors Info & Claims Journal of the ACMVolume 28Issue 4Oct. 1981 pp 680–695https://doi.org/10.1145/322276.322280Published:01 October 1981Publication History 70citation532DownloadsMetricsTotal Citations70Total Downloads532Last 12 Months18Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF