Name
Abstract | ||
|---|---|---|
The main semantics of constraints pertaining to OO (object-oriented) databases are identified, constraints are classified into types based on these semantics, and a simple and powerful constraint language for OO databases is described. If a set of constraints needs to be defined over the same subdatabase, the approach allows for defining the shared subdatabase first, followed by the set of constraints. If the original database is updated causing new extensional patterns to enter into the subdatabase (because they, after the update, satisfy the conditions used to define the subdatabase), these patterns have to satisfy all the constraints specified for the database. Typical database constraints, such as the non-null and total participation constraints, can be easily specified in the language as constraints on patterns of object associations. The implementation of the constraint processing system is described. The language supports the use of the existential and universal quantifiers |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/ICCL.1992.185494 | Oakland, CA |
Keywords | Field | DocType |
formal specification,object-oriented databases,object-oriented languages,query languages,specification languages,constraint language,constraint processing system,database constraints,database update,existential quantifiers,object-oriented databases,query languages,universal quantifiers | Data modeling,Query language,Programming language,Relational database,Computer science,Formal specification,Theoretical computer science,Database schema,Participation constraint,Constrained clustering,Semantics | Conference |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alashqur, A.M. | 1 | 16 | 5.86 |
| Su, S.Y.W. | 2 | 60 | 32.50 |
| Herman Lam | 3 | 305 | 91.31 |