GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

GeekInterview.com  >  Tech FAQs  >  RDBMS
Go To First  |  Previous Question  |  Next Question 
 RDBMS  |  Question 13 of 18    Print  
If we have a table which is accessed by multiple users and two or more user's are simultaniously trying to modify the table. Then what happens and how can we manage such situations?

  
Total Answers and Comments: 3 Last Update: July 13, 2007     Asked by: techmind 
  
 Sponsored Links

 
 Best Rated Answer

No best answer available. Please pick the good answer available or submit your answer.
December 07, 2006 09:58:22   #1  
praveen        

RE: If we have a table which is accessed by multiple u...
if one user is going to modify the table he will be aquired lock on that particular row of that table and it will be released to the other user whose is trying ot modify the same table after the modifications are commited by the first user. or else, we can handle the situations using no wait option
 
Is this answer useful? Yes | No
December 07, 2006 15:47:08   #2  
techmind        

RE: If we have a table which is accessed by multiple u...

Could you please elaborate how can we do it with no wait option.


 
Is this answer useful? Yes | No
July 13, 2007 03:44:17   #3  
Gajanan        

RE: If we have a table which is accessed by multiple u...

There are two ways of changing the rows in particular table.
One to delete the row
Second to modify/Change the data of row in table.
In every case we opt for exclusive locks

So when one user has exclusive lock then another user can’t share that information unless first user releases that locks.

Another type of lock is shared lock, which is used when two or more users share the same information for reading purpose (No change in the database).



 
Is this answer useful? Yes | No


 
Go To Top


 Sponsored Links

 




About Us  |   Privacy Policy  |   Terms and Conditions  |   Contact  |   Site Map  |   Add Question  |   Propose Category  |   RSS Feeds  |   Articles Sitemap  |   Site Updates  |   Add Resource

Copyright © 2005 - 2008 GeekInterview.com. All Rights Reserved
Page copy protected against web site content infringement by Copyscape