Timestamp ordering algorithm of concurrency control for a centralized database system

dc.contributor.advisorLeiss, Ernst L.
dc.contributor.committeeMemberRusinkiewicz, Marek
dc.contributor.committeeMemberScamell, Richard W.
dc.creatorChang, Sze-Yuan
dc.date.accessioned2023-12-08T20:57:49Z
dc.date.available2023-12-08T20:57:49Z
dc.date.copyright1984-11-14
dc.date.issued1983
dc.description.abstractConcurrency control mechanisms are necessary to preserve database integrity in a multi-user environment. Tne conventional methods use locking-based algorithms to synchronize concurrent transactions so that each user can retrieve or update information correctly in databases. When distributed database systems started being used, the locking-based algorithms became very complicated. Therefore, these conventional methods of concurrency control have been re-examined and the timestamp-based algorithms have been proposed. The main purpose of this research is to investigate these timestamp-based algorithms. Most of the published literature is based on the type of predeclared, atomic transaction processing model. This research is focused on an interactive system which aoes not have the type of predeclared, atomic transaction. Tne comparison to the locking-based algorithms and the advantages and disadvantages are discussed. One of the algorithms has been implemented on a centralized relational database management system for the purpose of exploring its feasibility and for finding out the factors to be considered in choosing concurrency control algorithms. Some comments are made for future research.
dc.description.departmentComputer Science, Department of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other11074289
dc.identifier.urihttps://hdl.handle.net/10657/15619
dc.language.isoen
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.subjectDatabase management
dc.subjectElectronic data processing--Distributed processing
dc.titleTimestamp ordering algorithm of concurrency control for a centralized database system
dc.type.dcmiText
dc.type.genreThesis
dcterms.accessRightsThe full text of this item is not available at this time because it contains documents that are presumed to be under copyright and are accessible only to users who have an active CougarNet ID. This item will continue to be made available through interlibrary loan.
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentComputer Science, Department of
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Houston
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Chang_1983_11074289.pdf
Size:
5.84 MB
Format:
Adobe Portable Document Format