Titlebook: Deductive and Object-Oriented Databases; 5th International Co François Bry,Raghu Ramakrishnan,Kotagiri Ramamohan Conference proceedings 199

做事过头

裙带关系

Maintaining constrained transitive closure by conjunctive queries,considered the incremental maintenance of deductive views defined by expensive database queries, including the transitive closure query. An interesting approach is to use only first-order queries in this maintenance, after small changes (e.g. one tuple insertions and deletions) to base relations. In

知识分子

拒绝

View maintenance using conditional tables,ble using additional data together with the views. For instance, one can replicate auxiliary views of the base relations at the site where the views are materialized to ensure self-maintenance of the views. However, the previous approaches often lead to the replication of the entire base relations,

收到

Adding uniqueness constraints to description logics,r of alternative semantics for concept constructors that could be introduced for this purpose in Description Logics. Most significantly, we show that Classic—the hitherto most expressive DL for which reasoning is tractable, can be extended with a version of constructors capturing functional dependen

HEPA-filter

A point-based temporal extension of SQL, our approach. The proposed language—SQL/TP—extends the syntax and semantics of SQL/92 in a very natural way: by adding a single data type to represent a linearly ordered universe of . instants. Such an extension allows the users to write temporal queries in customary fashion and . simplifies the se

弯曲的人

不爱防注射

Exploiting semantic of typed objects under an optimistic control in the transactional deferred updaexploiting properties such as commutativity of typed operations. To extract concurrency from objects, for the DU model, theoretical studies based on dependency graph model emphasized different types of dependencies between operations. Dependencies allow to specify possible concurrency between operat

Encoding

公猪