A progressive reprocessing transaction model for updating spatial data in mobile computing environments

被引:0
|
作者
Kim, D
Hong, B
机构
[1] Dongseo Univ, Grad Sch Software, Pusan 617716, South Korea
[2] Pusan Natl Univ, Dept Comp Engn, Pusan 609735, South Korea
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile transactions for updating spatial data are long-lived transactions that update local copies of the mobile platforms on disconnection. Since a mobile transaction is physically separated from its global transaction, the concurrent updates of mobile transactions should be merged into the global database after committing, Validation-based schemes, which are well-known to be appropriate for mobile transactions, have the overhead of aborting long duration transactions that conflict with some transactions. It is definitely unacceptable to cancel all the updates of a long-lived transaction due to conflicts with just a few objects. This paper introduces a novel reprocessing-transaction model that handles update conflicts between mobile transactions without aborting. Instead of aborting mobile transactions that conflict with committed transactions, the proposed model executes a new subtransaction called a reprocessing transaction, which reexecutes exactly the conflicted operations on conflicted objects with foreign conflicted objects. Foreign conflicted objects are part of the data committed by the other concurrent transactions and are related to the conflicted objects, We also propose a progressive reprocessing scheme to allow the non-conflicted objects of a mobile transaction to be incrementally exposed to other concurrent transactions in order to reduce the starvation of reprocessing transactions. Our reprocessing transaction model has the benefit of being able to serialize mobile transactions without aborting or waiting.
引用
收藏
页码:64 / 80
页数:17
相关论文
共 50 条
  • [1] Validation-based reprocessing scheme for updating spatial data in mobile computing environments
    Kim, DH
    Hong, BH
    Yu, BG
    Hong, ES
    AINA 2003: 17TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, 2003, : 211 - 214
  • [2] A Transaction Model to Improve Data Availability in Mobile Computing
    Sanjay Kumar Madria
    Bharat Bhargava
    Distributed and Parallel Databases, 2001, 10 : 127 - 160
  • [3] A transaction model to improve data availability in mobile computing
    Madria, SK
    Bhargava, B
    DISTRIBUTED AND PARALLEL DATABASES, 2001, 10 (02) : 127 - 160
  • [4] Transaction model for mobile computing
    Madria, SK
    Bhargava, B
    IDEAS 98 - INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 1998, : 92 - 102
  • [5] Broadcast transaction scheduling in mobile computing environments
    Wu, S
    Lee, VCS
    Lam, KW
    MDM 2002: THIRD INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, PROCEEDINGS, 2002, : 161 - 162
  • [6] A new transaction management scheme for mobile computing environments
    Ahmed, KM
    Ismail, MA
    El-Makky, NM
    Nagi, KM
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 10TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 1997, : 102 - 109
  • [7] A multi-version transaction model to improve data availability in mobile computing
    Madria, SK
    Baseer, M
    Bhowmick, SS
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2002: COOPLS, DOA, AND ODBASE, 2002, 2519 : 322 - 338
  • [8] Efficient transaction processing in mobile data broadcast environments
    Lee, SK
    Kim, SS
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2004, 2973 : 750 - 761
  • [9] Incorporating transaction semantics to reduce reprocessing overhead in replicated mobile data applications
    Liu, P
    Ammann, P
    Jajodia, S
    19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1999, : 414 - 423
  • [10] Incorporating transaction semantics to reduce reprocessing overhead in replicated mobile data applications
    Liu, Peng
    Ammann, Paul
    Jajodia, Sushil
    Proceedings - International Conference on Distributed Computing Systems, 1999, : 414 - 423