City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science  >
CS - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: Transaction processing in data intensive applications
Other Titles: Shu ju mi ji xing ying yong zhong de jiao yi chu li
Authors: Lau, Pui Man (劉佩雯)
Department: Dept. of Computer Science
Degree: Master of Philosophy
Issue Date: 2006
Publisher: City University of Hong Kong
Subjects: Transaction systems (Computer systems)
Notes: CityU Call Number: QA76.545.L37 2006
Includes bibliographical references (leaves 76-78)
Thesis (M.Phil.)--City University of Hong Kong, 2006
vii, 79 leaves : ill. (some col.) ; 30 cm.
Type: Thesis
Abstract: Recently, there is an increasing number of applications that require support for real-time processing of rapidly arriving data streams. The high volume and fast arrival rate make it infeasible to install every data item of a stream into the database. In this study, we assume transactions running over data stream are executed periodically to produce new results, known as temporal data, to be installed into the database. Such transactions are regarded as continuous transactions. They resemble continuous queries in data stream management systems (DSMS), plus reading non-temporal data, for creating and writing temporal data into the database. Continuous transactions are continuous, standing and persistent with pre-declared data access pattern. Conventional real-time concurrency control protocols are not designed for systems with both continuous transactions and user transactions without prior knowledge of data access pattern. On the one hand, we need to ensure that user transactions can read fresh data and commit before their deadlines. On the other hand, we need to issue sufficient privilege for continuous transactions to keep temporal data fresh without violating database consistency and significantly affecting the performance of user transactions. Delayed Restart, Pre-declaration and two new time-cognizant forced wait protocols are proposed to handle the interplay between these two types of transactions with different characteristics. These protocols are evaluated through a series of simulation experiments. We have demonstrated that taking advantage of continuous transaction and temporal data semantics in transaction scheduling can significantly improve the performance of user transactions without jeopardizing the freshness of temporal data maintained by continuous transactions.
Online Catalog Link:
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer