Titlebook: Database Theory - ICDT ‘95; 5th International Co Georg Gottlob,Moshe Y. Vardi Conference proceedings 1995 Springer-Verlag Berlin Heidelberg

嘴唇可修剪

-Languages for sets and sub-PTIME graph transformers,sponding finite set operations (data base queries) may be realized in NLOGSPACE under representation of sets by extensional well-founded (acyclic) graphs. (In a previous work for another version of .-language an exact correspondence to PTIME-computability was established.) Moreover, each of the ment

Myocarditis

聽覺

Unified transaction model for semantically rich operations,ive correctness criteria that encompass both serializability and failure atomicity in a uniform manner. As it turns out, an exact characterization of the class of prefix reducible schedules that was introduced for the simple read/write model in [AVA+94] is infeasible. Thus, we propose here two subcl

calamity

The Dynamic Two Phase Commitment (D2PC) protocol,n invested in optimizing its performance. The . (D2PC) protocol is an enhancement of the common (static) . (T2PC) protocols. Unlike T2PC, with D2PC the commit coordinator is dynamically determined by racing READY (YES vote) messages, on a per transaction basis, rather than being fixed, predetermined

CORD

Frequency-Range

An algebra for pomsets,tatype. We introduce an algebra for ., which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of different language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power

BROTH

單純

START

A rewriting technique for the analysis and the optimization of active databases,d transaction, which is viewed here as a sequence of atomic database updates forming a semantic unit, is translated by means of active rules into induced one(s). Those transactions embody active rule semantics which can be either immediate or deferred. Rule semantics, confluence, equivalence and opt

FEAT