A DBMS FOR MOBILE TRANSACTIONS USING BI-STATE-TERMINATION

Whenever distributed transaction processing in MANETs or other unreliable networks has to guarantee atomicity and isolation, a major challenge is how long-term blocking of resources can be avoided in case the mobile device looses connection to other participants of the transaction. We present a new technique for treating blocked data of transaction participants that wait for a coordinator’s commit decision. Our technique, Bi-State-Termination (BST), gives participants that have moved during transaction execution the possibility to continue transaction processing before they know the coordinator’s decision on transaction commit. The key idea of our technique is to consider both possible outcomes (commit and abort) of unknown transaction decisions. Within this paper, we describe a fast implementation of the fundamental relational database operations for a DBMS supporting the BST transaction synchronization protocol that avoids longterm transaction blocking.

[1]  Panos K. Chrysanthis,et al.  1-2PC: the one-two phase atomic commit protocol , 2004, SAC '04.

[2]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[3]  Rudolf Bayer,et al.  Parallelism and recovery in database systems , 1980, TODS.

[4]  Theo Härder,et al.  Observations on optimistic concurrency control schemes , 1984, Inf. Syst..

[5]  I-Min A. Chen,et al.  Version Management for Scientific Databases , 1996, EDBT.

[6]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[7]  Stefan Böttcher,et al.  Constraint Checking for Non-blocking Transaction Processing in Mobile Ad-hoc Networks , 2010, ICEIS.

[8]  Gottfried Vossen,et al.  Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery , 2002 .

[9]  Wojciech Cellary,et al.  Consistency of Versions in Object-Oriented Databases , 1990, Building an Object-Oriented Database System, The Story of O2.

[10]  Randy H. Katz,et al.  Toward a unified framework for version modeling in engineering databases , 1990, CSUR.

[11]  Marc H. Scholl,et al.  Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery , 2001, SGMD.

[12]  Masaru Kitsuregawa,et al.  Speculative locking protocols to improve performance for distributed database systems , 2004, IEEE Transactions on Knowledge and Data Engineering.

[13]  Rachid Guerraoui,et al.  One-phase commit: does it make sense? , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

[14]  Philip A. Bernstein,et al.  Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[15]  Michael Stonebraker,et al.  Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

[16]  Wojciech Cellary,et al.  Consistency of versions in objects-oriented databases , 1990, VLDB 1990.

[17]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[18]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[19]  Vijay Kumar,et al.  TCOT-A Timeout-Based Mobile Transaction Commitment Protocol , 2002, IEEE Trans. Computers.

[20]  Bharat K. Bhargava,et al.  Multidimensional Timestamp Protocols for Concurrency Control , 1986, IEEE Transactions on Software Engineering.

[21]  Stefan Böttcher,et al.  Avoiding Infinite Blocking of Mobile Transactions , 2007, 11th International Database Engineering and Applications Symposium (IDEAS 2007).

[22]  Thki Hder,et al.  OBSERVATIONS ON OPTIMISTIC CONCURRENCY CONTROL SCHEMES , 2003 .

[23]  Leslie Lamport,et al.  Consensus on transaction commit , 2004, TODS.

[24]  Dale Skeen,et al.  Nonblocking commit protocols , 1981, SIGMOD '81.

[25]  Masaru Kitsuregawa,et al.  Reducing the blocking in two-phase commit with backup sites , 2003, Inf. Process. Lett..