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

懶鬼才會衰弱

羊齒

Foundations of aggregation in deductive databases,regate functions, based on structural recursion, is defined formally. Proposed language constructs permit users to define their own interpreted functions and aggregates..Several relational algebra operations are not monotonic w.r.t. ?. To overcome this problem, unfolding is proposed to “bury” the nonmonotonic operations inside aggregation.

Servile

Semantic query optimization in deductive object-oriented databases,antically-rich query that is more efficiently processed. We also discuss the issues of conflict resolution strategies and query evaluation priorities for queries involving the upper bounds of objects in the F-logic “type” lattice.

抑制

PANIC

進入

clarify

Friedens- und Konfliktforschung as the .. We show that several other important problems, such as the query containment problem, are polynomially equivalent to the IC-refuting problem. More importantly, we give criteria for designing a set of implication constraints so that an efficient process, called “units-refutation” process can be used to solve the IC-refuting problem.

松緊帶

天文臺

Treating programs as objects: The computational proxy experience,nism and our prototype implementation of it for computational chemistry codes. We conclude with a discussion of where declarative capabilities would have been a useful adjunct to object-oriented database features.

文藝

The differential fixpoint operator with subsumption,on accordingly. Moreover, we provide a differential fixpoint operator for efficient query evaluation. This operator discards subsumed tuples on the fly. We also exemplify the ease of use of this programming methodology. In particular, we demonstrate how heuristic AI search procedures can be integrated into logic programming in this way.