Titlebook: Deductive and Object-Oriented Databases; Second International C. Delobel,M. Kifer,Y. Masunaga Conference proceedings 1991 Springer-Verlag B

壓艙物

nominal

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

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.

挖掘

antenna

fidelity

Biguanides

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

表示問

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