688 Hits in 2.5 sec

Serializability theory for replicated databases

Philip A. Bernstein, Nathan Goodman
1985 Journal of computer and system sciences (Print)  
This paper presents a theory for proving the correctness of algorithms that manage replicated data. The theory is an extension of serializability theory.  ...  In a one-copy distributed database, each data item is stored at exactly one site of a distributed system. In a replicated database, some data items are stored at multiple sites.  ...  Section 2 reviews serializability theory for one-copy databases. Section 3 generalizes the theory to replicated databases.  ... 
doi:10.1016/0022-0000(85)90058-3 fatcat:rol32sjzajhktcn4rn4k3rskue

Correctness Criteria Beyond Serializability [chapter]

Mourad Ouzzani, Brahim Medjahed, Ahmed K. Elmagarmid
2017 Encyclopedia of Database Systems  
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.  ...  SYNONYMS Concurrency Control; Preserving Database Consistency DEFINITION A transaction is a logical unit of work that includes one or more database access operations such as insertion, deletion, modification  ...  Simply put, serializability theory is a mathematical model for proving whether or not a concurrent execution of transactions is correct.  ... 
doi:10.1007/978-1-4899-7993-3_722-2 fatcat:i2tard3nzzgc3lboathksmrl2u

Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase

Weimin Du, Ahmed K. Elmagarmid
1989 Very Large Data Bases Conference  
We also use quasi serializability theory to give a correctness proof for an altruistic locking algorithm.  ...  In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments.  ...  In this section, we apply our quasi serializability theory to an altruistic locking algorithm [AGS87].  ... 
dblp:conf/vldb/DuE89 fatcat:yt5envwl3bg25ashhg7mazheja

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  
Simply put, serializability theory is a mathematical model for proving whether or not a concurrent execution of transactions is correct.  ...  Distributed databases with replicated or interdependent data.  ... 
doi:10.1007/978-0-387-39940-9_722 fatcat:mavufce4vffsximppekwjoir6a

The failure and recovery problem for replicated databases

Philip A. Bernstein, Nathan Goodman
1983 Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83  
This paper presents a theory for proving the correctness of algorithms that manage replicated data. The theory is an extension of serializabi-lity theory. We apply it to three replicated  ...  A replicated database is a distributed database in which some data items are stored redundantly at multiple sites. The main goal is to improve system reliability.  ...  SERIALIZABILITY THEORY FOR REPLICATED DATABASES Replicated Data Logs In a replicated database, each data item x has one or more copies, Xa,Xb,..., at different sites.  ... 
doi:10.1145/800221.806714 dblp:conf/podc/BernsteinG83 fatcat:hgkfy6ug2zgd3k5jixxq2twrsq

Concurrency control in trusted database management systems

Bhavani Thuraisingham, Hai-Ping Ko
1993 SIGMOD record  
Recently several algorithms have been proposed for concurrency control in a Trusted Database Management System (TDBMS).  ...  The various research efforts are examining the concurrency control algorithms developed for DBMSs and adapting them for a multilevel environment.  ...  theory of database concurrency control.  ... 
doi:10.1145/166635.166654 fatcat:szofbcwpw5cxzgyf7tepkxb2iq

Performance evaluation of conflict serializability against 2PL in Homogenous Distributed Database

Harpreet Kaur, Mritunjay Kumar, Gulshan Kumar
To achieve the serializability among the transactions in the distributed database Conflict serializability model is used that will provide serial execution of the transactions with in conflict actions  ...  These techniques are efficient and provide fast transactional operations and serializable execution of the transactions.  ...  It has provided me an opportunity in learning new concepts, terminologies, and theories and expanding my academic knowledge beyond my classroom learning.  ... 
doi:10.24297/ijct.v7i1.3481 fatcat:2atdawyjffhxbldurbu55pys4y

Page 164 of Distributed Computing Vol. 4, Issue 4 [page]

1991 Distributed Computing  
Imagine, for instance, a fully replicated database  ...  One-copy serializability is an exten¬ sion of the serializability theory on centralized databases introduced by Eswaran et al. [8], Most systems achieve one-copy serializability by run¬ ning two distributed  ... 

