Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/329884
Title: Real Time Data Base System
Researcher: GUPTA GYANENDRA KUMAR
Guide(s): SHARMA AWADHESH KUMAR
Keywords: Computer Science
Computer Science Information Systems
Engineering and Technology
University: U P Rajarshi Tondon Open University
Completed Date: 2012
Abstract: Distributed real time database systems (DRTDBSs) can be defined as database systems that support real time transactions. They are used for a wide spectrum of applications such as air traffic control, stock market trading, banking, telemedicine etc. In DRTDBS, there are two types of transactions: global and local. The global transactions are distributed real-time transaction executed at more than one site whereas the local transactions are executed at generating site only. A commonly model used for distributed real time transaction consists of a process, called coordinator, which is executed at the site where the transaction is submitted, and a collection of other processes called cohorts executing at various sites where the required data items reside. newlineTransactions in a real time database are classified into three types, viz. hard, soft and firm. The classification is based on how the application is affected by the violation of transaction time constraints. This thesis reports efficient solutions for some of the issues important to the performance of firm deadline based DRTDBS. newlineThe performance of DRTDBS depends on several factors such as specification of transaction s deadline, priority assignment policy, scheduling transactions with deadlines, time aware buffer and locks management, commit procedure etc. One of the primary performance determinants is the policy used to schedule transactions for the system resources. The resources that are typically scheduled are processors, main memory, disks and the data items stored in database. newlineIn order to resolve the contention for these resources, DRTDBSs have to establish a priority ordering among the cohorts. This ordering should minimize the percentage of missed transactions which is the primary performance metric, defined as percentage of input transactions that the system is unable to complete before their deadlines. We proposed a scheme where the priority of each cohort is determined independently on the basis of the locks required by it at its execution site.
Pagination: 
URI: http://hdl.handle.net/10603/329884
Appears in Departments:School of Computer and Information Sciences

Files in This Item:
File Description SizeFormat 
1.pdfAttached File1.05 MBAdobe PDFView/Open
2.pdf4.43 MBAdobe PDFView/Open
3.pdf627.79 kBAdobe PDFView/Open
4.pdf1.81 MBAdobe PDFView/Open
5.pdf2.44 MBAdobe PDFView/Open
6.pdf629.55 kBAdobe PDFView/Open
80_recommendation.pdf3.23 MBAdobe PDFView/Open
certificate.pdf296.1 kBAdobe PDFView/Open
cover.pdf170.7 kBAdobe PDFView/Open
preliminary pages.pdf1.19 MBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: