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

可怖

書(shū)目名稱(chēng)Deductive and Object-Oriented Databases影響因子(影響力)




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases被引頻次




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases被引頻次學(xué)科排名




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases年度引用




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases年度引用學(xué)科排名




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases讀者反饋




書(shū)目名稱(chēng)Deductive and Object-Oriented Databases讀者反饋學(xué)科排名

Communicate

Foundations of aggregation in deductive databases,hat the underlying cause of many of the difficulties encountered in extending deductive database semantics to include aggregation is that . does not preserve the structure of the underlying domain very well. We study a binary relation ? that is stronger than the standard ?, contrasting its propertie

悶熱

夸張

Datalog with non-deterministic choice computes ,,the literature, we concentrate on the analysis of the . construct from the point of view of the expressive power. We show how such construct is capable of expressing several interesting deterministic and non deterministic problems, such as forms of negation, and ordering. We then prove that Datalog

Constrain

盲信者

Explaining program execution in deductive systems,el ‘explanations’ of a program evaluation/execution can be constructed to provide added functionality: (1) To debug a program by following a chain of deductions leading to an unexpected (and possibly incorrect) conclusion; (2) To follow the derivation of certain . conclusions to determine why and ho

盲信者

A logic for rule-based query optimization in graph-based data models,be used to express both user level queries as well as low-level evaluation strategies or access plans. This property enables rule-based query optimization to be viewed as the process of . expressions in such a language: “non-procedural” sub-expressions are gradually replaced by more “procedural” sub

compose

Specifying rule-based query optimizers in a reflective framework, from some kind of specification of optimizer behavior. These specification frameworks do a good job of partitioning and modularizing the kinds of information needed to generate a query optimizer. Most of them represent at least part of this information in a rule-like form. Nevertheless, large porti

TATE

Semantic query optimization in deductive object-oriented databases,ect-oriented specifications of F-logic proposed by Kifer and Lausen using the semantic query optimization technique developed by Chakravarthy, Grant, and Minker. In general, query processing in object-oriented databases is expensive when a query incorporates declarative rules, methods and inherited

法官