An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model

Details An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model

2010-07-19

arxiv.org/abs/1007.3275v1

Computer Science

Databases

Scientific paper

Date and Darwen have proposed a theory of types, the latter forms the basis of a detailed presentation of a panoply of simple and complex types. However, this proposal has not been structured in a formal system. Specifically, Date and Darwen haven't indicated the formalism of the type system that corresponds to the type theory established. In this paper, we propose a pseudo-algorithmic and grammatical description of a system of types for Date and Darwen's model. Our type system is supposed take into account null values; for such intention, we introduce a particular type noted #, which expresses one or more occurrences of incomplete information in a database. Our algebraic grammar describes in detail the complete specification of an inheritance model and the subryping relation induced, thus the different definitions of related concepts.

Affiliated with

Also associated with

No associations

Rating

An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithmic Structuration of a Type System for an Orthogonal Object/Relational Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124580