Filters








13 Hits in 3.5 sec

Serializable isolation for snapshot databases

Michael J. Cahill, Uwe Röhm, Alan D. Fekete
2009 ACM Transactions on Database Systems  
Until now, the only way to prevent these anomalies was to modify the applications by introducing artificial locking or update conflicts, following careful analysis of conflicts between all pairs of transactions  ...  This paper describes a modification to the concurrency control algorithm of a database management system that automatically detects and prevents snapshot isolation anomalies at runtime for arbitrary applications  ...  Making SI serializable using static analysis has a number of limitations.  ... 
doi:10.1145/1620585.1620587 fatcat:klgirkf3zncs7bs4zbyd4fjom4

Serializable isolation for snapshot databases

Michael J. Cahill, Uwe Röhm, Alan D. Fekete
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
Until now, the only way to prevent these anomalies was to modify the applications by introducing artificial locking or update conflicts, following careful analysis of conflicts between all pairs of transactions  ...  This paper describes a modification to the concurrency control algorithm of a database management system that automatically detects and prevents snapshot isolation anomalies at runtime for arbitrary applications  ...  Making SI serializable using static analysis has a number of limitations.  ... 
doi:10.1145/1376616.1376690 dblp:conf/sigmod/CahillRF08 fatcat:difq2wkgnzeohkipjknymplhu4

Semantic locking in object-oriented database systems

Rodolfo F. Resende, Divyakant Agrawal, Amr El Abbadi
1994 SIGPLAN notices  
A semantic locking protocol is presented for transaction management for such object-oriented databases.  ...  In particular, the protocol incorporates the semantics of complex objects, nested executions and dynamic conflicts resulting from referentially shared objects.  ...  Such a conflict cannot be determined a priori based on the static analysis N2PL captures these conflicts using lock inheritance, however, it fails to take advantage of any object semantics.  ... 
doi:10.1145/191081.191144 fatcat:yaotvecewjcl3czxtwy2dcxnr4

Semantic locking in object-oriented database systems

Rodolfo F. Resende, Divyakant Agrawal, Amr El Abbadi
1994 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications - OOPSLA '94  
A semantic locking protocol is presented for transaction management for such object-oriented databases.  ...  In particular, the protocol incorporates the semantics of complex objects, nested executions and dynamic conflicts resulting from referentially shared objects.  ...  Such a conflict cannot be determined a priori based on the static analysis N2PL captures these conflicts using lock inheritance, however, it fails to take advantage of any object semantics.  ... 
doi:10.1145/191080.191144 dblp:conf/oopsla/ResendeAA94 fatcat:zidwnttr7bhojltzjw6s7krk3a

Using data structure knowledge for efficient lock generation and strong atomicity

Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
of programmer-specified fine-grained locks for the SPECjbb2000 benchmark, which has traditionally not been amenable to static analyses.  ...  Further, the new analysis allows for software support of strong atomicity with less than 1% overhead for two benchmarks and less than 20% for three others.The strategy also nearly matches the performance  ...  The STAMP benchmarks were designed for transactional memory systems, but have also become popular as a benchmarking tool for conservative concurrency control.  ... 
doi:10.1145/1693453.1693490 dblp:conf/ppopp/UpadhyayaMP10 fatcat:aw7upvygefcdbg7qxknm45nokm

Using data structure knowledge for efficient lock generation and strong atomicity

Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
2010 SIGPLAN notices  
of programmer-specified fine-grained locks for the SPECjbb2000 benchmark, which has traditionally not been amenable to static analyses.  ...  Further, the new analysis allows for software support of strong atomicity with less than 1% overhead for two benchmarks and less than 20% for three others.The strategy also nearly matches the performance  ...  The STAMP benchmarks were designed for transactional memory systems, but have also become popular as a benchmarking tool for conservative concurrency control.  ... 
doi:10.1145/1837853.1693490 fatcat:dkjh75pklve7hor7jxnbnp7xwi

Serializable Snapshot Isolation in PostgreSQL [article]

