DBScholar

Back to papers

Testing Implications Of Data Dependencies

Summary: Proposes a chase-based method to test implication of data dependencies. Interprets tableaux as mappings or templates to handle functional and join dependencies, unifying prior tableau methods; enables checking schema equivalence and component independence, ensuring relational schemas capture intended information. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
he061f19d0ace62dd
Venue
SIGMOD
Year
1979
Pagerank
0.00045733094
Overall Rank
41 | 99.73%
DOI
10.1145/582095.582119

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{maier_sigmod79,
        title = {{TESTING IMPLICATIONS OF DATA DEPENDENCIES}},
        author = {Maier, David and Mendelzon, Alberto and Sagiv, Yehoshua},
        series = {{SIGMOD} '79},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582095.582119},
        url = {https://dl.acm.org/doi/10.1145/582095.582119},
        year = {1979}
}

Incoming Citations (Sorted by Pagerank)

Showing 43 of 93 citing papers.

Rank Citing Paper Year Venue Pagerank
7,367 On The Recognition Of Coverings Of Acyclic Database Hypergraphs 1983 PODS 5.5263855e-05
8,489 Independence-reducible Database Schemes 1988 PODS 5.3148581e-05
8,490 A Characterization of Constant-time-maintainability for BCNF Database Schemes 1988 SIGMOD 5.3148581e-05
8,493 The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) 1986 PODS 5.3148581e-05
8,671 Optimizing Query Answering under Ontological Constraints 2011 VLDB 5.275453e-05
9,090 Understanding Queries by Conditional Instances 2022 SIGMOD 5.2092307e-05
9,172 Designing Globally Consistent Network Schemas 1983 SIGMOD 5.2011983e-05
9,410 Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study 2023 VLDB 5.1672232e-05
9,470 Querying Weak Instances 1984 PODS 5.1586111e-05
9,471 The Revenge Of The Jd 1983 PODS 5.1586111e-05
9,505 Efficiently Enumerating Answers to Ontology-Mediated Queries 2022 PODS 5.152755e-05
9,581 Leveraging Query Logs for Schema Mapping Generation in U-MAP 2011 SIGMOD 5.1413294e-05
9,700 Local Transformations and Conjunctive-Query Equivalence 2012 PODS 5.1258854e-05
9,741 Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning 2022 VLDB 5.1184216e-05
9,833 Raqlet: Cross-Paradigm Compilation for Recursive Queries 2026 CIDR 5.1064323e-05
9,936 Data Integration and Data Exchange: It’s Really About Time 2013 CIDR 5.0936191e-05
10,078 Materializing Knowledge Bases via Trigger Graphs 2021 VLDB 5.0732737e-05
10,089 The Space-Efficient Core of Vadalog 2019 PODS 5.068571e-05
10,091 Containment of Conjunctive Object Meta-Queries 2006 VLDB 5.068571e-05
10,156 Semantic Acyclicity Under Constraints 2016 PODS 5.0597449e-05
10,188 Datalog with First-Class Facts 2025 VLDB 5.052396e-05
11,157 No Cliques Allowed: The Next Step Towards BDD/FC Conjecture 2025 PODS 4.9605343e-05
11,535 Chase Termination Beyond Polynomial Time 2024 PODS 4.9605343e-05
11,707 The Vadalog Parallel System: Distributed Reasoning with Datalog+/- 2024 VLDB 4.9605343e-05
11,987 Model-theoretic Characterizations of Rule-based Ontologies 2021 PODS 4.9605343e-05
12,106 The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs 2020 PODS 4.9605343e-05
12,242 Containment for Rule-Based Ontology-Mediated Queries 2018 PODS 4.9605343e-05
12,250 How Can Reasoners Simplify Database Querying (And Why Haven’t They Done It Yet)? 2018 PODS 4.9605343e-05
13,329 Applying an update method to a set of receivers (extended abstract) 1995 PODS 4.9605343e-05
13,457 Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation 1990 SIGMOD 4.9605343e-05
13,458 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 4.9605343e-05
13,469 Updating Databases in the Weak Instance Model 1989 PODS 4.9605343e-05
13,508 On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies 1987 PODS 4.9605343e-05
13,510 A New Basis for the Weak Instance Model 1987 PODS 4.9605343e-05
13,530 On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) 1986 PODS 4.9605343e-05
13,531 ON FINITE FD-ACYCLICITY (Extended Abstract) 1986 PODS 4.9605343e-05
13,545 Relaxing the Universal Relation Scheme Assumption 1985 PODS 4.9605343e-05
13,567 On the Decomposition of Join Dependencies 1984 PODS 4.9605343e-05
13,585 Inverting Relational Expressions - A Uniform And Natural Technique For Various Database Problems 1983 PODS 4.9605343e-05
13,586 Path Expressions in Databases (Extended Abstract) 1983 PODS 4.9605343e-05
13,587 Algebraic Aspects of Relational Database Decomposition (Extended Abstract) 1983 PODS 4.9605343e-05
13,596 A Theory Of Data Dependencies Over Relational Expressions 1982 PODS 4.9605343e-05
13,598 A Technique For Translating States Between Database Schemata 1982 SIGMOD 4.9605343e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers