An Extended Algebra for Constraint
نویسندگان
چکیده
| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their characteristics, constraint databases are well suited to model multidimensional and structured data, like spatial and temporal data. The deenition of an algebra for constraint relational databases is important in order to make constraint databases a practical technology. In this paper, we extend the previously deened constraint algebra (called generalized relational algebra). First, we show that the relational model is not the only possible semantic reference model for constraint relational databases and we show how constraint relations can be interpreted under the nested relational model. Then, we introduce two distinct classes of constraint algebras, one based on the re-lational algebra, and one based on the nested relational algebra , and we present an algebra of the latter type. The algebra is proved equivalent to the generalized relational algebra when input relations are modiied by introducing generalized tuple identiiers. However, it is more suitable from a user point of view. Thus, the diierence existing between such algebras is similar to the diierence existing between the relational algebra and the nested relational algebra, dealing with only one level of nesting. We also show how external functions can be added to the proposed algebra.
منابع مشابه
Extended Fuzzy $BCK$-subalgebras
This paper extends the notion of fuzzy $BCK$-subalgebras to fuzzy hyper $BCK$-subalgebras and defines an extended fuzzy $BCK$-subalgebras. This study considers a type of fuzzy hyper $BCK$-ideals in this hyperstructure and describes the relationship between hyper $BCK$-ideals and fuzzy hyper $BCK$-ideals. In fact, it tries to introduce a strongly regular relation on hyper $...
متن کاملProperties of extended ideal based zero divisor graph of a commutative ring
This paper deals with some results concerning the notion of extended ideal based zero divisor graph $overline Gamma_I(R)$ for an ideal $I$ of a commutative ring $R$ and characterize its bipartite graph. Also, we study the properties of an annihilator of $overline Gamma_I(R)$.
متن کاملGlobal Optimization and Parallelization of Integrity Constraint Checks
In this paper we consider the problem of eeciently checking integrity constraints. We concentrate on a combination of two optimization techniques: global optimization and parallelization. The primary objective of global optimization is to produce a global execution plan for a group of constraints where common subexpressions can be shared. Since parallelism is a promising strategy for improving ...
متن کاملIntroducing External Functions in ConstraintQuery
Constraint databases use constraints to model and query data. In particular, constraints allow a nite representation of innnite sets of relational tuples (also called generalized tuples). The choice of different logical theories to express constraints inside relational languages leads to the deenition of constraint languages with diierent expressive power. Practical constraint database language...
متن کامل