標(biāo)題: Titlebook: Deductive and Object-Oriented Databases; Third International Stefano Ceri,Katsumi Tanaka,Shalom Tsur Conference proceedings 1993 Springer- [打印本頁(yè)] 作者: 可怖 時(shí)間: 2025-3-21 18:01
書(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 時(shí)間: 2025-3-21 22:43
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作者: 悶熱 時(shí)間: 2025-3-22 02:12 作者: 夸張 時(shí)間: 2025-3-22 05:34
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 時(shí)間: 2025-3-22 11:46 作者: 盲信者 時(shí)間: 2025-3-22 16:46
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作者: 盲信者 時(shí)間: 2025-3-22 20:17
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 時(shí)間: 2025-3-23 00:17
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 時(shí)間: 2025-3-23 03:54
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 作者: 法官 時(shí)間: 2025-3-23 05:55 作者: 排斥 時(shí)間: 2025-3-23 13:00
Negation and aggregates in recursive rules: the ,++ approach,rent research in deductive databases. In this paper, we present a solution that combines generality with efficiency, as demonstrated by its implementation in the new .++ system. A novel and general treatment of set aggregates, allowing for user-defined aggregates, is also presented.作者: 不自然 時(shí)間: 2025-3-23 16:38 作者: 嚙齒動(dòng)物 時(shí)間: 2025-3-23 19:02 作者: inchoate 時(shí)間: 2025-3-24 01:19 作者: 成績(jī)上升 時(shí)間: 2025-3-24 03:35
An extension of path expressions to simplify navigation in object-oriented queries, that this does not fully exploit their potential expressive power as a tool to specify connections between objects. In particular, a user should not be required to specify a path to be followed in full, but rather should provide enough information so that the system can infer missing details automa作者: 確定無(wú)疑 時(shí)間: 2025-3-24 09:40
Query classes,he query language in such a data model has to reflect the amalgamation because it works as the interface to the user and/or application program. This paper proposes a language to formulate queries as classes related to the schema classes and constrained by an associative membership condition. Answer作者: Jacket 時(shí)間: 2025-3-24 10:54 作者: cumulative 時(shí)間: 2025-3-24 16:32 作者: Opponent 時(shí)間: 2025-3-24 20:13
https://doi.org/10.1007/978-3-658-33707-0antically-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.作者: Detonate 時(shí)間: 2025-3-25 00:10 作者: 懶鬼才會(huì)衰弱 時(shí)間: 2025-3-25 05:21 作者: 羊齒 時(shí)間: 2025-3-25 10:26
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 時(shí)間: 2025-3-25 12:55
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.作者: 抑制 時(shí)間: 2025-3-25 15:55 作者: PANIC 時(shí)間: 2025-3-25 23:42 作者: 進(jìn)入 時(shí)間: 2025-3-26 03:12 作者: clarify 時(shí)間: 2025-3-26 08:09
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.作者: 松緊帶 時(shí)間: 2025-3-26 09:42 作者: 天文臺(tái) 時(shí)間: 2025-3-26 15:13
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.作者: 文藝 時(shí)間: 2025-3-26 18:02
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.作者: 蒙太奇 時(shí)間: 2025-3-26 23:51
Datalog with non-deterministic choice computes ,,augmented with the dynamic choice expresses exactly the non deterministic time-polynomial queries. We thus obtain a complete characterization of the expressiveness of the dynamic choice, and conversely achieve a characterization of the class of queries . by means of a simple, declarative and efficiently implementable language.作者: 變化無(wú)常 時(shí)間: 2025-3-27 02:32 作者: 灰姑娘 時(shí)間: 2025-3-27 05:48
An implementation overview of the Aditi deductive database system,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.作者: xanthelasma 時(shí)間: 2025-3-27 10:17 作者: 凝乳 時(shí)間: 2025-3-27 15:05 作者: orthodox 時(shí)間: 2025-3-27 21:13 作者: 小步舞 時(shí)間: 2025-3-27 23:58
On efficient reasoning with implication constraints, 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.作者: 混沌 時(shí)間: 2025-3-28 04:43 作者: 耐寒 時(shí)間: 2025-3-28 09:21 作者: 坦白 時(shí)間: 2025-3-28 13:19 作者: 外科醫(yī)生 時(shí)間: 2025-3-28 17:08 作者: URN 時(shí)間: 2025-3-28 20:39
(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 時(shí)間: 2025-3-29 02:17
,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 時(shí)間: 2025-3-29 07:06
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 時(shí)間: 2025-3-29 08:15
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- 時(shí)間: 2025-3-29 14:35
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 時(shí)間: 2025-3-29 17:15
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.作者: 悄悄移動(dòng) 時(shí)間: 2025-3-29 20:14
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 作者: 狗舍 時(shí)間: 2025-3-30 02:43
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作者: 形狀 時(shí)間: 2025-3-30 05:47
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作者: Inoperable 時(shí)間: 2025-3-30 12:02
Gelber Regen, Schutzanzüge und Sirenenthe 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 作者: ADAGE 時(shí)間: 2025-3-30 15:50
Ronald Hitzler,Michaela Pfadenhauer 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作者: 樂(lè)器演奏者 時(shí)間: 2025-3-30 20:14 作者: esculent 時(shí)間: 2025-3-31 00:05
On the logical foundations of schema integration and evolution in heterogeneous database systems, SchemaLog ..作者: 過(guò)分 時(shí)間: 2025-3-31 01:21 作者: 生命 時(shí)間: 2025-3-31 06:09 作者: 樂(lè)章 時(shí)間: 2025-3-31 10:27 作者: Cerebrovascular 時(shí)間: 2025-3-31 15:27
Alter(n) im Japan der Gegenwartper proposes user-supplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottom-up evaluati作者: Gratuitous 時(shí)間: 2025-3-31 19:09 作者: kyphoplasty 時(shí)間: 2025-3-31 21:44 作者: 護(hù)身符 時(shí)間: 2025-4-1 05:49 作者: Endometrium 時(shí)間: 2025-4-1 09:48
Ronald Hitzler,Michaela Pfadenhauerbe 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
