Editing Record locking (section)

==Granularity of locks==
If the bank clerks (to follow the illustration above) are serving two customers, but their accounts are contained in one ledger, then the entire ledger, or one or more [[database table]]s, would need to be made available for editing to the clerks in order for each to complete a transaction, one at a time ([[file locking]]). While safe, this method can cause unnecessary waiting.

If the clerks can remove one page from the ledger, containing the account of the current customer (plus several other accounts), then multiple customers can be serviced [[Concurrency (computer science)|concurrently]], provided that each customer's account is found on a different page than the others. If two customers have accounts on the same page, then only one may be serviced at a time. This is analogous to a ''page-level lock'' in a database.

A higher degree of [[Granularity#Computing|granularity]] is achieved if each individual account may be taken by a clerk. This would allow any customer to be serviced without waiting for another customer who is accessing a different account. This is analogous to a ''record-level lock'' and is normally the highest degree of locking granularity in a database management system.

In a [[SQL]] database, a record is typically called a "row".

The introduction of granular (subset) locks creates the possibility for a situation called [[Deadlock (computer science)|deadlock]]. Deadlock is possible when ''incremental locking'' (locking one entity, then locking one or more additional entities) is used. To illustrate, if two bank customers asked two clerks to obtain their account information so they could transfer some money into other accounts, the two accounts would essentially be locked. Then, if the customers told their clerks that the money was to be transferred into each other's accounts, the clerks would search for the other accounts but find them to be "in use" and wait for them to be returned. Unknowingly, the two clerks are waiting for each other, and neither of them can complete their transaction until the other gives up and returns the account. Various techniques are used to avoid such problems.