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
2169
Venue
SIGMOD
Year
1979
Pagerank
0.00046918506
Overall Rank
40 | 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,203 On The Recognition Of Coverings Of Acyclic Database Hypergraphs 1983 PODS 5.6746696e-05
8,297 Independence-reducible Database Schemes 1988 PODS 5.4574671e-05
8,298 A Characterization of Constant-time-maintainability for BCNF Database Schemes 1988 SIGMOD 5.4574671e-05
8,301 The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) 1986 PODS 5.4574671e-05
8,479 Optimizing Query Answering under Ontological Constraints 2011 VLDB 5.4170047e-05
8,970 Understanding Queries by Conditional Instances 2022 SIGMOD 5.3422757e-05
8,977 Designing Globally Consistent Network Schemas 1983 SIGMOD 5.3406923e-05
9,195 Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study 2023 VLDB 5.3058708e-05
9,259 Querying Weak Instances 1984 PODS 5.2970277e-05
9,260 The Revenge Of The Jd 1983 PODS 5.2970277e-05
9,291 Efficiently Enumerating Answers to Ontology-Mediated Queries 2022 PODS 5.2910144e-05
9,422 Leveraging Query Logs for Schema Mapping Generation in U-MAP 2011 SIGMOD 5.2723842e-05
9,483 Local Transformations and Conjunctive-Query Equivalence 2012 PODS 5.2634238e-05
9,522 Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning 2022 VLDB 5.2557598e-05
9,726 Data Integration and Data Exchange: It’s Really About Time 2013 CIDR 5.2302483e-05
9,850 Materializing Knowledge Bases via Trigger Graphs 2021 VLDB 5.2094004e-05
9,863 The Space-Efficient Core of Vadalog 2019 PODS 5.2045536e-05
9,865 Containment of Conjunctive Object Meta-Queries 2006 VLDB 5.2045536e-05
9,933 Semantic Acyclicity Under Constraints 2016 PODS 5.1955087e-05
9,959 Datalog with First-Class Facts 2025 VLDB 5.1879626e-05
10,143 Raqlet: Cross-Paradigm Compilation for Recursive Queries 2026 CIDR 5.093636e-05
10,644 No Cliques Allowed: The Next Step Towards BDD/FC Conjecture 2025 PODS 5.093636e-05
11,129 Chase Termination Beyond Polynomial Time 2024 PODS 5.093636e-05
11,336 The Vadalog Parallel System: Distributed Reasoning with Datalog+/- 2024 VLDB 5.093636e-05
11,630 Model-theoretic Characterizations of Rule-based Ontologies 2021 PODS 5.093636e-05
11,753 The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs 2020 PODS 5.093636e-05
11,893 Containment for Rule-Based Ontology-Mediated Queries 2018 PODS 5.093636e-05
11,901 How Can Reasoners Simplify Database Querying (And Why Haven’t They Done It Yet)? 2018 PODS 5.093636e-05
12,992 Applying an update method to a set of receivers (extended abstract) 1995 PODS 5.093636e-05
13,120 Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation 1990 SIGMOD 5.093636e-05
13,121 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 5.093636e-05
13,132 Updating Databases in the Weak Instance Model 1989 PODS 5.093636e-05
13,171 On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies 1987 PODS 5.093636e-05
13,173 A New Basis for the Weak Instance Model 1987 PODS 5.093636e-05
13,193 On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) 1986 PODS 5.093636e-05
13,194 ON FINITE FD-ACYCLICITY (Extended Abstract) 1986 PODS 5.093636e-05
13,208 Relaxing the Universal Relation Scheme Assumption 1985 PODS 5.093636e-05
13,230 On the Decomposition of Join Dependencies 1984 PODS 5.093636e-05
13,248 Inverting Relational Expressions - A Uniform And Natural Technique For Various Database Problems 1983 PODS 5.093636e-05
13,249 Path Expressions in Databases (Extended Abstract) 1983 PODS 5.093636e-05
13,250 Algebraic Aspects of Relational Database Decomposition (Extended Abstract) 1983 PODS 5.093636e-05
13,259 A Theory Of Data Dependencies Over Relational Expressions 1982 PODS 5.093636e-05
13,261 A Technique For Translating States Between Database Schemata 1982 SIGMOD 5.093636e-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

# Overall Rank Paper Year Venue
1 6,740 Stratification Criteria and Rewriting Techniques for Checking Chase Termination 2011 VLDB
2 525 The Chase Revisited 2008 PODS
3 3,247 On Chase Termination Beyond Stratification 2009 VLDB
4 7,930 Optimizing the Chase: Scalable Data Integration under Constraints 2014 VLDB
5 2,634 Benchmarking the Chase 2017 PODS
6 2,617 Chasing Constrained Tuple-Generating Dependencies 1996 PODS
7 7,045 Exploiting Equality Generating Dependencies in Checking Chase Termination 2016 VLDB
8 13,259 A Theory Of Data Dependencies Over Relational Expressions 1982 PODS
9 4,115 Incomplete Information and Dependencies in Relational Databases 1983 SIGMOD
10 3,750 Dependency Satisfaction in Databases with Incomplete Information 1984 VLDB