Technical note: Replication graphs revisited

Jon Grov, Ragnar Normann
2006 Journal of computer and system sciences (Print)  
System Sci. 59 (1) (1999) 29-69] presents replication graphs as an efficient means to handle concurrency control in replicated databases.  ...  Korth, Replication and consistency in a distributed environment, J. Comput. System Sci. 59 (1) (1999) 29-69] does not always guarantee serializability if combined with two-phase locking.  ...  Acknowledgments The authors thank the anonymous referee for very constructive and readable feedback.  ... 
doi:10.1016/j.jcss.2006.02.004 fatcat:o5yinmgm55f6vin4cblrx2ui4u

The Logical Timestamp Skew Anomaly in Event-Replicated Transaction Schedulers

Emil Koutanov
2021 IEEE Access  
The primary process and the primary database reside in the primary site. The replicator process, the replica database and the viewer process reside in the replica site.  ...  Updates are delivered on the replicator process, which serially installs them to the replica database in their broadcast order.  ...  and global serializability [11] , [14] , [15] , [18] , [19] . We now reveal this to be also false in event-replicated schedulers.  ... 
doi:10.1109/access.2021.3107506 fatcat:nnatlfcjfzfr5h4pawy7ghqvrm

Buddy System: Available, Consistent, Durable Web Service Transactions

Aspen Olmsted, Csilla Farkas
2013 Journal of Internet Technology and Secured Transaction  
In these transactions each activity is a low level database operation.  ...  In this paper we investigate the problem of providing consistency, availability and durability for web service transactions.  ...  The CAP theory [1, 2] , stating that distributed database designers can achieve at most two of the properties: consistency (C), availability (A), and partition tolerance (P) has influenced distributed  ... 
doi:10.20533/jitst.2046.3723.2013.0018 fatcat:jpjbx4vu3jhlbg65265tcwjcna

Page 2088 of Mathematical Reviews Vol. , Issue 88d [page]

1988 Mathematical Reviews  
This paper presents a theory for proving the correctness of algorithms that manage replicated data. The theory is an extension of serializability theory.  ...  {For the entire collection see MR 87j:68003.} Vijay V. Raghavan (Lafayette, La.) 88d:68010 68P15 Bernstein, Philip A.; Goodman, Nathan Serializability theory for replicated databases. J. Comput.  ... 

Epidemic algorithms in replicated databases (extended abstract)

D. Agrawal, A. El Abbadi, R. C. Steinke
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
Introduction We present a family of epidemic algorithms for maintaining replicated data in a transactional framework.  ...  A Theory of Reliability in Database Systems.  ...  @GK96] have recently proposed an epidemic algorithm for transaction management in replicated databases.  ... 
doi:10.1145/263661.263680 dblp:conf/pods/AgrawalAS97 fatcat:zciqii3e4bd2bclrpaa4smrnqy

Caching and Replication in Mobile Data Management

Evaggelia Pitoura, Panos K. Chrysanthis
2007 IEEE Data Engineering Bulletin  
In this article, we focus on how caching and replication in mobile data management address these challenges.  ...  Mobile data management has been an active area of research for the past fifteen years.  ...  A general theory of correctness for broadcast databases as well as the fundamental properties underlying the techniques for enforcing it are given in [21] .  ... 
dblp:journals/debu/PitouraC07 fatcat:keddq6yc2bhtdozysw64klyyba

Relaxed-currency serializability for middle-tier caching and replication

Philip A. Bernstein, Alan Fekete, Hongfei Guo, Raghu Ramakrishnan, Pradeep Tamma
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
We outline a serializability-theoretic correctness proof and present the results of a detailed performance study.  ...  Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance.  ...  By contrast, the well-known correctness definition for multiversion and replicated databases is one-copy serializability, which uses a one-copy single-version database as the ideal system.  ... 
doi:10.1145/1142473.1142540 dblp:conf/sigmod/BernsteinFGRT06 fatcat:azwmlwu6yzdt7a5bowerkg6pse
« Previous Showing results 1 — 15 out of 688 results