Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Computing | en_US |
| dc.creator | Mok, Siu-yu Eppie | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/4321 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Transaction processing in an asymmetric mobile environment | en_US |
| dcterms.abstract | Recently the demand of mobile computing has increased. Not only the laptop becomes lighter, but also it has the ability to access data regardless of location. This allows transactions, e.g. banking or stock transactions, to be done through the laptop. Mobile clients may issue transactions simultaneously and the server is required to handle such requests. This thesis focuses on transaction processing in mobile database. A transaction is an execution of program that accesses a shared database. When two or more transactions execute concurrently, their database operations execute in an interleaved manner. This interleaving may lead to an inconsistent database state. Concurrency control protocol is one that synchronizes concurrent transactions to ensure consistency. In many application domains, the downstream capacity from servers to clients is much greater than the upstream communication capacity from clients back to servers. We refer to these environments as Asymmetric Communication Environments. Our model consists of a database server managing a collection of data items. Users are connected to the server via one of the two types of channels: point-to-point and broadcast. For data items which are of interest to a majority of users, they will be periodically broadcast to all users. In a mobile environment, users may disconnect from the server due to run out of battery, expensive connection charges, etc. The data items that clients receive are cached in their local disk so that they can continue to work even when they become offline. Since the cache size is limited, cache replacement algorithm should be considered. We have proposed a protocol which is an extension of traditional optimistic concurrency control protocol, but in the context of mobile environment. Optimistic concurrency control protocol is a concurrency control protocol that assumes the conflicts among transactions are rare. Our algorithm is then generalized and improved. The performance of the protocol and the asymmetric communication behavior of the mobile environment as well as the energy consumption are studied. The simulation model is built based on CSIM. Simulation results would be presented, followed by interpretation and discussion of results. | en_US |
| dcterms.extent | v, 85 leaves : ill. ; 31 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2000 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Mobile computing | en_US |
| dcterms.LCSH | Transaction systems (Computer systems) | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b15176770.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.53 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/4321