针对密集读操作的场景显著地提高性能。
This aims to provide a significant performance boost in read-mostly scenarios
这个属性会忽略Web浏览器的读操作。
使用键执行随机读操作的最常见rpg方法是CHAIN操作。
The most common RPG method for performing a random read using a key is the CHAIN operation.
为了实现这个策略,简单地将所有的读操作传递到源,并返回结果。
For this policy, all read operations are simply passed on to the sources, and results are returned.
在数据库读操作成功之后,它循环遍历结果集并收集帐户数据信息。
After a successful database read operation, it iterates on the result set and collects the individual account data information.
共享内存区域的一个作用是充当缓冲区,以减少对磁盘的读操作。
One purpose of the shared memory area is to act as a buffer, minimizing the necessity for further reads from disk.
我在此处假设读操作(作为api层的入口点)不会对数据库调用写操作。
I am making the assumption here that the read operation (as an entry point to the API layer) is not in turn invoking write operations on the database.
所有的写操作都被分发到主节点,而读操作可以在任何节点上进行。
All writes are directed to the primary node, from where they are replicated while reads can be performed on any node.
对于读操作,索引custname1更小一些,因此可能带来更好的性能。
For read operations, index custname1 is smaller and therefore potentially better performing.
通过使用乐观并发控制,数据库管理器在完成读操作之后可以立即释放行或页锁。
With optimistic concurrency control, the database manager releases the row or page locks immediately after a read operation.
结果,它一般需要大量的物理磁盘读操作来保证实现一致的低事务响应时间。
As a result, a high number of physical disk reads are usually required to ensure consistently low transaction response times.
读操作的完整硬盘寻道时间是 7.4毫秒,而写操作是 7.9 毫秒。
The full disk seek time is 7.4 milliseconds for reads and 7.9 milliseconds for writes.
它们在连接的两端使用两个标准的文件描述符—一个只执行读操作,另一个只执行写操作。
Both use two standard file descriptors on each end of the connection-one exclusive to read and another exclusive to write operations.
DPF对于以读操作为主的工作负载很有用,包括数据仓库环境中常见的工作负载。
DPF can be useful for read-intensive workloads, including those common to data warehouse environments.
特别是,拥有读操作屏障允许你切换到较简单的GC算法—更易于并发、扩展和强壮。
In particular, having a read-barrier allows you to switch to a simpler GC algorithm - and a simple algorithm can be more easily made parallel, scalable, concurrent and robust.
读操作是使用本地存储执行的(除非本地磁盘发生故障,那时通过辅助节点访问辅助存储)。
Read operations are performed using local storage (unless the local disk has failed, at which point the secondary storage is accessed through the secondary node).
OpenLDAP软件和包提供了创建目录信息树(一个主要进行读操作的数据库)的工具。
The OpenLDAP software and the packages it interfaces with provide tools to create a Directory Information Tree, a read-mostly database.
在某些情况下,如果读操作远远大于写操作,volatile变量还可以提供优于锁的性能优势。
In situations where reads greatly outnumber writes, volatile variables may also provide a performance advantage over locking.
如果读操作的次数要远远超过写操作,与锁相比,volatile变量通常能够减少同步的性能开销。
In cases where reads greatly outnumber writes, volatile variables can often reduce the performance cost of synchronization compared to locking.
只有部分数据副本参与更新操作,且/或作为读操作的一部分与其它副本进行联系时,就会出现弱/最终一致性。
Weak/eventual consistency happens when not all data replicas participate in the update operation and/or contacted as part of read operation.
在读事务中,没有变更需要提交,但是事务会防止对正在被读取的数据的修改,直到所有的读操作全部结束。
In a read transaction, there are no changes to commit, but the transaction prevents the data being read from changing until all of the reads are complete.
然后就可以使用这个返回的指针来配置这个虚拟文件的其他参数,例如在对该文件执行读操作时应该调用的函数。
You can then use the return pointer to configure other aspects of the virtual file, such as the function to call when a read is performed on the file.
然而,如果读操作远远超过写操作,您可以结合使用内部锁和volatile变量来减少公共代码路径的开销。
However, if reads greatly outnumber modifications, you can combine intrinsic locking and volatile variables to reduce the cost on the common code path.
例如,一个15,000RPM驱动器的读操作需要大约3.5毫秒的平均寻道时间,写操作则需要大约4毫秒。
For example, a 15,000 RPM drive has an average seek time of approximately 3.5 milliseconds for reads and 4 milliseconds for writes.
与此类似,作为获得监视的一部分,当进入一个同步块时,本地缓存失效,使之后的读操作直接进入主内存而不是本地缓存。
Similarly, as part of acquiring the monitor when entering a synchronized block, local caches are invalidated so that subsequent reads will go directly to main memory and not the local cache.
事务再次读取某数据时发现它自最后一次读操作之后由于另一个事务修改并提交了该数据而发生了更改,则会发生不可重读。
An unrepeatable read can occur when the transaction reads some data again and finds that it changed since the last read due to another transaction that modified this data and committed.
他们没有建立严格的事务规则,而是把数据库表推到最简,索引只用来引用,发生实际的数据库读操作的时候才施加数据过滤。
Instead of a strict transaction protocol, they made the database tables canonical and used the indexes only for references and reapplied filters to the actual database reads.
有一种普遍的观点是,如果只是要读一个对象的字段,不需要请求加锁,尤其是在JLS保证了32位读操作的原子性的情况下,它更是如此。
It is a commonly held belief that you do not need to acquire a lock to simply read an object's fields, especially since the JLS guarantees that 32-bit reads will be atomic.
如果没有分帧机制,一端接收到的数据可能比另外一端发送的数据多或少(这会将一次写操作划分成多次操作,或者将多次写操作合并到一个读操作中)。
Without framing, a peer may receive more or less than was sent (splitting up a write or aggregating multiple writes into a single read).
如果应用程序对某个文件进行写操作(而不是读操作),那么永久存储分页将是“经过修改的”,并且AIX必须在释放这些分页之前将其刷新到磁盘。
If the application had been doing writes to the file instead of reads, the permanent storage pages would be "modified," and AIX would have to flush the pages to disk before releasing the pages.
应用推荐