![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Caching and Hoarding The challenges ensuing from the asymmetric communication capabilities of mobile environments have led to an increased interest in broadcast-based data dissemination. Among the concurrency control (CC) techniques for transactional clients in broadcast environments, BCC-TI has been shown to be more efficient than a traditional technique. We propose two ways of improving CC performance in broadcast environments: caching and a weaker consistency criterion. We demonstrate that caching improves query response time in BCC-TI. We propose a new CC technique called Quasi-TI that enforces a correctness criterion called quasi-consistency useful when serializability is too expensive to enforce. We introduce a new caching scheme (PIT) and study its effects on Quasi-TI's performance. Through simulation, we demonstrate the benefits of the proposed techniques. ![]() DiSC'02 © 2003 Association for Computing Machinery |