ON RELAXING SERIALIZABILITY BY CONSTRAINING TRANSACTION READSETS

Citation
E. Pitoura et al., ON RELAXING SERIALIZABILITY BY CONSTRAINING TRANSACTION READSETS, Information systems, 22(6-7), 1997, pp. 387-400
Citations number
21
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
ISSN journal
03064379
Volume
22
Issue
6-7
Year of publication
1997
Pages
387 - 400
Database
ISI
SICI code
0306-4379(1997)22:6-7<387:ORSBCT>2.0.ZU;2-P
Abstract
Although, concurrency control in database systems is primarily based o n serializability, many recent applications have rendered traditional serializability-based criteria inefficient or inappropriate. However, non-serializable executions may violate database consistency. In this paper, we propose a new approach to ensuring the correctness of non-se rializable executions. The approach is based on relating transaction v iews of the database to the integrity constraints of the system. The u nderlying concepts of view closure and view consistency are defined. T hen, drawing upon this approach, we develop a new correctness criterio n for multidatabases, which are confederations of pre-existing heterog eneous and autonomous distributed database systems. This criterion, ca lled view-based two-level serializability, relaxes serializability whi le respecting the autonomy of local database systems and preserving mu ltidatabase consistency. We investigate the application of the criteri on to various practical multidatabase scenarios and discuss implementa tion issues. (C) 1997 Elsevier Science Ltd. All rights reserved.