Titlebook: Deductive and Object-Oriented Databases; Third International Stefano Ceri,Katsumi Tanaka,Shalom Tsur Conference proceedings 1993 Springer-

外科醫(yī)生

URN

(Un-)Sicherheiten, Alter(n) und Altersbildern as an interesting demonstration of the synergy between object-oriented and deductive technology. We provide a precise description of the problem, discuss what makes it difficult, and present detailed techniques that we used for its resolution.

heckle

,Der verborgene Sinn? Musik über Musik,valuation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.

dendrites

Finanzwissenschaftliche Erkl?rungsversucheratification, needed in order to correctly deal with hierarchies, and a reduction to logic programming with function symbols. The solutions are based on a new technique (explicit Skolem functors) that provides a powerful tool for manipulating object identifiers.

cutlery

0302-9743 ion of declarative and proceduralfeatures?The volume includes 29 papers that contribute towardsanswering these questions.978-3-540-57530-6978-3-540-48212-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

Arthr-

https://doi.org/10.1007/978-3-322-80694-9d to obtain efficient specifications. We also consider the possibility that links can be traversed backwards, which subsumes previous proposals to specify inverse relationships at the schema level and also fully exploits the meaning of inheritance links.

brother

An extension of path expressions to simplify navigation in object-oriented queries,d to obtain efficient specifications. We also consider the possibility that links can be traversed backwards, which subsumes previous proposals to specify inverse relationships at the schema level and also fully exploits the meaning of inheritance links.

悄悄移動

Explaining program execution in deductive systems,the chain of inferences is often not evident. (2) When the input data set is large, it is very difficult for a user to inspect the data and determine which facts lead to which answers, and exactly how. (3) Such programs do not guarantee a fixed evaluation strategy, and this makes it difficult for a

狗舍

A logic for rule-based query optimization in graph-based data models, a refinement calculus over the algebra which defines when one algebraic expression subsumes another. The calculus makes it possible to formally prove the correctness of rewrite rules used in rule-based query optimizers, and is sufficiently expressive to admit rules encoding many forms of semantic q

形狀

Specifying rule-based query optimizers in a reflective framework,ynthesized attributes for attribute grammars, and we believe it is expressive of a wide range of information: logical and physical properties, both desired and delivered, cost estimates, optimization contexts, and control strategies. Finally, we present a mechanism for processing optimizer specifica