On the Complexity of Testing Implications of Functional and Join Dependencies-Reference-Cited by-同舟云学术

On the Complexity of Testing Implications of Functional and Join Dependencies

Published:1981-10 Issue:4 Volume:28 Page:680-695
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Maier David¹,Sagiv Yehoshua²,Yannakakis Mihalis³

Affiliation:

1. Department of Computer Science, SUNY at Stony Brook, Stony Brook, New York

2. 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

3. Bell Laboratories, Murray Hill, New Jersey

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference21 articles.

1. The theory of joins in relational databases

2. On the menbership problem for functional and multivalued dependencies in relational databases

3. Computational problems related to the design of normal form relational schemas

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. StarfishDB: A Query Execution Engine for Relational Probabilistic Programming;Proceedings of the ACM on Management of Data;2024-05-29

2. Testing Dependencies and Inference Rules in Databases;Automatic Control and Computer Sciences;2023-12

3. Testing Dependencies and Inference Rules in Databases;Modeling and Analysis of Information Systems;2022-09-25

4. The Programming of Algebra;Electronic Proceedings in Theoretical Computer Science;2022-06-30

5. Answering Queries Using Views, Second Edition;Synthesis Lectures on Data Management;2019-04-15