A Semantic-Serializability Based Fully-Distributed Concurrency Control Mechanism for Mobile Multi-Database Systems

Brayner, Ângelo; Alencar, F.S.

doi:10.1109/dexa.2005.31

Cited by 15 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For that reason, a correctness criterion, denoted Semantic Serializability (S e S), was introduced into the ITS for synchronizing transactions in mobile database environments. Since Semantic Serializability is more permissive than classical syntactical serializability, it provides a higher degree of inter-transaction parallelism of mobile transactions by relaxing the atomicity property [5,6].…”

Section: Its Implementing Semantic Serializabilitymentioning

confidence: 99%

“…SESAMO [5] is a concurrency control mechanism based on semantic serializability [4]. According to SESAMO mechanism, the mobile transaction concurrency control is distributed among several independent mobile multidatabase transaction schedulers (called MOTSs), each one producing an independent schedule called Partial Global Semantically Serializable Schedule (PGS3).…”

Section: Conflicting Operation Ratementioning

confidence: 99%

“…A global schedule S (Definition 10) represents the execution of all operations of the mobile and local transactions in the MDBC [5,6]. Since each mobile unit is autonomous on the execution of the local and mobile transactions, another component is necessary to guarantee the correct global schedule.…”

Section: Implementation Issuesmentioning

confidence: 99%

See 2 more Smart Citations

A self-adaptable scheduler for synchronizing transactions in dynamically configurable environments

Holanda

Brayner

Fialho

2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

Section: Its Implementing Semantic Serializabilitymentioning

confidence: 99%

Section: Conflicting Operation Ratementioning

confidence: 99%

See 1 more Smart Citation

A self-adaptable scheduler for synchronizing transactions in dynamically configurable environments

Holanda

Brayner

Fialho

2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…In VLock, local sites use the strict 2PL for serializability. [4] introduced Semantic Serializability Applied to Mobility (SESAMO) for MANET databases. SESAMO is based on semantic serializability and the global serializability is automatically guaranteed if each site maintains its own serializability by applying strict 2PL.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, although global transactions (or called remote queries in [8]) do exist, it is unnecessary to maintain the global serializability among peers, which is required in traditional distributed databases and mobile databases [3,4,6,7]. But, every peer must guarantee the correctness of transactions that it processes locally because it may collect or update its own data, reply requests and update replica simultaneously.…”

Section: Related Workmentioning

confidence: 99%

SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases

Xing

Gruenwald

Phang³

2008

2008 19th International Conference on Database and Expert Systems Applications

View full text Add to dashboard Cite

show abstract

Transaction Processing in Mobile, Heterogeneous Database Systems

Lim¹,

Hurson

Jiao

2008

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

The rapid explosion in the use of wireless devices, combined with the simultaneous infrastructure expansion required to suport a massive number of users, has made ubiquitous access to data a reality. When a large number of users simultaneously accesses global data in a mobile computing environment, an efficient means to manage a large amount of concurrent transactions is required. Current multi‐database concurrency control schemes do not address the limited bandwidth and frequent disconnections associated with wireless networks. This article describes a new hierarchical concurrency control algorithm, v‐lock, that addresses the shortcomings of existing multi‐database concurrency control schemes. The algorithm uses global locking tables created with semantic informantion contained within a hierarchy to serialize global transactions, and remove global deadlocks. Additionally, wireless transmission of data is subject to weak or frequent disconnection. With the increased amount of local memory available at the mobile unit, data replication can be used to provide local data availability, limiting the restrictions imposed by a wireless mobile environment. In a mobile, multi‐database environment, local autonomy restrictions prevent the use of a page‐or‐file‐based data replication scheme. This article describes a new data replication scheme to address to limited bandwidth and local autonomy restrictions. Consistency is maintained by using a parity‐based invalidation scheme of data cached at the mobile unit. Additionally, a simple prefetching scheme is used to further improve the effectiveness of the proposed scheme. Finally, simulated results of the concurrency control and replication algorithms are presented and discussed.

show abstract

A Semantic-Serializability Based Fully-Distributed Concurrency Control Mechanism for Mobile Multi-Database Systems

Cited by 15 publications

References 9 publications

A self-adaptable scheduler for synchronizing transactions in dynamically configurable environments

A self-adaptable scheduler for synchronizing transactions in dynamically configurable environments

SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases

Transaction Processing in Mobile, Heterogeneous Database Systems

Contact Info

Product

Resources

About