3 ms·
If you do use serializable isolation level you might get a deadlock, depending on how conscientious you are about updating everything in the same order. It sou
by stickfigure 9y ago
If you do use serializable isolation level you might get a deadlock, depending on how conscientious you are about updating everything in the same order.
It sounds like you misunderstand optimistic concurrency. If your transaction touches a piece of data, and that data changes (by another transaction) while your transaction is in progress, then your transaction will rollback on commit. With a tiny bit of library code, your transaction will retry until success. In the case of severe contention you may see repeated retries and timeouts, but you will never see deadlocks - at least one transaction will successfully commit each "round".
I disagree - database locks should not be used by the average developer. Understand optimistic concurrency and use serializable isolation. If (and only if!) you have a known performance problem with highly contended data, consider a locking strategy. 99 out of 100 developers will never need it, and most of that 1% will botch locks on the first try anyways.
If your database doesn't support optimistic concurrency, get a better database.
- IgorPartola 9y agoI partially agree with what you are saying. I understand optimistic concurrency, especially the constraints it places on your code: you must in all cases access the data in the same order, otherwise you do get deadlocks. You also must implement the retry mechanism. I am not familiar with all the web frameworks out there (this is where I often encounter these types of issues), but I don't know of one that automatically retries requests for you. That "tiny bit of library code" is something that as far as I know you have to create for every situation, and it will be specific to your situation. I have yet to see a production codebase that actually does this instead of simply returning an error to the user saying "try again". If your database doesn't fully support ACID transactions, yes, get a better DB. And no you don't need to use named locks all the time. As an example, I have a codebase where I use the standard transactions semantics everywhere using the Django ORM, except one very specific and critical bit of code where I want to be dead certain that a thing can't happen twice in a row. So basically out of, say, 100 or so places where I commit a transaction, only one actually uses named locks, but where it does, it solves the problem in a very elegant way. So I agree with you that you shouldn't litter your code with these. But you absolutely can use them to either (a) guard against complex and critical parts of your code or (b) use these to quickly augment a huge existing codebase that keeps running into deadlocks or worse yet lock timeouts.
- stickfigure 9y agoI understand optimistic concurrency, especially the constraints it places on your code: you must in all cases access the data in the same order, otherwise you do get deadlocks. The second half of this statement negates the first :-) You have confused pessimistic concurrency with optimistic concurrency. An optimistic system detects collision at commit time and the actual order of operations in your transaction is irrelevant. You will never experience a deadlock, only aborts/retries. In a pessimistic concurrency scenario, you take explicit locks as you access resources. Those locks block access by other transactions. This creates the dining philosophers problem and the risk of deadlocks. When locking resources, you must access resources in a consistent order to prevent deadlocks. Please avoid database locks and let smart databases do what they are supposed to!
- IgorPartola 9y agoLearn something new every day. Yes you are correct, I meant pessimistic concurrency because that's what I'm familiar with. Which databases support optimistic concurrency and full ACID transactions?
- stickfigure 9y agoPostgres, MS SQL Server, Oracle... and more exotic ones like Google's Cloud Datastore and Spanner. Probably many more.
- IgorPartola 9y agoInteresting. I use Postgres and can't find any mention of this in the docs: https://www.postgresql.org/docs/current/static/mvcc.html https://www.postgresql.org/docs/current/static/mvcc.html talks about the usual row and table locks, and https://www.postgresql.org/search/?u=%2Fdocs%2F9.6%2F&q=Optimistic https://www.postgresql.org/search/?u=%2Fdocs%2F9.6%2F&q=Opti... is empty. Is it known by some other name in the Postgres land? Also, I found this and similar on SO: https://stackoverflow.com/questions/17431338/optimistic-locking-in-mysql https://stackoverflow.com/questions/17431338/optimistic-lock... So if this technique actually requires me to write my database access code at this level, it means that using something like an ORM is nearly impossible in a way that makes an ORM useful.