In this scenario, a user retrieves data from the database with no locks.
在此方案中，用户从数据库中检索数据而不加任何锁。
You can determine the types of locks being used from the Data Definition Language (DDL) schema files used to create the database.
根据创建数据库所使用的数据定义语言 (DDL)模式文件，可以确定正在使用的锁类型。
During the execution of a transaction, these locks ensure that operations on particular data elements will not be overwritten by other simultaneous operations.
在事务执行的过程中，这些锁确保对特定数据项的操作不会被其他同时发生的操作覆盖掉。
Bulk Update Locks: Used when bulk-copying data into a table and the TABLOCK hint is specified.
大容量更新锁：在向表进行大容量数据复制且指定了TABLOCK提示时使用。
Because the database manager can determine when a row is changed, it can ensure data integrity while limiting the time that locks are held.
由于数据库管理器能够确定某一行何时会被修改，因此可以保证数据完整性，同时限制持有锁的时间。
Concurrency control in business transaction terms usually involves generating and maintaining locks on data stores, such as relational databases.
并发控制在业务事务术语中通常涉及生成和维护数据存储上的锁，例如关系数据库。
The first thread locks the mutex and appends data to the queue, while the other threads wait for their turn.
第一个线程锁住互斥并把数据添加到队列中，而其他线程等待轮到它们操作。
With this strategy, because you are not holding read locks on data, the chance of getting stale data exceptions when you execute the update operations increases.
通过此策略，由于您未对数据保持读取锁，因此在执行更新操作时遇到失效数据异常的机率会增加。
Automatic peer recovery does require the use and guarantee of exclusive file locks to ensure transactional data integrity.
自动对等恢复需要排它文件锁定的使用和保证来确保事务的数据完整性。
The data protected by these locks is needed constantly by many threads, and you can expect that when you go to acquire this lock, you may have to wait until someone else is done with it.
不断地会有许多线程需要这些锁保护的数据，所以可以想象，当要取得这个锁的时候，可能不得不等候其他人用完它。
Clearly, pushing data into the queue is akin to appending data to the list, and this operation must be guarded by mutex locks.
显然，把数据放到队列中就像是把数据添加到列表中，必须使用互斥锁保护这个操作。
When the redaction server is connected to the repositories (the data store) on the ECM servers it locks the repositories.
当编校服务器连接到ECM服务器上的存储库(数据存储)时，它会锁定存储库。
Since pessimistic session locks can be removed as described above, the application that obtained the lock should always check to see if it is still in force before updating data.
如上所述，由于可以删除悲观会话锁，因此获得锁的应用程序始终需要在更新数据之前检测锁是否有效。
Immutable data cannot be changed and thus reading immutable data does not require locks, even when multiple threads are reading.
不可变数据是不能更改的，因此读取不可变数据无需用到锁，即使有多个线程读取时也是如此。
Pessimistic session locks should generally be write locks; they should let other users read the locked data, unless there is a very strong case to not do so.
悲观会话锁通常为写入锁，它们允许其他用户读取锁定的数据，除非遇到不能读取的情况。
This information includes data about threads, locks, stacks, and so on, as well as a rich set of information about the class loaders in the system.
信息包括线程、锁、堆栈等方面的数据，以及关于系统中类装入器的丰富信息。
No locks will be included; this kind of lock-free, concurrent data structure is also referred to as a non-blocking data structure.
这个堆栈没有锁；这种无锁的并发数据结构也称为非阻塞数据结构。
In the pessimistic locking scheme, explicit locks are taken against rows using the SQL SELECT FOR UPDATE statement. Data is then modified, and an SQL UPDATE is issued.
在悲观锁定方案中，通过使用SQLSELECTFORupdate语句对数据行进行显式锁定，然后更改数据，并执行SQL UPDATE。
Mrs. Waldo is accidentally demonstrating a drawback of 2pc: database locks are needed to guarantee isolation and this can have negative consequences for data access (and concurrency).
waldo夫人正意外地展示2pc的缺点：需要数据库锁来保证隔离，但这样可能对数据访问(和并发)有负面影响。
As of Version 8, the load utility places locks on the table itself, and you can enjoy concurrent access to other table objects in the same table Spaces while a data load operation is running.
到了Version8,load工具在表本身上放置锁，因而您可以在运行数据加载操作的同时，对相同表空间中的其他表对象进行并发访问。
For large objects and long field data, DB2 escalates Intent None (IN) locks to Share (S) locks and therefore is approximately 10% slower.
对于大型对象和long字段数据，DB2 将IntentNone (IN)锁升级为Share (S) 锁，因而要慢大约 10%。
This extension increases data integrity and reduces deadlocks at the cost of reduced concurrency by holding locks for longer periods of time.
此扩展用维持更长时间的锁定来减少并发的代价提高数据完整性和减少死锁。
In particular, make sure you release any locks held and avoid crashing an entire application due to data sent by an attacker.
具体来说，就是需要确保释放所持有的锁，并且防止会由于攻击者所发送的数据而引起整个应用程序的崩溃。
The UI update method asks the table view for the array of visible cells. It compares these to the data model (with proper locks) and then updates cell content as needed.
用户界面更新方法询问可见细胞阵列的表观。比较这些数据模型（用适当的锁），然后更新单元格的内容需要。
The cost of placing locks on the data is less than the cost of rolling back changes when concurrency conflicts occur.
在数据上放置锁所费的成本小于发生并发冲突时回滚更改所费的成本。
It compares these to the data model (with proper locks) and then updates cell content as needed.
比较这些数据模型(用适当的锁)，然后更新单元格的内容需要。
Pinning temporarily locks the data in its current memory location, thus keeping it from being relocated by the common language runtime's garbage collector.
锁定操作将数据暂时锁定在其当前内存位置中，从而阻止公共语言运行时的垃圾回收器将其重定位。
Restricting your locks only to code that must be executed atomically will allow you to write multithreaded components that ensure the safety of your data while still maintaining good performance.
将锁定的使用限制在只用于必须完整执行的程序码，您就能够写入确保资料安全的多执行绪元件，同时还是能够保持良好效能。
Pessimistic concurrency locks data during update so that other users are not in danger of committing incompatible data changes.
保守式并发在更新期间锁定数据，使其他用户不会陷于提交不兼容数据更改的危险中。
Pessimistic concurrency locks data during update so that other users are not in danger of committing incompatible data changes.
保守式并发在更新期间锁定数据，使其他用户不会陷于提交不兼容数据更改的危险中。
应用推荐