Equivalences among Relational Expressions

Authors: A. V. Aho, Y. Sagiv, and J. D. UllmanAuthors Info & Affiliations

https://doi.org/10.1137/0208017

Tools

Abstract

Many database queries can be formulated in terms of expressions whose operands represent tables of information (relations) and whose operators are the relational operations select, project, and join. This paper studies the equivalence problem for these relational expressions, with expression optimization in mind. A matrix, called a tableau, is proposed as a natural representative for the value of an expression. It is shown how tableaux can be made to reflect functional dependencies among attributes. A polynomial time algorithm is presented for the equivalence of tableaux that correspond to an important subset of expressions, although the equivalence problem is shown to be NP-complete under slightly more general circumstances.

Get full access to this article

View all available purchase options and get full access to this article.

References

1.

A. V. Aho, C. Beeri, J. D. Ullman, The theory of joins in relational databases (extended abstract), 18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), IEEE Comput. Sci., Long Beach, Calif., 1977, 107–113

2.

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975x+470

3.

A. V. Aho, Ravi Sethi, J. D. Ullman, R. Rustin, Code optimization and finite Church-Rosser systemsDesign and optimization of compilers (Courant Comput. Sci. Sympos. 5, New York Univ., New York, 1971), Prentice-Hall, Englewood Cliffs, N. J., 1972, 89–105. Prentice-Hall Series in Automat. Comput

4.

W. W. Armstrong, Dependency structures of data base relationshipsInformation processing 74 (Proc. IFIP Congress, Stockholm, 1974), North-Holland, Amsterdam, 1974, 580–583

5.

P. A. Bernstein, Synthesizing third normal form relations from functional dependencies, ACM Trans. on Database Sys., 1 (1976), 277–298

6.

P. A. Bernstein, C. Beeri, An algorithmic approach to normalization of relational database schemes, TR, CSRG-73, Computer Science Research Group, University of Toronto, 1976, Sept.

7.

C. Beeri, R. Fagin, J. H. Howard, A complete axiomatization for functional and multivalued dependencies, Proc. ACM SIGMOD International Conference on the Management of Data, 1977, 47–61, August

8.

Ashok K. Chandra, Philip M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Conference Record of the Ninth Annual ACM Symposium on Theory of Computing (Boulder, Colo., 1977), Assoc. Comput. Mach., New York, 1977, 77–90

9.

E. F. Codd, A relational model for large shared data banks, Comm. ACM, 13 (1970), 377–387

10.

E. F. Codd, R. Rustin, Further normalization of the data base relational modelData Base Systems, Prentice-Hall, Englewood Cliffs, NJ, 1972, 33–64

11.

E. F. Codd, R. Rustin, Relational completeness of data base sublanguagesData Base Systems, Prentice-Hall, Englewood Cliffs, NJ, 1972, 65–98

12.

S. A. Cook, The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing, 1971, 151–158, May

13.

C. J. Date, An Introduction to Database Systems, Addison-Wesley, Reading, MA, 1977

14.

C. Delobel, Ph.D. Thesis, Contributions theorétiques à la conception d'un système d'informations, Univ. of Grenoble, 1973, Oct.

15.

R. Fagin, Multivalued dependencies and a new normal form for relational data-bases, ACM Trans. Database Sys., 2 (1977), 262–278

16.

Michael R. Garey, David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979x+338, A Guide to the Theory of NP-Completeness

17.

P. A. V. Hall, Optimization of a single relational expression in a relational data-base system, IBM J. Res. Develop., 20 (1976), 244–257

18.

Richard M. Karp, R. E. Miller, J. W. Thatcher, Reducibility among combinatorial problemsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York, 1972, 85–103

19.

J. Minker, Performing inferences over relational databases, Proc. ACM SIGMOD International Conference on Management of Data, San Jose, California, 1975, 79–91, May

20.

Frank P. Palermo, J. T. Tou, A data base search problemInformation systems (Fourth Internat. Sympos. Comput. and Information Sci., Miami Beach, Fla., 1972), Plenum Press, New York, 1974, 67–101

21.

R. M. Pecherer, Efficient evaluation of expressions in a relational algebra, Proc. ACM Pacific Conf., 1975, 44–49, April

22.

J. Rissanen, Independent components of relations, ACM Trans. Database Sys., 2 (1977), 317–325

23.

J. M. Smith, P. Y.-T. Chang, Optimizing the performance of a relational algebra database interface, Comm. ACM, 18 (1975), 568–579

24.

M. Stonebraker, L. A. Rowe, Observations on data manipulation languages and their embedding in general purpose programming languages, 2 TR UCB/ERL M77-53, University of California, Berkeley, 1977, July

25.

