Skip to main content
SpringerLink
Log in

Optimistic Scheduling Algorithm for Mobile Transactions based on Reordering

  • Conference paper
  • First Online:
Mobile Data Management (MDM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1987))

Included in the following conference series:

Abstract

In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik.: Broadcast Disks: Data Management for Asymmetric Communications Environments. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 199–210, 1995. 105, 113, 117

    Google Scholar 

  2. S. Acharya, M. Franklin, and S. Zdonik.: Disseminating Updates on Broadcast Disks. Proceedings of 22nd International conference on Very Large DataBases, 1996. 112

    Google Scholar 

  3. D. Barbara.: Certification Reports: Supporting Transactions in Wireless Systems. Proceedings of the 17th IEEE International Conference on Distributed Computing Systems, pp. 466–473, 1997.

    Google Scholar 

  4. P. A. Bernstein, V. Hadzilacos, and N. Goodman.: Concurrency Control and Recovery in Database Systems. Addison Wesley, Reading, Massachusetts, 1987. 108

    Google Scholar 

  5. D. Barbara and T. Imielinski.: Sleepers andWorkaholics: Caching Strategies in Mobile Environments. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 1–12, 1994.

    Google Scholar 

  6. M.H. Dunham and A. Helal.: Mobile Computing and Databases: Anything New? ACM SIGMOD Record, Vol. 24, No. 4, pp. 5–9, 1995.

    Article  Google Scholar 

  7. Q. Hu, W-C. Lee and D.L. Lee.: Indexing Techniques for Wireless Data Broadcast under Data Clustering and Scheduling. Proceedings of International Conference on Information and Knowledge Management, pp. 351–358, 1999.

    Google Scholar 

  8. P. Lie, P. Ammann and S. Jahodia.: Incorporating Transactions Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Application Proceedings of the International Conference on Distributed Computing Systems, pp. 414–423, 1999.

    Google Scholar 

  9. Y. Lee and S. Moon.: Commit-Reordering Validation Scheme for Transaction Scheduling in Client-Server Based Teleputing Systems: COREV. Proceedings of the International Conference on Information and Knowledge Management, pp. 59–66. 1997.

    Google Scholar 

  10. S.H. Phatak and B.R. Badrinath.: Conflict Resolution and Reconciliation in Disconnected Databases 10th International Workshop on Database and Expert Systems Applications, pp. 1–6, 1999.

    Google Scholar 

  11. E. Pitoura and P. Chrysanthis.: Exploiting Versions for Handling Updates inBroadcast Disks. Proceedings of the International Conference on Very Large Data Bases, pp. 114–125, 1999. 106, 115

    Google Scholar 

  12. E. Pitoura and P. Chrysanthis.: Scalable Processing of Read-Only Transactions in Broadcast Push. Proceedings of the 19th IEEE International Conference on Distributed Computing system, pp. 432–441, 1999. 106, 114, 115

    Google Scholar 

  13. J. Shanmugasundaram, A. Nithrakashyap, R. Sivasankaran, and K. Ramamritham.: Efficient Concurrency Control for Broadcast Environments Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 85–96, 1999. 106

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, Korea University, 5-1, Anam-dong, Seongbuk-Ku, 136-701, Seoul, Korea

    SungSuk Kim & Chong-Sun Hwang

  2. Dept. of Computer Science Education, Korea University, Korea

    HeonChang Yu

  3. Institute of Industrial Science, The University of Tokyo, Japan

    SangKeun Lee

Authors
  1. SungSuk Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chong-Sun Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. HeonChang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. SangKeun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, School of Computing, 3 Science Drive 2, 117543, Singapore

    Kian-Lee Tan

  2. Computer Science Division, University of California at Berkeley EECS, 387 Soda Hall 1776, 94720-1776, Berkeley, CA, USA

    Michael J. Franklin

  3. Department of Computer Science and Engineering Shatin, The Chinese University of Hong Kong, N.T.,Hong Kong, China

    John Chi-Shing Lui

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S., Hwang, CS., Yu, H., Lee, S. (2001). Optimistic Scheduling Algorithm for Mobile Transactions based on Reordering. In: Tan, KL., Franklin, M.J., Lui, J.CS. (eds) Mobile Data Management. MDM 2001. Lecture Notes in Computer Science, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44498-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44498-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41454-4

  • Online ISBN: 978-3-540-44498-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation