𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized theory of serializability

✍ Scribed by K. Vidyasankar

Book ID
104706927
Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
678 KB
Volume
24
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

I-serializability: Generalized correctne
I-serializability: Generalized correctness for transaction-based environments
✍ JΓΌrgen Ebert; Gottfried Vossen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 707 KB

Motivated by shortcomings of classical serializability as a correct criterion in recent transaction-based environments (such as multidatabases or management of transactional workflows), we introduce and study a new notion of serializability which takes explicitly given invarianta into account. Invar

On serializability
On serializability
✍ J. A. Brzozowski; S. Muro πŸ“‚ Article πŸ“… 1985 πŸ› Springer 🌐 English βš– 742 KB
On serializability
On serializability
✍ J.A. Brzozowski; S. Muro πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 62 KB
Universally Serializable Computation
Universally Serializable Computation
✍ Lane A. Hemaspaandra; Mitsunori Ogihara πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

Cai and Furst proved that every PSPACE language can be solved via a large number of identical simple tasks, each of which is provided with the original input, its own unique task number, and at most three bits of output from the previous task. In the Cai Furst model, the tasks are required to be run