Equational theories and database constraints
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Functional computations in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Boyce-Codd normal form and object normal forms
Information Processing Letters
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Functional dependencies in Horn clause queries
ACM Transactions on Database Systems (TODS)
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
On taxonomic reasoning in conceptual design
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
Subsumption between queries to object-oriented databases
Information Systems - Special issue on extending database technology
Proceedings of the 30th IEEE symposium on Foundations of computer science
Refining the structure of terminological systems: terminology = schema + views
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Data model and query evaluation in global information systems
Journal of Intelligent Information Systems - Special issue: networked information discovery and retrieval
Fundamental techniques for order optimization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Principles of Database Systems
Principles of Database Systems
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Towards a sound view integration methodology
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
Adding Uniqueness Constraints to Description Logics (Preliminary Report)
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
IAAI '93 Proceedings of the The Fifth Conference on Innovative Applications of Artificial Intelligence
Classification as a Query Processing Technique in the CANDIDE Semantic Data Model
Proceedings of the Fifth International Conference on Data Engineering
Uniqueness constraints in object-relational databases and description logics
Uniqueness constraints in object-relational databases and description logics
Decomposition of a relation scheme into Boyce-Codd Normal Form
ACM SIGACT News
Identification constraints and functional dependencies in description logics
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.03 |
Uniqueness constraints such as keys and functional dependencies in the relational model are a core concept in information systems technology. In this paper, we consider uniqueness constraints suitable for object relational data models and identify a boundary between tractable and intractable varieties. The subclass that is tractable is still a strict generalization of both keys and relational functional dependencies. We present an efficient decision procedure for the logical implication problem of this subclass. The problem itself is formulated as an implication problem for a simple dialect of description logic (DL). DLs are a family of languages for knowledge representation that have many applications in information systems technology and for which model building procedures have been developed that can decide implication problems for dialects that are very expressive. Our own procedure complements this approach and can be integrated with these earlier procedures. Finally, to motivate our results, we review some applications of our procedure in query optimization.