標(biāo)題: Titlebook: Deductive and Object-Oriented Databases; Second International C. Delobel,M. Kifer,Y. Masunaga Conference proceedings 1991 Springer-Verlag B [打印本頁(yè)] 作者: Alacrity 時(shí)間: 2025-3-21 19:21
書目名稱Deductive and Object-Oriented Databases影響因子(影響力)
書目名稱Deductive and Object-Oriented Databases影響因子(影響力)學(xué)科排名
書目名稱Deductive and Object-Oriented Databases網(wǎng)絡(luò)公開度
書目名稱Deductive and Object-Oriented Databases網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Deductive and Object-Oriented Databases被引頻次
書目名稱Deductive and Object-Oriented Databases被引頻次學(xué)科排名
書目名稱Deductive and Object-Oriented Databases年度引用
書目名稱Deductive and Object-Oriented Databases年度引用學(xué)科排名
書目名稱Deductive and Object-Oriented Databases讀者反饋
書目名稱Deductive and Object-Oriented Databases讀者反饋學(xué)科排名
作者: musicologist 時(shí)間: 2025-3-21 23:42
Updatable views in object-oriented databases,many previous object algebras, query results are sets of . instead of data tuples or new objects. Consequently, we have to solve the classification problem: where to include the view in the type and class lattices.作者: 外表讀作 時(shí)間: 2025-3-22 02:25
Path constraints for graph-based data models: Towards a unified theory of typing constraints, equatemantic terms, and it can be used to support a form of molecular abstraction..We present a sound and complete axiomatization for the case in which interpretations are permitted to be infinite, where the generalization taxonomy is a lower semi-lattice, and where the typing constraints apply only to s作者: Flustered 時(shí)間: 2025-3-22 05:40
Heiderose Wagner,Herbert Kubicekexpansions there is always the . one called the . of ., which, like Clark‘s Predicate Completion of ., is a first order extension of . providing the appropriate meaning or . for the database. We also show that the stationary semantics can be equivalently defined as the . and as the . of a minimal mo作者: 籠子 時(shí)間: 2025-3-22 09:27 作者: grovel 時(shí)間: 2025-3-22 16:04 作者: grovel 時(shí)間: 2025-3-22 19:49 作者: 極小量 時(shí)間: 2025-3-22 23:55 作者: 兩棲動(dòng)物 時(shí)間: 2025-3-23 01:25 作者: defeatist 時(shí)間: 2025-3-23 08:17
0302-9743 , deductive andobject-oriented systems have received a great dealofattention, but for the most part these two fields wereevolvingindependently of each other. Today there is a largebody of work suggesting that the deductive andobject-oriented paradigms complement eachother.The object-oriented paradig作者: 壓艙物 時(shí)間: 2025-3-23 11:27 作者: nominal 時(shí)間: 2025-3-23 15:29
Samira Benz,Georgios Sotiriadise both uniform 1-boundedness for single-rule programs and 1-boundedness for two-rule programs, when the programs belong to certain classes studied previously for the problem of boundedness. In addition, we provide an exact characterization for 1-boundedness of two-rule programs in which no EDB predicate is repeated in the recursive rule.作者: agnostic 時(shí)間: 2025-3-23 20:53
Dennis Walkenhorst,Maximilian Rufsed by programs that use only very simple positive existential selections. Also, a syntactic criterion is developed for the . of two such positive existential selections. These two results are then jointly applied to the problem of . complex object selections, which is much more complicated than in classical relational databases.作者: 挖掘 時(shí)間: 2025-3-24 01:34 作者: antenna 時(shí)間: 2025-3-24 05:31 作者: fidelity 時(shí)間: 2025-3-24 09:13 作者: Biguanides 時(shí)間: 2025-3-24 13:42
https://doi.org/10.1007/978-3-322-83273-3e query processing, it also supports the least fixed point computation in object-oriented database with deductive capability. This paper examines the use of the H-tree as uniform indexing structure to index objects for efficient query retrieval and, as an efficient implementation of the semi-naive evaluation of least fixed point computation.作者: Innovative 時(shí)間: 2025-3-24 16:11 作者: 表示問(wèn) 時(shí)間: 2025-3-24 22:42
Execution plan generation for an object-oriented data model,gebra are presented. The first algorithm runs quickly but may produce inefficient plans. The second algorithm enumerates all possible execution plans and presents them in an efficient, compact representation.作者: Bucket 時(shí)間: 2025-3-25 01:56 作者: outrage 時(shí)間: 2025-3-25 05:06
A comparison between deductive and object-oriented database systems,ments. We close with an examination of the prospects for “classless” data, which is motivated by the prospect of databases where the number of distinct classes would be too large to name systematically. There are a number of challenges to implementing such facilities in either paradigm, and we propose some appropriate research questions.作者: insincerity 時(shí)間: 2025-3-25 08:19 作者: 是突襲 時(shí)間: 2025-3-25 12:53 作者: ALOFT 時(shí)間: 2025-3-25 17:51 作者: Vertebra 時(shí)間: 2025-3-25 21:13 作者: Genome 時(shí)間: 2025-3-26 00:11
Institutionen?konomik, Effizienz und Machts and algebra are equivalent, and both support expressive set-based and nondeterministic updates. Finally, we introduce a formal notion of answers of updates with respect to a database, and develop a sound and complete algorithm for update evaluation.作者: 冥界三河 時(shí)間: 2025-3-26 04:28 作者: BORE 時(shí)間: 2025-3-26 11:29 作者: 農(nóng)學(xué) 時(shí)間: 2025-3-26 13:57
G-Log: A declarative graphical query language,procedural” way. Furthermore, it provides an intuitive and flexible graphical tool for non-expert database users. We prove that G-Log is a graphical equivalent of the first order predicate calculus. Finally, we study its features as a non-deterministic language and compare it with other existing non-deterministic languages.作者: Blazon 時(shí)間: 2025-3-26 20:02
Syntactic characterizations of 1-bounded Datalog programs,e both uniform 1-boundedness for single-rule programs and 1-boundedness for two-rule programs, when the programs belong to certain classes studied previously for the problem of boundedness. In addition, we provide an exact characterization for 1-boundedness of two-rule programs in which no EDB predicate is repeated in the recursive rule.作者: 變異 時(shí)間: 2025-3-27 00:53 作者: 變態(tài) 時(shí)間: 2025-3-27 02:18 作者: 積習(xí)已深 時(shí)間: 2025-3-27 06:59 作者: incisive 時(shí)間: 2025-3-27 10:53 作者: prodrome 時(shí)間: 2025-3-27 13:44 作者: etidronate 時(shí)間: 2025-3-27 20:39
Charles A. Hayes,Christian Y. Paucthe conceptual level, and a . specification language at the logical level. By encoding the logical versioning semantics of an application into orthogonal dimensions, we generalize the ideas of historical and temporal databases to arbitrary object-oriented databases. The result is a unified, application-independent treatment of versioning.作者: 同音 時(shí)間: 2025-3-27 23:12 作者: 和藹 時(shí)間: 2025-3-28 02:49 作者: Tartar 時(shí)間: 2025-3-28 08:37 作者: 意外的成功 時(shí)間: 2025-3-28 10:24 作者: 問(wèn)到了燒瓶 時(shí)間: 2025-3-28 15:05 作者: Eructation 時(shí)間: 2025-3-28 20:14
Schema updates and consistency,We develop a formal model to capture the . of method schemas, and obtain basic results on such evolutions. We use our model to obtain an algorithm for .. The algorithm is . in the sense that it avoids any redundant checking.作者: labile 時(shí)間: 2025-3-29 00:25
https://doi.org/10.1007/3-540-55015-1Deduktive Datenbanken; Knowledge Representation; Logic Programming; classification; data model; database; 作者: 慷慨援助 時(shí)間: 2025-3-29 04:31
978-3-540-55015-0Springer-Verlag Berlin Heidelberg 1991作者: troponins 時(shí)間: 2025-3-29 07:30
Aufbau der Ala-Anzeigen-Gesellschaft on Shipman‘s original Daplex language [Sh 81] for the optimisation. The advantage of this is that it fits the navigational style of querying very well, but it is also optimisable. The optimisation is based on the equivalence of most Daplex queries to . as pointed out in [PG 90]..As we developed the作者: 神經(jīng) 時(shí)間: 2025-3-29 11:54 作者: Orthodontics 時(shí)間: 2025-3-29 15:54
https://doi.org/10.1007/978-3-322-83273-3perclass-subclass relationship. We show that, the H-tree indexing scheme is indeed a general access method for the new generation DBMS that most probably will support the object-oriented concept and have the deductive capability. The simplest form of the H-tree, like the widely used ..-tree, can be 作者: hereditary 時(shí)間: 2025-3-29 22:30 作者: justify 時(shí)間: 2025-3-30 01:52 作者: Guileless 時(shí)間: 2025-3-30 06:27
https://doi.org/10.1007/978-3-658-20233-0iously proposed approach, the . construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called ., which is consistent with the fixpoint-based semantics, cures the deficiencies of the former appr作者: Minutes 時(shí)間: 2025-3-30 08:55 作者: 鋼筆記下懲罰 時(shí)間: 2025-3-30 15:39 作者: VERT 時(shí)間: 2025-3-30 17:49 作者: homocysteine 時(shí)間: 2025-3-30 22:53
Dennis Walkenhorst,Maximilian Rufin this framework, we consider a class of “single pass-evaluable” selection operations. We show how such selection operations can be succinctly expressed by programs that use only very simple positive existential selections. Also, a syntactic criterion is developed for the . of two such positive exi作者: 寬大 時(shí)間: 2025-3-31 04:35 作者: PANT 時(shí)間: 2025-3-31 08:44 作者: handle 時(shí)間: 2025-3-31 10:08
Olivia Wallis BA(Hons),Emily Livorsi PhD dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions of . and . are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showi作者: Indict 時(shí)間: 2025-3-31 16:48 作者: SEMI 時(shí)間: 2025-3-31 20:06
https://doi.org/10.1007/978-3-658-17574-0fine complex object types in which property values may be any other objects. Often the query language allows a user to navigate from object to object by following a property value path. In this paper, we consider the combination of three forms of constraints over complex object types: equations, fun
