Path: dp-news.maxwell.syr.edu!spool.maxwell.syr.edu!drn.maxwell.syr.edu!news.maxwell.syr.edu!border1.nntp.dca.giganews.com!nntp.giganews.com!local1.nntp.dca.giganews.com!nntp.speakeasy.net!news.speakeasy.net.POSTED!not-for-mail NNTP-Posting-Date: Sat, 09 Oct 2004 19:52:12 -0500 From: Hammond of Texas Newsgroups: comp.databases.theory,comp.databases Subject: Re: concurrent transactions problem Date: Sat, 9 Oct 2004 18:09:41 -0700 Message-ID: References: X-Newsreader: MicroPlanet Gravity v2.60 Lines: 27 NNTP-Posting-Host: 66.93.39.184 X-Trace: sv3-zmk04ybpt4QO8y4NQzJa8+eySL0SxC03eJgnno5gA6QUyCTx4l8S12+rJhonig8S2F4vinJ28dhfeOF!oiXQstOn9EEiGWve9NDVndY/HecPg81+Xw5x3LWyb/YyIZVqvnTn9xjB+eTwtXsCvcKc4YmG7Oxt!97hEC8gCJEP35be3/Aa+L+WBy+JzQNg= X-Complaints-To: abuse@speakeasy.net X-DMCA-Complaints-To: abuse@speakeasy.net X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.19 Xref: dp-news.maxwell.syr.edu comp.databases.theory:26701 comp.databases:41138 In article , raj_iv123 @yahoo.com says... > Hi, > I have a problem in my assignment that read as follows: > > Consider the following concurrent transactions: > T1: Deposition of fee by the student(Information is being put in > database system). > T2: Creation of study center wise list of the students who have paid > the fee. > T3: Generation of fee Receipt details of the University. > > a) What may be the problems that may be encountered on concurrent > execution of the above transactions? > > b) What will be the serializable schedule using hirerarchy of locks > with intention mode locking scheme. > > Anyone have the solution for this? thanx in advance. Raj, Your professor called. He said to tell you that you have to do your own homework. Here's a hint though. You need to ask more questions about the design of the database before you can answer those questions.