Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Chan, Yat-leong Boris | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/2487 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Cache consistency management in mobile distributed environment | en_US |
| dcterms.abstract | In a mobile computing environment, database servers disseminate database items to multiple mobile clients via wireless channels. Due to the low bandwidth and low reliability of wireless channels, it is important for a mobile client to cache its frequently accessed database items into its local storage. This improves the performance of database queries and the availability of database items for query processing during disconnection. Since the conventional cache management mechanisms are not suitable in mobile environments due to their reliance on high bandwidth networks, a set of cache management mechanisms has been proposed to address this issue. There are three issues for consideration in the proposed management mechanism, namely, cache granularity, cache coherence strategy, and replacement scheme. Along the dimension of cache granularity, three levels of granularity are suggested, namely, attribute caching, object caching, and hybrid caching, which is a hybrid approach of attribute and object caching. Regarding cache coherence strategy, a client-pull based solution is proposed for mobile environment. Also we have proposed several cache replacement schemes that can adapt to the access patterns of database items. Via a detailed simulation model, we examine the performance of various levels of cache granularity with our cache coherence strategy. We observe, in general, that hybrid caching could achieve a better performance. In order to preserve the consistency of database, an optimistic concurrency control protocol has been incorporated into our caching model. However, in practice, it is hard to enforce one-copy serializability in mobile computing environment due to the narrow bandwidth and unreliable connectivity of wireless communication links. Instead, we have employed bounded ignorance as the correctness criterion in our model. Through simulations, it is observed that the system throughput is significantly enhanced when a controlled degree of inconsistency is allowed in read-only transactions especially when the update probability is low. Finally, we have implemented the proposed caching mechanism as a system prototype, and a set of experiments has been performed accordingly. The outcome of these experiments is in line with the performance observed in simulations. | en_US |
| dcterms.extent | viii, 107 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1998 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Cache memory | en_US |
| dcterms.LCSH | Memory management (Computer science) | en_US |
| dcterms.LCSH | Mobile computing | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14422220.pdf | For All Users | 4.79 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/2487