Dan R. K. Ports, Kevin Grittner
2012 arXiv   pre-print
We also introduce an extension to SSI that improves performance for read-only transactions.  ...  We reflect on our experience and describe how we overcame some of the resulting challenges, including the implementation of a new lock manager, a technique for ensuring memory usage is bounded, and integration  ...  Static analysis, lacking knowledge of these transactions, cannot prevent anomalies involving them.  ... 
arXiv:1208.4179v1 fatcat:mcfwtescfvfyzg7fp4ussw3b7e

Serializable snapshot isolation in PostgreSQL

Dan R. K. Ports, Kevin Grittner
2012 Proceedings of the VLDB Endowment  
We also introduce an extension to SSI that improves performance for read-only transactions.  ...  We reflect on our experience and describe how we overcame some of the resulting challenges, including the implementation of a new lock manager, a technique for ensuring memory usage is bounded, and integration  ...  Static analysis, lacking knowledge of these transactions, cannot prevent anomalies involving them.  ... 
doi:10.14778/2367502.2367523 fatcat:elgxokqbxraq7cj4ee7wzposrq

A Self-Adjusting Multi-granularity Locking protocol for Object-Oriented Databases

Deepa Saha, Joan Morrissey
2009 2009 Second International Conference on the Applications of Digital Information and Web Technologies  
This is to ensure that a transaction that already holds some locks will not block other transactions' waiting for other locks. Conservative two-phase locking can prevent deadlocks.  ...  Another modification of two-phase locking is conservative two phase locking where transactions obtain all the locks they need before the transactions begin.  ...  Therefore, for Typel databases the instance locking protocol will be the best choice for concurrency control and the class locking protocol will be the worst choice.  ... 
doi:10.1109/icadiwt.2009.5273914 fatcat:yoa2af7fqrbdpbm5bvjv7xshqm

Deadlock detection in distributed databases

Edgar Knapp
1987 ACM Computing Surveys  
The point is made that correctness proofs for such algorithms using operational arguments are cumbersome and error prone and, therefore, that only completely formal proofs are sufficient for demonstrating  ...  A number of algorithms are discussed in detail, and their complexity in terms of the number of messages employed is compared.  ...  The work was partially supported by Office of Naval Research contract N00014-86-K-0182.  ... 
doi:10.1145/45075.46163 fatcat:jhbyf4kxibbuxjrcb7eow23pgi

Zephyr

Aaron J. Elmore, Sudipto Das, Divyakant Agrawal, Amr El Abbadi
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
Multitenant data infrastructures for large cloud platforms hosting hundreds of thousands of applications face the challenge of serving applications characterized by small data footprint and unpredictable  ...  Zephyr uses phases of ondemand pull and asynchronous push of data, requires minimal synchronization, results no service unavailability and few or no aborted transactions, minimizes the data transfer overhead  ...  Acknowledgments The authors would like to thank Shoji Nishimura, the anonymous reviewers, and our anonymous shepherd for providing useful feedback to improve this paper.  ... 
doi:10.1145/1989323.1989356 dblp:conf/sigmod/ElmoreDAA11 fatcat:zobs6nwru5gjdpa25erovm3ruq

The CORDS multidatabase project

G. K. Attaluri, D. P. Bradshaw, N. Coburn, P. A. Larson, P. Martin, A. Silberschatz, J. Slonim, Q. Zhu
1995 IBM Systems Journal  
distributed) transaction management, and interactions with component data sources.  ...  The complexity of the application program depends on the level of support provided for connectivity and data integration.  ...  We would also like to thank Ann Gawman of the IBM Toronto Laboratory for her excellent editorial suggestions.  ... 
doi:10.1147/sj.341.0039 fatcat:qwbj6vx4zfbt5ogd2hdxzngt3m

Lock Inference for Java

Khilan Gudka, Susan Eisenbach, Microsoft Research
2013
This thesis explores the technique of lock inference, which infers a set of locks for each atomic section, while attempting to balance the requirements of maximal concurrency, minimal locking overhead  ...  We focus on lock-inference techniques for tackling large Java programs that make use of mature libraries.  ...  For example, the character-set loading code that is executed when a string is printed (see the "Hello World" example in Section 1.6) for the first The conservativeness of static analysis is a universal  ... 
doi:10.25560/10945 fatcat:uokbmuq2yfetnkif5puiweaemi