E. Wong, K. Youssefi, Decomposition—a strategy for query processing, ACM Trans. Database Sys, 1 (1976), 223–241

26.

C. Zaniolo, Analysis and design of relational schemata for database systems, Tech. Rept., UCLA-ENG-7769, Department of Computer Science, UCLA, 1976, July

27.

M. M. Zloof, Query-by-Example: the invocation and definition of tables and forms, Proc. ACM International Conf. on Very Large Data Bases, 1975, 1–24, Sept.

Information & Authors

Information

Published In

cover image SIAM Journal on Computing

SIAM Journal on Computing

Volume 8 • Issue 2 • May 1979

Pages: 218 - 246

DOI: 10.1137/0208017

ISSN (online): 1095-7111

Copyright

Copyright © 1979 Society for Industrial and Applied Mathematics.

History

Submitted: 23 March 1978

Published online: 13 July 2006

Authors

Affiliations

A. V. Aho

View all articles by this author

Y. Sagiv

View all articles by this author

J. D. Ullman

View all articles by this author

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

Qr-Hint: Actionable Hints Towards Correcting Wrong SQL Queries
Proceedings of the ACM on Management of Data, Vol. 2, No. 3 | 30 May 2024
Cross Ref
VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints
Proceedings of the ACM on Programming Languages, Vol. 8, No. OOPSLA1 | 29 April 2024
Cross Ref
Attribution Scores of BERT-Based SQL-Query Automatic Grading for Explainability
2023 International Conference on Computational Science and Computational Intelligence (CSCI) | 13 Dec 2023
Cross Ref
Demo: Structural Network Minimization: A Case of Reflective Networking
Proceedings of the ACM SIGCOMM 2023 Conference | 1 September 2023
Cross Ref
BERT Goes to SQL School: Improving Automatic Grading of SQL Statements
2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE) | 24 Jul 2023
Cross Ref
Solving the SPARQL query containment problem with SpeCS
Journal of Web Semantics, Vol. 76 | 1 Apr 2023
Cross Ref
SPES: A Symbolic Approach to Proving Query Equivalence Under Bag Semantics
2022 IEEE 38th International Conference on Data Engineering (ICDE) | 1 May 2022
Cross Ref
Modeling SQL Statement Correctness with Attention-Based Convolutional Neural Networks
2021 International Conference on Computational Science and Computational Intelligence (CSCI) | 1 Dec 2021
Cross Ref
Logically automorphically equivalent knowledge bases models
Journal of Algebra and Its Applications, Vol. 20, No. 08 | 17 July 2020
Cross Ref
Parameterized complexity of completeness reasoning for conjunctive queries
Theoretical Computer Science, Vol. 864 | 1 Apr 2021
Cross Ref
How Hard Is Completeness Reasoning for Conjunctive Queries?
Computing and Combinatorics | 27 August 2020
Cross Ref
Automated Grading of SQL Queries
2019 IEEE 35th International Conference on Data Engineering (ICDE) | 1 Apr 2019
Cross Ref
SPARQL Query Containment Under Schema
Journal on Data Semantics, Vol. 7, No. 3 | 22 May 2018
Cross Ref
Bounded Query Rewriting Using Views
ACM Transactions on Database Systems, Vol. 43, No. 1 | 23 March 2018
Cross Ref
Chase
Encyclopedia of Database Systems | 7 December 2018
Cross Ref
Snapshot Equivalence
Encyclopedia of Database Systems | 7 December 2018
Cross Ref
Weak Equivalence
Encyclopedia of Database Systems | 7 December 2018
Cross Ref
Verifying equivalence of database-driven applications
Proceedings of the ACM on Programming Languages, Vol. 2, No. POPL | 27 December 2017
Cross Ref
Relational lattices: From databases to universal algebra
Journal of Logical and Algebraic Methods in Programming, Vol. 85, No. 4 | 1 Jun 2016
Cross Ref
Chase
Encyclopedia of Database Systems | 12 December 2016
Cross Ref
Snapshot Equivalence
Encyclopedia of Database Systems | 8 December 2016
Cross Ref
Weak Equivalence
Encyclopedia of Database Systems | 22 November 2016
Cross Ref
Defining Energy Consumption Plans for Data Querying Processes
2014 IEEE Fourth International Conference on Big Data and Cloud Computing | 1 Dec 2014
Cross Ref
A theoretical framework for knowledge-based entity resolution
Theoretical Computer Science, Vol. 549 | 1 Sep 2014
Cross Ref
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems, Vol. 39, No. 1 | 6 January 2014
Cross Ref
Isotypeness of Models and Knowledge Bases Equivalence
Mathematics in Computer Science, Vol. 7, No. 4 | 24 November 2013
Cross Ref
WITHDRAWN: A theoretical framework for knowledge-based entity resolution
Theoretical Computer Science | 1 Oct 2013
Cross Ref
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation, Vol. 215 | 1 Jun 2012
Cross Ref
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM, Vol. 59, No. 3 | 1 June 2012
Cross Ref
Symmetries of knowledge bases
Annals of Mathematics and Artificial Intelligence, Vol. 64, No. 4 | 15 May 2012
Cross Ref
Tableaux-based optimization of schema mappings for data integration
Journal of Intelligent Information Systems, Vol. 38, No. 2 | 11 June 2011
Cross Ref
Incomplete Data and Data Dependencies in Relational Databases
Synthesis Lectures on Data Management | 2 March 2022
Cross Ref
On the Decidability and Complexity of Identity Knowledge Representation
Database Systems for Advanced Applications | 1 Jan 2012
Cross Ref
Knowledge Bases Over Algebraic Models
International Journal of Knowledge Management, Vol. 8, No. 1 | 1 Jan 2012
Cross Ref
Tabular representation of schema mappings of a data exchange system
14th International Conference on Computer and Information Technology (ICCIT 2011) | 1 Dec 2011
Cross Ref
A Theoretical and Experimental Comparison of Algorithms for the Containment of Conjunctive Queries with Negation
Database and Expert Systems Applications | 1 Jan 2011
Cross Ref
Personalizing queries based on networks of composite preferences
ACM Transactions on Database Systems, Vol. 35, No. 2 | 3 May 2010
Cross Ref
Subsumption and complementation as data fusion operators
Proceedings of the 13th International Conference on Extending Database Technology | 22 March 2010
Cross Ref
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
Database and Expert Systems Applications | 1 Jan 2010
Cross Ref
Deduction in Existential Conjunctive First-Order Logic: An Algorithm and Experiments
Artificial Intelligence: Methodology, Systems, and Applications | 1 Jan 2010
Cross Ref
BlueS: Indexing Support for Data Exchange in Ubiquitous Environments
2009 Third International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies | 1 Oct 2009
Cross Ref
Size and treewidth bounds for conjunctive queries
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 29 June 2009
Cross Ref
BlueS: query processing in ubiquitous environments
Proceedings of the 2009 EDBT/ICDT Workshops | 22 March 2009
Cross Ref
Chase
Encyclopedia of Database Systems | 1 Jan 2009
Cross Ref
Snapshot Equivalence
Encyclopedia of Database Systems | 1 Jan 2009
Cross Ref
Weak Equivalence
Encyclopedia of Database Systems | 1 Jan 2009
Cross Ref
Containment between Unions of XPath Queries
Database Systems for Advanced Applications | 1 Jan 2009
Cross Ref
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment, Vol. 1, No. 1 | 1 August 2008
Cross Ref
Comparing Rule-Based Policies
2008 IEEE Workshop on Policies for Distributed Systems and Networks | 1 Jun 2008
Cross Ref
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic, Vol. 9, No. 3 | 12 June 2008
Cross Ref
Efficient core computation in data exchange
Journal of the ACM, Vol. 55, No. 2 | 15 May 2008
Cross Ref
Auditing Inference Based Disclosures in Dynamic Databases
Secure Data Management | 1 Jan 2008
Cross Ref
Triggers over nested views of relational data
ACM Transactions on Database Systems, Vol. 31, No. 3 | 1 September 2006
Cross Ref
On the efficiency of checking perfect privacy
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 26 June 2006
Cross Ref
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence, Vol. 170, No. 8-9 | 1 Jun 2006
Cross Ref
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Database Theory – ICDT 2007 | 1 Jan 2006
Cross Ref
Computing cores for data exchange
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 13 June 2005
Cross Ref
Checking query containment with the CQC method
Data & Knowledge Engineering, Vol. 53, No. 2 | 1 May 2005
Cross Ref
Decidable containment of recursive queries
Theoretical Computer Science, Vol. 336, No. 1 | 1 May 2005
Cross Ref
Projection Pushing Revisited
Advances in Database Technology - EDBT 2004 | 1 Jan 2004
Cross Ref
Authorization Views and Conditional Query Containment
Database Theory - ICDT 2005 | 1 Jan 2004
Cross Ref
Containment of Nested XML Queries
Proceedings 2004 VLDB Conference | 1 Jan 2004
Cross Ref
Efficient XML-to-SQL Query Translation
Proceedings 2004 VLDB Conference | 1 Jan 2004
Cross Ref
Reasoning on regular path queries
ACM SIGMOD Record, Vol. 32, No. 4 | 1 December 2003
Cross Ref
Static reasoning about programs and queries
Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday | 8 June 2003
Cross Ref
Query containment for data integration systems
Journal of Computer and System Sciences, Vol. 66, No. 1 | 1 Feb 2003
Cross Ref
Decidable Containment of Recursive Queries
Database Theory — ICDT 2003 | 16 December 2002
Cross Ref
Scalable Query Reformulation Using Views in the Presence of Functional Dependencies
Advances in Web-Age Information Management | 1 Jan 2003
Cross Ref
Data integration
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 3 June 2002
Cross Ref
Compressing SQL workloads
Proceedings of the 2002 ACM SIGMOD international conference on Management of data | 3 June 2002
Cross Ref
View-Based Query Answering and Query Containment over Semistructured Data
Database Programming Languages | 4 October 2002
Cross Ref
Cylindric structures and dependencies in relational databases
Theoretical Computer Science, Vol. 269, No. 1-2 | 1 Oct 2001
Cross Ref
Normal forms for connectedness in categories
Annals of Pure and Applied Logic, Vol. 108, No. 1-3 | 1 Mar 2001
Cross Ref
Applying an update method to a set of receivers
ACM Transactions on Database Systems, Vol. 26, No. 1 | 1 March 2001
Cross Ref
THE USE OF CARIN LANGUAGE AND ALGORITHMS FOR INFORMATION INTEGRATION: THE PICSEL SYSTEM
International Journal of Cooperative Information Systems, Vol. 09, No. 04 | 6 April 2012
Cross Ref
Conjunctive query containment revisited
Theoretical Computer Science, Vol. 239, No. 2 | 1 May 2000
Cross Ref
Recursive query plans for data integration
The Journal of Logic Programming, Vol. 43, No. 1 | 1 Apr 2000
Cross Ref
Containment and Optimization of Object-Preserving Conjunctive Queries
- Edward P. F. Chan and
- Ron van der Meyden
SIAM Journal on Computing, Vol. 29, No. 4 | 27 July 2006
Abstract PDF (254 KB)
Managing Schemata for Semistructured Databases Using Constraints
Current Issues in Databases and Information Systems | 1 June 2001
Cross Ref
Optimization of Nested SQL Queries by Tableau Equivalence
Research Issues in Structured and Semistructured Database Programming | 13 April 2001
Cross Ref
Linearly Bounded Reformulations of Conjunctive Databases
Computational Logic — CL 2000 | 15 December 2000
Cross Ref
On the Equivalence of XML Patterns
Computational Logic — CL 2000 | 15 December 2000
Cross Ref
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries
Journal of Computer and System Sciences, Vol. 59, No. 1 | 1 Aug 1999
Cross Ref
Reasoning about nested functional dependencies
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 1 May 1999
Cross Ref
Answering Queries by Semantic Caches
Database and Expert Systems Applications | 18 June 2002
Cross Ref
Tableau Techniques for Querying Information Sources through Global Schemas
Database Theory — ICDT’99 | 15 January 1999
Cross Ref
An Equational Chase for Path-Conjunctive Queries, Constraints, Views
Database Theory — ICDT’99 | 15 January 1999
Cross Ref
Designing a Global Information Resource for Molecular Biology (Short Paper)
Datenbanksysteme in Büro, Technik und Wissenschaft | 1 Jan 1999
Cross Ref
A Fast Algorithm for Query Optimization in Universal-Relation Databases
Journal of Computer and System Sciences, Vol. 56, No. 3 | 1 Jun 1998
Cross Ref
Verification of knowledge bases based on containment checking
Artificial Intelligence, Vol. 101, No. 1-2 | 1 May 1998
Cross Ref
Query containment for conjunctive queries with regular expressions
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 May 1998
Cross Ref
On the decidability of query containment under constraints
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 May 1998
Cross Ref
Complexity of answering queries using materialized views
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 May 1998
Cross Ref
Containment of conjunctive queries with built-in predicates with variables and constants over any ordered domain
Advances in Databases and Information Systems | 29 June 2006
Cross Ref
Uncertain deductive databases: A hybrid approach
Information Systems, Vol. 22, No. 8 | 1 Dec 1997
Cross Ref
A corrected 5NF definition for relational database design
Theoretical Computer Science, Vol. 185, No. 2 | 1 Oct 1997
Cross Ref
Deciding containment for queries with complex objects (extended abstract)
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 May 1997
Cross Ref
On the containment and equivalence of database queries with linear constraints (extended abstract)
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 May 1997
Cross Ref
Redundancy elimination and a new normal form for relational database design
Semantics in Databases | 23 June 2005
Cross Ref
Implication and referential constraints: a new formal reasoning
IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No. 6 | 1 Jan 1997
Cross Ref
Perspectives on database theory
ACM SIGACT News, Vol. 27, No. 3 | 1 September 1996
Cross Ref
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems, Vol. 21, No. 2 | 1 June 1996
Cross Ref
Conjunctive query containment revisited
Database Theory — ICDT '97 | 3 June 2005
Cross Ref
Conjunctive query containment with respect to views and constraints
Information Processing Letters, Vol. 57, No. 2 | 1 Jan 1996
Cross Ref
Query folding
Proceedings of the Twelfth International Conference on Data Engineering | 1 Jan 1996
Cross Ref
Containment of conjunctive queries
ACM Transactions on Database Systems, Vol. 20, No. 3 | 1 September 1995
Cross Ref
Argument reduction by factoring
Theoretical Computer Science, Vol. 146, No. 1-2 | 1 Jul 1995
Cross Ref
Applying an update method to a set of receivers (extended abstract)
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 22 May 1995
Cross Ref
Literaturverzeichnis
Grundlagen von Informationssystemen | 1 Jan 1995
Cross Ref
Optimization of a subclass of conjunctive queries
Acta Informatica, Vol. 32, No. 1 | 1 Jan 1995
Cross Ref
Perspectives on database theory
Proceedings of IEEE 36th Annual Foundations of Computer Science | 1 Jan 1995
Cross Ref
Insertion anomalies and the justification for 4NF in relational databases
Information Sciences, Vol. 81, No. 1-2 | 1 Nov 1994
Cross Ref
Testing satisfiability of a class of object-oriented conjunctive queries
Theoretical Computer Science, Vol. 134, No. 2 | 1 Nov 1994
Cross Ref
Some results on the containment and minimization of (in) equality queries
Information Processing Letters, Vol. 50, No. 5 | 1 Jun 1994
Cross Ref
Solving queries by tree projections
ACM Transactions on Database Systems, Vol. 18, No. 3 | 1 September 1993
Cross Ref
On the Boundedness of Constant-Time-Maintainable Database Schemes
- Héctor J. Hernández and
- Ke Wang
SIAM Journal on Computing, Vol. 22, No. 1 | 13 July 2006
Abstract PDF (2499 KB)
Equivalence of Datalog queries is undecidable
The Journal of Logic Programming, Vol. 15, No. 3 | 1 Feb 1993
Cross Ref
Supporting inconsistent rules in database systems
Journal of Intelligent Information Systems, Vol. 1, No. 3-4 | 1 Dec 1992
Cross Ref
Minimizing restricted-fanout queries
Discrete Applied Mathematics, Vol. 40, No. 2 | 1 Dec 1992
Cross Ref
Commutativity and its role in the processing of linear recursion
The Journal of Logic Programming, Vol. 14, No. 3-4 | 1 Nov 1992
Cross Ref
Graphic representation of linear recursive rules
International Journal of Intelligent Systems, Vol. 7, No. 4 | 1 Jun 1992
Cross Ref
On characterizing boundedness of database schemes with bounded dependencies
Theoretical Computer Science, Vol. 100, No. 2 | 1 Jun 1992
Cross Ref
Constant-time maintainability
ACM Transactions on Database Systems, Vol. 17, No. 2 | 1 June 1992
Cross Ref
A formal model of trade-off between optimization and execution costs in semantic query optimization
Data & Knowledge Engineering, Vol. 8, No. 2 | 1 May 1992
Cross Ref
Connection-trap-free database schemes
Journal of Computer and System Sciences, Vol. 44, No. 1 | 1 Feb 1992
Cross Ref
Compilation of set terms in the logic data language (LDL)
The Journal of Logic Programming, Vol. 12, No. 1-2 | 1 Jan 1992
Cross Ref
Constant-time-maintainable BCNF database schemes
ACM Transactions on Database Systems, Vol. 16, No. 4 | 1 December 1991
Cross Ref
Formal semantics of SQL queries
ACM Transactions on Database Systems, Vol. 16, No. 3 | 1 September 1991
Cross Ref
One-sided recursions
Journal of Computer and System Sciences, Vol. 42, No. 2 | 1 Apr 1991
Cross Ref
A simple characterization of uniform boundedness for a class of recursions
The Journal of Logic Programming, Vol. 10, No. 3-4 | 1 Apr 1991
Cross Ref
Syntactic characterizations of 1-bounded Datalog programs
Deductive and Object-Oriented Databases | 4 June 2005
Cross Ref
Relationale Datenbanken - Relationenorientierte Programmierung (2)
Programmiermethoden der Künstlichen Intelligenz | 1 Jan 1991
Cross Ref
Complete containment sets and their application to the inference problem
Proceedings Seventh Annual Computer Security Applications Conference | 1 Jan 1991
Cross Ref
Semantic query optimization using inter-relational functional dependencies
Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences | 1 Jan 1991
Cross Ref
Efficient and optimal query answering on independent schemes
Theoretical Computer Science, Vol. 77, No. 3 | 1 Dec 1990
Cross Ref
Efficient updates to independent schemes in the weak instance model
Proceedings of the 1990 ACM SIGMOD international conference on Management of data | 1 May 1990
Cross Ref
Efficient updates to independent schemes in the weak instance model
ACM SIGMOD Record, Vol. 19, No. 2 | 1 May 1990
Cross Ref
Constraint query languages (preliminary report)
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 2 April 1990
Cross Ref
The implication problem for inclusion dependencies
ACM SIGMOD Record, Vol. 19, No. 1 | 1 March 1990
Cross Ref
Finding two-tree-factor elements of tableau-defined monoids in time O(n 3)
Advances in Computing and Information — ICCI '90 | 7 June 2005
Cross Ref
Optimization of a subclass of conjunctive queries
ICDT '90 | 7 June 2005
Cross Ref
Elements of Relational Database Theory
Formal Models and Semantics | 1 Jan 1990
Cross Ref
Redundancy detection in logic programs is undecidable
Proceedings., Fourteenth Annual International Computer Software and Applications Conference | 1 Jan 1990
Cross Ref
Recursive query processing: the power of logic
Theoretical Computer Science, Vol. 69, No. 1 | 1 Dec 1989
Cross Ref
A Design Theory for Solving the Anomalies Problem
- Edward P. F. Chan
SIAM Journal on Computing, Vol. 18, No. 3 | 31 July 2006
Abstract PDF (2909 KB)
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems, Vol. 14, No. 2 | 1 June 1989
Cross Ref
Automatic generation of test data for relational queries
Journal of Computer and System Sciences, Vol. 38, No. 2 | 1 Apr 1989
Cross Ref
Data independent recursion in deductive databases
Journal of Computer and System Sciences, Vol. 38, No. 2 | 1 Apr 1989
Cross Ref
A characterization of finite fd-acyclicity
Journal of Computer and System Sciences, Vol. 38, No. 2 | 1 Apr 1989
Cross Ref
Updating databases in the weak instance model
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 29 March 1989
Cross Ref
A decision procedure for conjunctive query disjointness
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 29 March 1989
Cross Ref
Minimizing Expansions of Recursions
Algebraic Techniques | 1 Jan 1989
Cross Ref
Logic and Databases: A Deductive Approach
Readings in Artificial Intelligence and Databases | 1 Jan 1989
Cross Ref
Incomplete Information in Relational Databases
Readings in Artificial Intelligence and Databases | 1 Jan 1989
Cross Ref
Bibliography
Readings in Artificial Intelligence and Databases | 1 Jan 1989
Cross Ref
Design and implementation of a semantic query optimizer
IEEE Transactions on Knowledge and Data Engineering, Vol. 1, No. 3 | 1 Jan 1989
Cross Ref
A selected artificial intelligence bibliography for operations researchers
Annals of Operations Research, Vol. 12, No. 1 | 1 Dec 1988
Cross Ref
Testing unboundedness of database schemes and functional dependencies
Information Processing Letters, Vol. 28, No. 6 | 1 Aug 1988
Cross Ref
Optimization on a case of type‐d nested query
Journal of the Chinese Institute of Engineers, Vol. 11, No. 3 | 4 May 2011
Cross Ref
Theory of database queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 March 1988
Cross Ref
Independence-reducible database schemes
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 March 1988
Cross Ref
Optimization of multiple-relation multiple-disjunct queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 March 1988
Cross Ref
On Bounded Database Schemes and Bounded Horn-Clause Programs
- Yehoshua Sagiv
SIAM Journal on Computing, Vol. 17, No. 1 | 13 July 2006
Abstract PDF (2879 KB)
A natural semantics for modal logic over databases
Theoretical Computer Science, Vol. 56, No. 2 | 1 Feb 1988
Cross Ref
The equivalence problem for relational database schemes
MFDBS 87 | 31 May 2005
Cross Ref
Foundations of Semantic Query Optimization for Deductive Databases
Foundations of Deductive Databases and Logic Programming | 1 Jan 1988
Cross Ref
Optimizing Datalog Programs
Foundations of Deductive Databases and Logic Programming | 1 Jan 1988
Cross Ref
The verso algebra or how to answer queries with fewer joins
Journal of Computer and System Sciences, Vol. 35, No. 3 | 1 Dec 1987
Cross Ref
A system for semantic query optimization
ACM SIGMOD Record, Vol. 16, No. 3 | 1 December 1987
Cross Ref
A decidable class of bounded recursions
Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 June 1987
Cross Ref
Decidability and expressiveness aspects of logic queries
Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 June 1987
Cross Ref
Optimizing datalog programs
Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 1 June 1987
Cross Ref
Multi-relation dependencies
Information Systems, Vol. 12, No. 2 | 1 Jan 1987
Cross Ref
On testing soundness of relational expressions
Information Systems, Vol. 12, No. 2 | 1 Jan 1987
Cross Ref
Fact structure and its application to updates in relational databases
Information Systems, Vol. 12, No. 2 | 1 Jan 1987
Cross Ref
A time bound on the materialization of some recursively defined views
Algorithmica, Vol. 1, No. 1-4 | 1 Nov 1986
Cross Ref
Equivalence of views by query capacity
Journal of Computer and System Sciences, Vol. 33, No. 2 | 1 Oct 1986
Cross Ref
On the expressive power of data dependencies
Acta Informatica, Vol. 23, No. 3 | 1 Jun 1986
Cross Ref
An ‘intelligent’ extraction and aggregation tool for company data bases
Decision Support Systems, Vol. 2, No. 2 | 1 Jun 1986
Cross Ref
Notions of dependency satisfaction
Journal of the ACM, Vol. 33, No. 1 | 2 January 1986
Cross Ref
Complexity to determine containment among inequality tableau queries
Systems and Computers in Japan, Vol. 17, No. 7 | 21 March 2007
Cross Ref
Theoretical foundation of algebraic optimization utilizing unnormalized relations
ICDT '86 | 2 June 2005
Cross Ref
A polynomial-time join dependency implication algorithm for unary multi-valued dependencies
ICDT '86 | 2 June 2005
Cross Ref
Current Trends in Database Query Processing
On Knowledge Base Management Systems | 1 Jan 1986
Cross Ref
Control of Search and Knowledge Acquisition in Large-Scale KBMS
On Knowledge Base Management Systems | 1 Jan 1986
Cross Ref
Elimination of redundant operations in relational queries with general selection operators
Computing, Vol. 34, No. 4 | 1 Dec 1985
Cross Ref
Functions in information systems
ACM SIGMIS Database: the DATABASE for Advances in Information Systems, Vol. 16, No. 4 | 1 July 1985
Cross Ref
The equivalence of solving queries and producing tree projections (extended abstract)
Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems | 1 June 1985
Cross Ref
Sagiv,Y-On finite FD-acyclicity
Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems | 1 June 1985
Cross Ref
Non-finite specifiability of projections of functional dependency families
Theoretical Computer Science, Vol. 39 | 1 Jan 1985
Cross Ref
Formal systems for join dependencies
Theoretical Computer Science, Vol. 38 | 1 Jan 1985
Cross Ref
Removing redundant join operations in queries involving views
Information Systems, Vol. 10, No. 3 | 1 Jan 1985
Cross Ref
GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
Journal of Computer and System Sciences, Vol. 29, No. 3 | 1 Dec 1984
Cross Ref
A Proof Procedure for Data Dependencies
Journal of the ACM, Vol. 31, No. 4 | 20 September 1984
Cross Ref
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM, Vol. 31, No. 4 | 20 September 1984
Cross Ref
Database states and their tableaux
ACM Transactions on Database Systems, Vol. 9, No. 2 | 3 June 1984
Cross Ref
Query Optimization in Database Systems
ACM Computing Surveys, Vol. 16, No. 2 | 1 June 1984
Cross Ref
Logic and Databases: A Deductive Approach
ACM Computing Surveys, Vol. 16, No. 2 | 1 June 1984
Cross Ref
Optimal computation of total projections with unions of simple chase join expressions
ACM SIGMOD Record, Vol. 14, No. 2 | 1 June 1984
Cross Ref
Formal Systems for Tuple and Equality Generating Dependencies
- C. Beeri and
- M. Y. Vardi
SIAM Journal on Computing, Vol. 13, No. 1 | 2 August 2006
Abstract PDF (2788 KB)
The implication and finite implication problems for typed template dependencies
Journal of Computer and System Sciences, Vol. 28, No. 1 | 1 Feb 1984
Cross Ref
The tree projection theorem and relational query processing
Journal of Computer and System Sciences, Vol. 28, No. 1 | 1 Feb 1984
Cross Ref
The relational model of data and cylindric algebras
Journal of Computer and System Sciences, Vol. 28, No. 1 | 1 Feb 1984
Cross Ref
Testing containment of conjunctive queries under functional and inclusion dependencies
Journal of Computer and System Sciences, Vol. 28, No. 1 | 1 Feb 1984
Cross Ref
Query transformation in an instructional database management system
ACM SIGCSE Bulletin, Vol. 16, No. 1 | 1 January 1984
Cross Ref
The theory of data dependencies — An overview
Automata, Languages and Programming | 28 May 2005
Cross Ref
On the Undecidability of Equivalence Problems for Relational Expressions
Advances in Data Base Theory | 1 Jan 1984
Cross Ref
Minimal Coverings of Acyclic Database Schemata
Advances in Data Base Theory | 1 Jan 1984
Cross Ref
Connections in acyclic hypergraphs
Theoretical Computer Science, Vol. 32, No. 1-2 | 1 Jan 1984
Cross Ref
Acyclic join dependency and data base projections
Journal of Computer and System Sciences, Vol. 27, No. 3 | 1 Dec 1983
Cross Ref
Optimizing Conjunctive Queries that Contain Untyped Variables
- D. S. Johnson and
- A. Klug
SIAM Journal on Computing, Vol. 12, No. 4 | 13 July 2006
Abstract PDF (3219 KB)
Characterizations for functional dependency and Boyce-Codd normal form families
Theoretical Computer Science, Vol. 26, No. 3 | 1 Oct 1983
Cross Ref
Order dependency in the relational model
Theoretical Computer Science, Vol. 26, No. 1-2 | 1 Sep 1983
Cross Ref
The complexity of evaluating relational queries
Information and Control, Vol. 58, No. 1-3 | 1 Jul 1983
Cross Ref
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems, Vol. 8, No. 2 | 1 June 1983
Cross Ref
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
- Yehoshua Sagiv
SIAM Journal on Computing, Vol. 12, No. 2 | 31 July 2006
Abstract PDF (1694 KB)
Windows on the world
ACM SIGMOD Record, Vol. 13, No. 4 | 1 May 1983
Cross Ref
Functional dependencies on cyclic database schemes
ACM SIGMOD Record, Vol. 13, No. 4 | 1 May 1983
Cross Ref
Functions in databases
ACM Transactions on Database Systems, Vol. 8, No. 1 | 1 March 1983
Cross Ref
An O(N2) equivalence algorithm for fan-out free queries
ICDT '88 | 1 June 2005
Cross Ref
Idempotent single-predicate horn clauses
ICDT '88 | 1 June 2005
Cross Ref
On decomposition of relational databases
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) | 1 Nov 1982
Cross Ref
Determining View dependencies using tableaux
ACM Transactions on Database Systems, Vol. 7, No. 3 | 1 September 1982
Cross Ref
Algebraic dependencies
Journal of Computer and System Sciences, Vol. 25, No. 1 | 1 Aug 1982
Cross Ref
Structure and complexity of relational queries
Journal of Computer and System Sciences, Vol. 25, No. 1 | 1 Aug 1982
Cross Ref
Strong equivalence of relational expressions under dependencies
Information Processing Letters, Vol. 14, No. 2 | 1 Apr 1982
Cross Ref
Power of Natural Semijoins
- Philip A. Bernstein and
- Nathan Goodman
SIAM Journal on Computing, Vol. 10, No. 4 | 13 July 2006
Abstract PDF (2303 KB)
Optimizing conjunctive queries when attribute domains are not disjoint
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) | 1 Oct 1981
Cross Ref
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems, Vol. 6, No. 3 | 1 September 1981
Cross Ref
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- A. V. Aho,
- Y. Sagiv,
- T. G. Szymanski, and
- J. D. Ullman
SIAM Journal on Computing, Vol. 10, No. 3 | 13 July 2006
Abstract PDF (1884 KB)
Equivalence of Relational Database Schemes
SIAM Journal on Computing, Vol. 10, No. 2 | 2 August 2006
Abstract PDF (2422 KB)
On The Properties of Join Dependencies
Advances in Data Base Theory | 1 Jan 1981
Cross Ref
Limitations of the chase
Information Processing Letters, Vol. 13, No. 4-5 | 1 Jan 1981
Cross Ref
Using Semi-Joins to Solve Relational Queries
Journal of the ACM, Vol. 28, No. 1 | 1 January 1981
Cross Ref
Computable queries for relational data bases
Journal of Computer and System Sciences, Vol. 21, No. 2 | 1 Oct 1980
Cross Ref
Algebraic dependencies
21st Annual Symposium on Foundations of Computer Science (sfcs 1980) | 1 Oct 1980
Cross Ref
Structure and complexity of relational queries
21st Annual Symposium on Foundations of Computer Science (sfcs 1980) | 1 Oct 1980
Cross Ref
Testing implications of data dependencies
ACM Transactions on Database Systems, Vol. 4, No. 4 | 1 December 1979
Cross Ref
Generalized Mutual Dependencies And The Decomposition Of Database Relations
Fifth International Conference on Very Large Data Bases, 1979. | 1 Jan 1979
Cross Ref

View Options

Get Access

Purchase Save for later

Article Pay-Per-View $36.75 Add to cart

Access via your Institution
Questions about how to access this content? Contact SIAM at [email protected].

View options

PDF

Media

Figures

Other

Tables