Filters








3,482 Hits in 1.4 sec

Some constraints assuring serializability in multidatabases

A. Benczúr, C.K. Quang, T. Nikovits
1997 Computers and Mathematics with Applications  
Using them we give different, something weaker constraints, while global serializability of the multidatabase system is still achieved.  ...  In [1], the authors gave the following constraints: global transactions should be commit-deferred and local schedules rigorous to assure global serializability of the multidatabase system.  ...  In Sections 3 and 4, we deal with dynamic-serializable schedules, safe schedules, and constraints assuring global serializability. Finally, in Section 5, we give a discussion of the constraints.  ... 
doi:10.1016/s0898-1221(97)00203-4 fatcat:omtygbp2djbpzlzasivysvkmwa

Correctness Criteria Beyond Serializability [chapter]

Mourad Ouzzani, Brahim Medjahed, Ahmed K. Elmagarmid
2017 Encyclopedia of Database Systems  
,n) in S must occur in the same order in which they appear in T i , and (ii) operations from T j (j =i) may be interleaved with T i 's operations in S.  ...  However, with no concurrency, database systems may make poor use of their resources and hence, be inefficient, resulting in smaller transaction execution rate for example.  ...  a disjunctive clause (of the conjunctive form representing the integrity constraints) are serializable.  ... 
doi:10.1007/978-1-4899-7993-3_722-2 fatcat:i2tard3nzzgc3lboathksmrl2u

Correctness Criteria Beyond Serializability [chapter]

Kenneth A. Ross, Christian S. Jensen, Richard Snodgrass, Curtis E. Dyreson, Christian S. Jensen, Richard Snodgrass, Spiros Skiadopoulos, Cristina Sirangelo, Mary Lynette Larsgaard, Gösta Grahne, Daniel Kifer, Hans-Arno Jacobsen (+106 others)
2009 Encyclopedia of Database Systems  
a disjunctive clause (of the conjunctive form representing the integrity constraints) are serializable.  ...  Distributed databases with replicated or interdependent data.  ... 
doi:10.1007/978-0-387-39940-9_722 fatcat:mavufce4vffsximppekwjoir6a

On relaxing serializability by constraining transaction readsets

Evaggelia Pitoura, Aidong Zhang, Bharat Bhargava
1997 Information Systems  
However, non-serializable executions may violate database consistency.  ...  Although, concurrency control in database systems is primarily based on serializability, many recent applications have rendered traditional serializability-based criteria inefficient or inappropriate.  ...  Thus, by exploiting knowledge about the constraints we avoid the overheads associated with global serializability.  ... 
doi:10.1016/s0306-4379(97)00023-9 fatcat:oa2epiwat5c7xpj7amf3wokyri

Brief Announcement: On the Correctness of Transaction Processing with External Dependency

Masoomeh Javidi Kishi, Ahmed Hassan, Roberto Palmieri, Michael Wagner
2019 International Symposium on Distributed Computing  
We briefly introduce a unified model to characterize correctness levels stronger (or equal to) serializability in the presence of application invariant.  ...  We now define our new External Serializability consistency level.  ...  We call a history H Externally Serializable (or EC-SR) if: 1) it is serializable, and 2) external dependency defined by the edges of its EDG are not violated.  ... 
doi:10.4230/lipics.disc.2019.46 dblp:conf/wdag/KishiHP19 fatcat:htws7ldglzg4nabu4xjawfzk64

Ensuring consistency in multidatabases by preserving two-level serializability

Sharad Mehrotra, Rajeev Rastogi, Henry F. Korth, Abraham Silberschatz
1998 ACM Transactions on Database Systems  
In general, solutions to the global serializability problem result in executions with a low degree of concurrency. The alternative, relaxed serializability, m a y result in data inconsistency.  ...  Our approach exploits the structure of the integrity constraints and the nature of transaction programs to ensure consistency without requiring executions to be serializable.  ...  Signi cant w ork has gone into developing techniques to ensure global serializability.  ... 
doi:10.1145/292481.277629 fatcat:umfls57jejcephizeq554za5fy

A view-based approach to relaxing global serializability in a multidatabase system

Evaggelia Pitoura, Aidong Zhang, Bharat Bhargava
1995 Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95  
The approach is based on relating transaction views of the database to the integrity constraints of the system.  ...  This criterion, caUed view-based two-level serializability, relaxes global serializabitity in multidatabase systems while respecting the autonomy of local database systems.  ...  Let [ned) denote the set of data items which shares a common integrity constraint with data item d.  ... 
doi:10.1145/224964.225003 dblp:conf/podc/PitouraZB95 fatcat:bpyvy7ba3nehffply23zu545ca

