An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A framework for choosing a database query language
ACM Computing Surveys (CSUR)
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems (TODS)
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Efficient updates to independent schemes in the weak instance model
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Evaluation of queries in independent database schemes
Journal of the ACM (JACM)
Formal semantics of SQL queries
ACM Transactions on Database Systems (TODS)
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
Updating relational databases through weak instance interfaces
ACM Transactions on Database Systems (TODS)
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Proceedings of the 30th IEEE symposium on Foundations of computer science
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial-time program transformations in deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems (TODS)
Query-processing optimization strategies: feasible vs optimal solutions
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Locking Expressions for Increased Database Concurrency
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Equivalences among aggregate queries with negation
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Some properties of relational expressions
ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Answering queries in relational databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Range nesting: a fast method to evaluate quantified queries
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Processing queries with quantifiers a horticultural approach
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An extended relational algebra with control over duplicate elimination
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A universal relation database system implemented via the network model
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal computation of total projections with unions of simple chase join expressions
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Quality-driven Integration of Heterogenous Information Systems
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Adaptive Predicate Managers in Database Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Query Optimization by Stored Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Optimization of Nested SQL Queries by Tableau Equivalence
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
SQL4X: A Flexible Query Language for XML and Relational Databases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
A logic-based approach to data integration
Theory and Practice of Logic Programming
Equivalences among aggregate queries with negation
ACM Transactions on Computational Logic (TOCL)
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Abe: a query language for constructing aggregates-by-example
SSDBM'81 Proceedings of the 1st LBL Workshop on Statistical database management
Join minimization in XML-to-SQL translation: an algebraic approach
ACM SIGMOD Record
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic errors in SQL queries: A quite complete list
Journal of Systems and Software - Special issue: Quality software
Deciding equivalences among conjunctive aggregate queries
Journal of the ACM (JACM)
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Two approaches to the integration of heterogeneous data warehouses
Distributed and Parallel Databases
Efficient core computation in data exchange
Journal of the ACM (JACM)
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
Equivalence of queries that are sensitive to multiplicities
The VLDB Journal — The International Journal on Very Large Data Bases
Optimization of relational expressions using a logical analogon
IBM Journal of Research and Development
Cooperative update exchange in the Youtopia system
Proceedings of the VLDB Endowment
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Types and constraints: from relational to XML data
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Testing implication of probabilistic dependencies
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Tableaux-based optimization of schema mappings for data integration
Journal of Intelligent Information Systems
Distributed Adaptive Windowed Stream Join Processing
International Journal of Distributed Systems and Technologies
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
| Hi-index | 0.00 |
The design of several database query languages has been influenced by Codd's relational algebra. This paper discusses the difficulty of optimizing queries based on the relational algebra operations select, project, and join. A matrix, called a tableau, is proposed as a useful device for representing the value of a query, and optimization of queries is couched in terms of finding a minimal tableau equivalent to a given one. Functional dependencies can be used to imply additional equivalences among tableaux. Although the optimization problem is NP-complete, a polynomial time algorithm exists to optimize tableaux that correspond to an important subclass of queries.