Relevant bibliographies by topics / Optimistic concurrency control

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Optimistic concurrency control'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Optimistic concurrency control.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Optimistic concurrency control"

1

Lee, Juhnyoung. "Precise serialization for optimistic concurrency control." Data & Knowledge Engineering 29, no. 2 (1999): 163–78. http://dx.doi.org/10.1016/s0169-023x(98)00033-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bernstein, Philip A., Colin W. Reid, Ming Wu, and Xinhao Yuan. "Optimistic concurrency control by melding trees." Proceedings of the VLDB Endowment 4, no. 11 (2011): 944–55. http://dx.doi.org/10.14778/3402707.3402732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Thomasian, A. "Checkpointing for optimistic concurrency control methods." IEEE Transactions on Knowledge and Data Engineering 7, no. 2 (1995): 332–39. http://dx.doi.org/10.1109/69.382303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Jinwei, Peng Cai, Jiahao Wang, Weining Qian, and Aoying Zhou. "Adaptive optimistic concurrency control for heterogeneous workloads." Proceedings of the VLDB Endowment 12, no. 5 (2019): 584–96. http://dx.doi.org/10.14778/3303753.3303763.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Herlihy, Maurice. "Optimistic concurrency control for abstract data types." ACM SIGOPS Operating Systems Review 21, no. 2 (1987): 33–44. http://dx.doi.org/10.1145/24601.24604.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agrawal, Divyakant, Arthur J. Bernstein, Pankaj Gupta, and Soumitra Sengupta. "Distributed optimistic concurrency control with reduced rollback." Distributed Computing 2, no. 1 (1987): 45–59. http://dx.doi.org/10.1007/bf01786254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lam, Kwok-wa, Kam-yiu Lam, and Sheung-lun Hung. "Optimistic concurrency control protocol for real-time databases." Journal of Systems and Software 38, no. 2 (1997): 119–31. http://dx.doi.org/10.1016/s0164-1212(96)00115-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Adya, Atul, Robert Gruber, Barbara Liskov, and Umesh Maheshwari. "Efficient optimistic concurrency control using loosely synchronized clocks." ACM SIGMOD Record 24, no. 2 (1995): 23–34. http://dx.doi.org/10.1145/568271.223787.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shan, Weifeng, and Husheng Liao. "FOCCX: An Optimistic Concurrency Control Protocol over XML." International Journal of Database Theory and Application 8, no. 2 (2015): 215–22. http://dx.doi.org/10.14257/ijdta.2015.8.2.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xiaohui Song and J. W. S. Liu. "Maintaining temporal consistency: pessimistic vs. optimistic concurrency control." IEEE Transactions on Knowledge and Data Engineering 7, no. 5 (1995): 786–96. http://dx.doi.org/10.1109/69.469820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Optimistic concurrency control"

1

Zheng, Qifang 1975. "Optimistic concurrency control in McXML." Thesis, McGill University, 2003. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80906.

Full text
Abstract:
In this thesis, we propose an optimistic concurrency control mechanism for XML database systems. Using concurrency control, multiple users can access a single XML document at the same time. Our mechanism uses the XML DOM data model which presents XML-based documents as trees. We take the ancestor/descendant relationship between nodes of such trees into account. We integrated our mechanism into the McXML native XML database system and evaluated its performance.
APA, Harvard, Vancouver, ISO, and other styles
2

Ling, Hon-Lai. "Applying optimistic concurrency control over the Web." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39679.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Thakur, Kishore Kumar Singh. "Implementation of a strict optimistic concurrency control protocol /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1674095421&sid=6&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text
Abstract:
Thesis (M.S.)--Southern Illinois University Carbondale, 2008.<br>"Department of Computer Science." Keywords: Database, Optimistic concurrency control, Simulation model. Includes bibliographical references (p. 29-30). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
4

THAKUR, KISHOREKUMAR SINGH. "IMPLEMENTATION OF A STRICT OPTIMISTIC CONCURRENCY CONTROL PROTOCOL." OpenSIUC, 2008. https://opensiuc.lib.siu.edu/theses/435.

Full text
Abstract:
In today's database management systems (DBMS), concurrency control is one of the main issues that draw a lot of attention. Concurrency control protocols prevent changes to the database made by one user to interfere with those made by another user. During last couple of decades, many new concurrency control mechanisms were introduced into the study of database management systems. Researchers have designed new concurrency control algorithms and examined their performances in comparison with well known concurrency control mechanisms, which are widely used in today's database management systems. The results reported to date, rather than being definitive, have tended to be quite contradictory [1]. The main cause of such findings is use of different assumptions and implications when defining a simulation model for database management systems. Different coding schemes and logical programmatic flows play another important role in obtaining questionable results. In this paper, rather than proposing yet another concurrency control algorithm, I will implement a standardized simulation model within windows application that can then be used by any researcher to test performance of his concurrency control protocol. I will implement Optimistic Concurrency control protocol to validate functionality of my application and compare it with two phase locking protocol.
APA, Harvard, Vancouver, ISO, and other styles
5

Lindström, Jan. "Optimistic concurrency control methods for real-time database systems." Helsinki : University of Helsinki, 2003. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/lindstrom/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Adya, Atul. "Transaction management for mobile objects using optimistic concurrency control." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/37709.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Park, Myoung Jin. "An optimistic concurrency control mechanism based on clock synchronization." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/982.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xiong, Weidong. "A FAMILY OF HIERARCHICAL CONCURRENCY CONTROL PROTOCOLS." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1604.

