Assume slower random data access rather than fast sequential access.
假定数据访问是较慢的随机访问而非较快的连续访问。
For example, with typical page sizes of 8 KB or 16 KB, in-page processing is inherently sequential and less CPU-efficient than random data access.
例如，对于典型的8KB或16 KB的页面，页内处理天性是连续的，CPU效率低于随机数据访问。
With a VM system, you have two primary areas that store information about the active applications and the data it USES — the physical random access memory (RAM) and space allocated on hard drives.
使用VM系统，您有两个主要区域来存储有关活动应用程序及其使用的数据的信息——物理随机访问存储器(RAM)和硬盘驱动器上分配的空间。
Since DB2 will only use the index the "traditional" way for index-only access, the rows will be returned just like our index data, in groups of identical LASTNAMEs in random order.
因为DB 2仅将以“传统”方式使用索引，以实现仅限索引的访问，各行将像我们的索引数据一样，在同样的LASTNAME小组以随机形式返回。
As mentioned above, random access requires the disk head to move randomly over the disk to find the proper data points.
正如上文提到的，随机访问要求磁盘头能随机移动到磁盘上，查找对应的数据点。
Shared memory is well suited to larger collections of data and, because it uses memory, grants fast, random access.
共享内存适合比较大的数据集，因为它使用内存，支持快速的随机访问。
A good starting point is to select the default (4 KB), especially if row sizes are fairly small or when access to the data is primarily random.
一开始的时候，可以选择默认选项(4KB)，如果行的长度很小，或者对数据的访问基本上是随机的，则更应该选择这一选项。
As a result, the disk access time is much longer when reading data in random order than when reading in sequential order.
因此，与按顺序读取相比，按随机顺序读取数据时的磁盘访问时间要长得多。
Sequential access, as exhibited by data warehouse activities, does not produce as great a performance improvement with SSDs as does random access.
在数据仓库活动所用到的顺序存取中，SSD的性能提升没有随机访问那么大。
In the next two articles, we'll explore the use of much more powerful and convenient data structures: ordered lists and random-access dictionaries.
在接下来两篇文章中，我们将探讨更强大、更方便的数据结构的应用：有序列表和随机访问字典。
Then, he says, they could be just the thing for a superfast random access memory (RAM), the working memory that computers use to store data on the fly, and ultimately even for hard drives.
然后他又说他们适宜作随机储存器（RAM)电脑用来快速储存数据的储存器，而且最后可能会用于硬盘驱动器。
Most web applications want rapid random access to many pieces of indexed data.
大多数web应用需要对很多索引数据进行快速随机访问。
A page blob supports up to 1 TB of data and is meant for random access.
而pageblob能支持最高1tb的数据，主要用于随机访问。
Batch and query applications typically do a lot of sequential processing, while data access for OLTP tends to be more random in nature.
批处理和查询应用程序通常要进行大量的顺序处理，而用于OLTP的数据访问往往更具有随机性。
Random Access Memory, an area in the computer system unit that temporarily holds data before and after it is processed.
随机存储器位于机箱里面的一个区域，它在数据被处理的前后临时的保存数据。
It allows you to use low-level routines, high-level ISAM routines, or the ODBC layer for high-speed random or sequential data access.
它允许你使用低水平程序，高水平ISAM程序，或者用于高速随机或者连续数据访问的ODBC层。
Compared to a disk, a tape is less expensive and holds more data, but random access is much slower.
与磁盘比较，磁带更便宜，并且能保存更多数据，但是随机访问非常慢。
Tape persisted as the storage medium of choice, even though it suffered from poor performance and the need for sequential, not random, access to stored data.
即便磁带的性能不佳、只能顺序而不是随机存取储存的数据，但磁带作为存储介质一直未变。
Analyzing the architecture of object-relational access layer and OID generating strategies, 128 bit random number algorithms is not adapted to the increment of the data processing and data storage.
分析对象-关系访问层体系结构和OID生成策略，128位随机数算法生成的OID已不适应数据信息量不断增加和海量数据存储的需求。
This paper discusses the judgement and process of program derailment, and presents fault tolerance methods in random access memory, I/O canal and data in computer real-time control system.
本文提出了在计算机实时控制系统中，程序飞出的判断及其处理方法；提出了随机存贮器的容错方法，I／O通道的容错方法以及数据的容错方法。
This paper discusses the judgement and process of program derailment, and presents fault tolerance methods in random access memory, I/O canal and data in computer real-time control system.
本文提出了在计算机实时控制系统中，程序飞出的判断及其处理方法；提出了随机存贮器的容错方法，I／O通道的容错方法以及数据的容错方法。
应用推荐