Titlebook: Semantics in Databases; Bernhard Thalheim,Leonid Libkin Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 constraint data

HEDGE

Achievements of relational database schema design theory revisited,ema design aims at both faithful formalization of the application and optimization at design time. It is guided by four heuristics: Separation of Aspects, Separation of Specializations, Inferential Completeness and Unique Flavor. A theory of schema design is to investigate these heuristics and to pr

Chivalrous

小步舞

The evolving algebra semantics of class and role hierarchies,bras provide an elegant way to specify the operational semantics of object-oriented data models. In particular, we define the formal semantics of a novice feature of object-oriented data models proposed recently by different authors: role hierarchies. As opposed to traditional class hierarchies, rol

arthroplasty

Semantics in spatial databases,model is particularly suited to model spatial database applications in which exact geometrical information is required and in which this information can be approximated by linear geometrical spatial objects. The topological model on the other hand is suitable for applications in which rather than ex

小木槌

The additivity problem for data dependencies in incomplete relational databases,tabases. We introduce null functional dependencies (NFDs) and null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and thus contains null values. If a NFD or NIND is weakly satisfied in a database, then there exists a possible world of this database in which t

領(lǐng)帶

A semantics-based approach to design of query languages for partial information,y in the presence of nulls. In this paper a different point of view is advocated. We believe that the semantics of partiality must be clearly understood and it should give us new design principles for languages for databases with partial information..There are different sources of partial informatio

貪婪地吃

Constraint databases: A survey,nt databases: known results, remaining open problems and current research directions. The paper also describes a new algebra for databases with integer order constraints and a complexity analysis of evaluating queries in this algebra.

MUTE

Redundancy elimination and a new normal form for relational database design,ain functional dependencies (FDs) and arbitrary join dependencies (JDs). Extending previous work on the relationship between fourth normal form (4NF) and redundancy elimination, a general definition of redundancy is proposed which is applicable to any type of relational dependency including arbitrar

共同確定為確

Ventilator