The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
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
A dynamic framework for object projection views
ACM Transactions on Database Systems (TODS)
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On interpretations of relational languages and solutions to the implied constraint problem
ACM Transactions on Database Systems (TODS)
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
A systematic approach to relational database theory
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Object projection views in the dynamic relational model
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Towards a sound view integration methodology
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A theory of data dependencies over relational expressions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Graph-Oriented Object Database Model
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Language Support for Office Modelling
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
PEIRCE: A relational DBMS for small systems
SIGSMALL '81 Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems
Exploiting uniqueness in query optimization
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2
Propagating XML constraints to relations
Journal of Computer and System Sciences
Semantic optimization techniques for preference queries
Information Systems
QAGen: generating query-aware test databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Logical integration of locally independent relational databases into a distributed database
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment
A framework for testing DBMS features
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting uniqueness in query optimization
CASCON First Decade High Impact Papers
Evaluation query answer over inconsistent database with annotations
WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
Annotation based query answer over inconsistent database
Journal of Computer Science and Technology
Preservation of integrity constraints by workflow
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
On the expressive power of update primitives
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
This paper deals with the problem of determining which of a certain class of constraints hold on a given relational algebra expression where the base relations come from a given schema. The class of constraints includes functional dependencies, equality of domains, and constancy of domains. The relational algebra consists of projection, selection, restriction, cross product, union, and difference. The problem as given is undecidable, but if set difference is removed from the algebra, there is a solution. Operators specifying a closure function (similar to functional dependency closure on one relation) are defined; these will generate exactly the set of constraints valid on the given relational algebra expression. We prove that the operators are sound and complete.