Optimistic Concurrency Control for Maintaining the Global Integrity Constraint in MDBSs [chapter]

Kyuwoong Lee, Seog Park
1997 Integrity and Internal Control in Information Systems  
Locally consistent transactions may generate global inconsistencies with the existence of global integrity constraints.  ...  constraints.  ...  local applications can be assumed to be satisfied with the local database integrity constraints.  ... 
doi:10.1007/978-0-387-35317-3_7 fatcat:fc7jcsj6kndgvfnyu4ddl6mqde

Detecting Incorrect Behavior of Cloud Databases as an Outsider [article]

Cheng Tan, Changgeng Zhao, Shuai Mu, Michael Walfish
2020 arXiv   pre-print
A core difficulty is that the underlying problem here, namely verifying serializability, is NP-complete.  ...  Cloud DBs offer strong properties, including serializability, sometimes called the gold standard database correctness property.  ...  Specifically we prove that there exists an acyclic graph that is compatible with the constraints constructed by on a given history if and only if the history is serializable.  ... 
arXiv:1912.09018v2 fatcat:3s6ek2zdnvcxjhfxu6hzbadjxm

Overview of multidatabase transaction management

Yuri Breitbart, Hector Garcia-Molina, Avi Silberschatz
2010 CASCON First Decade High Impact Papers on - CASCON '10  
This constraint implies that local DBMSs do not share their control information with each other or with the MDBS system. Participating DBMSs may have different autonomy levels.  ...  The first one deals with transaction operations, while the second one deals with status information.  ...  Finally, the authors gratefully acknowledge the help of Diane Botts with the preparation of this paper.  ... 
doi:10.1145/1925805.1925811 fatcat:innvl5ohx5e5phvyltqpbk2ocu

Overview of multidatabase transaction management

Yuri Breitbart, Hector Garcia-Molina, Avi Silberschatz
1992 The VLDB journal  
This constraint implies that local DBMSs do not share their control information with each other or with the MDBS system. Participating DBMSs may have different autonomy levels.  ...  The first one deals with transaction operations, while the second one deals with status information.  ...  Finally, the authors gratefully acknowledge the help of Diane Botts with the preparation of this paper.  ... 
doi:10.1007/bf01231700 fatcat:2bcf7gkjdna2tlpdfd2fhi57hy

Relaxed Correctness for Firm Real-Time Databases

J. Lindstrom
2006 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)  
In this paper we propose a concurrency control method witch is based on optimistic methods with a extension to relaxed serializability and semantic conflict resolution so that a special purpose concurrency  ...  Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems.  ...  Instead, real-time means the need to manage explicit time constraints in a predictable fashion, that is, to use timecognizant protocols to deal with deadlines or periodicity constraints associated with  ... 
doi:10.1109/rtcsa.2006.55 dblp:conf/rtcsa/Lindstrom06 fatcat:zi5iptckdvaa5jrf5blgtaigma

Page 660 of IEEE Transactions on Computers Vol. 52, Issue 5 [page]

2003 IEEE Transactions on Computers  
This observation provides us with the needed connection between similarity and timing constraint governing data access.  ...  with a real-time system.  ... 

A critique of ANSI SQL isolation levels

Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O'Neil, Patrick O'Neil
1995 SIGMOD record  
Bertino generously provided us with an early draft of their related work [ABJl on reduced isolation levels for multi-valued histories.  ...  Together they form the database invariant constraint predicate, C(DB). The invariant is TRUE if the database state DB is consistent with the constraints and is FALSE otherwi se.  ...  It is possible for an isolation level to be impractical because of disallowing too many serializable histories, but we do not deal with this here.  ... 
doi:10.1145/568271.223785 fatcat:lx22xfb3tzemhise3t7m6cl4o4

A Critique of ANSI SQL Isolation Levels [article]

Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O'Neil, Patrick O'Neil
2007 arXiv   pre-print
Together they form the database invariant constraint predicate, C(DB). The invariant is TRUE if the database state DB is consistent with the constraints and is FALSE otherwise.  ...  Write Skew (A5B) could arise from a constraint at a bank, where account balances are allowed to go negative as long as the sum of commonly held balances remains non-negative, with an anomaly arising as  ... 
arXiv:cs/0701157v1 fatcat:d26fugpwkrdbpaj3622chzb7vm
« Previous Showing results 1 — 15 out of 3,482 results