Seventy-five problems for testing automatic theorem provers
Journal of Automated Reasoning
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
A formal approach to object-oriented databases
Data & Knowledge Engineering
Logic and databases: an assessment
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Making object-oriented schemas more expressive
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The object database standard: ODMG 2.0
The object database standard: ODMG 2.0
Object-oriented database schema analysis and inheritance processing: a graph-theoretic approach
Data & Knowledge Engineering
An efficient method for checking object-oriented database schema correctness
ACM Transactions on Database Systems (TODS)
Description logics for conceptual data modeling
Logics for databases and information systems
Interaction between path and type constraints
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inheritance hierarchy design in object-oriented databases
Data & Knowledge Engineering
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART 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
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
Consistency Checking in Complex Object Database Schemata with Integrity Constraints
IEEE Transactions on Knowledge and Data Engineering
Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas
IEEE Transactions on Knowledge and Data Engineering
Checking Consistency of Database Constraints: a Logical Basis
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Algebraic Properties of Bag Data Types
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Integrity Constraints Representation in Object-Oriented Databases
CIKM '92 Selected Papers from the First International Conference on Information and Knowledge Management, Expanding the Definition of Database
Calculi for Bags and their Complexity
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
Decidable Reasoning in UML Schemas with Constraints
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
An approach to testing conceptual schemas
Data & Knowledge Engineering
Verification and Validation of UML Conceptual Schemas with OCL Constraints
ACM Transactions on Software Engineering and Methodology (TOSEM)
An approach to test-driven development of conceptual schemas
Data & Knowledge Engineering
Hi-index | 0.00 |
The definition of methodologies for checking database constraint satisfiability, i.e., the absence of contradictions independently of any database state, is a fundamental and critical problem that has been marginally addressed in the literature. In this paper, a sound and complete algorithm is proposed for checking the satisfiability of a specific class of database integrity constraints in a simplified object-oriented model. Such a class includes cardinality constraints, set and bag attributes, and explicit integrity constraints involving comparison operators. The algorithm, conceived to support database schema design, allows the designer to distinguish among five different kinds of contradictions, each identified by an ad hoc procedure.