Full text
Abstract:
In this thesis, we propose a family of concurrency control protocols for high data contention database environments. The first one is called the Prudent-Precedence Concurrency Control (PPCC) protocol. It is prudently more aggressive in permitting more serializable schedules than two-phase locking and maintains a restricted precedence among conflicting transactions and commits the transactions according to the serialization order established in the executions. The second one is a family of hierarchical concurrency control protocols called the Hierarchical Precedence Concurrency Control (HPCC) protocols. It maintains cycle-free precedence hierarchies for conflicting transactions. Conflicting operations are allowed to proceed only if the hierarchical orderings of precedence is not violated. Transactions also commit based on the serialization order established during the executions. Detailed simulation models have been implemented for all these protocols and extensive experiments have been conducted to evaluate the performance of the proposed approaches. The results demonstrate that the proposed algorithms outperform the two-phase locking and optimistic concurrency control over a wide range of system workloads.
APA, Harvard, Vancouver, ISO, and other styles
9

WU, CUN-YING, and 吳春穎. "Performance evaluation of optimistic concurrency control algorithms for distributed database systems." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/20266497281963799077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Masson, Constantin. "Framework for Real-time collaboration on extensive Data Types using Strong Eventual Consistency." Thèse, 2018. http://hdl.handle.net/1866/22532.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Optimistic concurrency control"

1

Jalal, Anand S., S. Tanwani, and A. K. Ramani. "Optimistic Concurrency Control in Firm Real-Time Databases." In Distributed Computing – IWDC 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11603771_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Breitbart, Yuri, Henry F. Korth, and Avi Silberschatz. "An Optimistic Concurrency Control Protocol for Replicated Databases." In Fundamental Problems in Computing. Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-1-4020-9688-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lam, Kwokwa, Kamyiu Lam, and Sheunglun Hung. "An Efficient Real-Time Optimistic Concurrency Control Protocol." In Workshops in Computing. Springer London, 1996. http://dx.doi.org/10.1007/978-1-4471-3080-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

O’Reilly, Ciaran, Philip Morrow, and David Bustard. "Improving Conflict Detection in Optimistic Concurrency Control Models." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-39195-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Graham, Peter, and Ken Barker. "Effective optimistic concurrency control in multiversion object bases." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0014033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Solamain, Kamal, Matthew Brook, Gary Ushaw, and Graham Morgan. "Optimistic Concurrency Control for Energy Efficiency in the Wireless Environment." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03859-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Choi, Ho-Jin, and Byeong-Soo Jeong. "A Timestamp-Based Optimistic Concurrency Control for Handling Mobile Transactions." In Computational Science and Its Applications - ICCSA 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11751588_83.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Ukhyun, and Buhyun Hwang. "Optimistic Concurrency Control Based on Timestamp Interval for Broadcast Environment." In Advances in Databases and Information Systems. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45710-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jeong, Byeong-Soo, Daeho Kim, and Sungyoung Lee. "Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45245-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ramesh, Dharavath, Harshit Gupta, Kuljeet Singh, and Chiranjeev Kumar. "Hash Based Incremental Optimistic Concurrency Control Algorithm in Distributed Databases." In Intelligent Distributed Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-11227-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Optimistic concurrency control"

1

Kabir Mamun, Quazi, and Hidenori Nakazato. "Timestamp Based Optimistic Concurrency Control." In TENCON 2005 - 2005 IEEE Region 10 Conference. IEEE, 2005. http://dx.doi.org/10.1109/tencon.2005.300909.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Haritsa, J. R., M. J. Carey, and M. Livny. "Dynamic real-time optimistic concurrency control." In [1990] Proceedings 11th Real-Time Systems Symposium. IEEE, 1990. http://dx.doi.org/10.1109/real.1990.128734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jepsen, Theo, Leandro Pacheco de Sousa, Masoud Moshref, Fernando Pedone, and Robert Soulé. "Infinite Resources for Optimistic Concurrency Control." In SIGCOMM '18: ACM SIGCOMM 2018 Conference. ACM, 2018. http://dx.doi.org/10.1145/3229591.3229597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Weihan, and Cristiana Amza. "On Optimal Concurrency Control for Optimistic Replication." In 2009 29th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, 2009. http://dx.doi.org/10.1109/icdcs.2009.71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Laux, Fritz, and Martti Laiho. "SQL Access Patterns for Optimistic Concurrency Control." In 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns (COMPUTATIONWORLD). IEEE, 2009. http://dx.doi.org/10.1109/computationworld.2009.63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Herlihy, Maurice. "Optimistic concurrency control for abstract data types." In the fifth annual ACM symposium. ACM Press, 1986. http://dx.doi.org/10.1145/10590.10608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Soysal, Onur, Bahadir Ismail Aydin, and Murat Demirbas. "Optimistic Concurrency Control for multihop sensor networks." In 2011 7th International Wireless Communications and Mobile Computing Conference (IWCMC 2011). IEEE, 2011. http://dx.doi.org/10.1109/iwcmc.2011.5982512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shan, Weifeng, and Husheng Liao. "XML Optimistic Concurrency Control Protocol for DOM API." In 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP). IEEE, 2014. http://dx.doi.org/10.1109/paap.2014.53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berrabah, Djamel, Stéphane Gançarski, Sarah Kaddour Chikh, and Cécile Le Pape. "Optimistic path-based concurrency control over XML documents." In the 5th international conference. ACM Press, 2008. http://dx.doi.org/10.1145/1456223.1456303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Adya, Atul, Robert Gruber, Barbara Liskov, and Umesh Maheshwari. "Efficient optimistic concurrency control using loosely synchronized clocks." In the 1995 ACM SIGMOD international conference. ACM Press, 1995. http://dx.doi.org/10.1145/223784.223787.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Optimistic concurrency control' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography