In random access storage, the computer can go directly to the information you want.
在随机存取存储器中，计算机能够直接找到你想要的信息。
The total direct access storage device (DASD) attached to this physical system, through its various fiber channels, was well over 200 TB.
通过不同光纤连接到这个物理系统上的直接访问存储设备(DASD)加起来超过200TB。
Direct access storage is much faster than sequential storage.
直接存取存储器比顺序存储器要快多了。
Magnetic tape is sequential access storage and can solve the problem mentioned above.
磁带是顺序访问存储，能够解决上面所提问题。
You can store data on secondary storage devices, such as a direct access storage device or magnetic tape volume.
你可以在辅助存储设备上存储数据，例如直接存取存储设备或者磁带。
The movement of data from fast-access storage ( magnetic disc ) to storage of lower access speed ( magnetic tape ).
数据由快速存取存储器（磁盘）传送到存取速度较低的存储器（磁带）的过程。
In MSS, a direct access storage device that does not physically exist. It exists logically on one or more staging drives.
在海量存储系统(MSS)中，物理上不存在的一种直接存储设备，它逻辑地存在于一个或几个登台驱动器上。
The data retained on sequential-access storage media are periodically accessed and updated by the sequential processing techniques.
存储在顺序存取存储器内的数据，通过顺序处理技术定期访问和更新。
In this paper, the problem to design a conflict free access storage scheme for arbitrary templates set is proved to be a NP Complete problem.
本文证明了为任意模板集设计存储访问无冲突非线性存储方案的问题是一个NP完全问题。
Electronic vaulting electronically transmits data either to direct access storage, an optical disc or another storage medium. This is a method used by Banks.
电子保险柜将数据电子地传输到直接存储设备、光盘或者其他存储媒体，这种方法常被银行使用。
When data has an object structure, the trade-offs are reversed: Writing efficient and maintainable code comes at the cost of efficient data access, storage, and scalability.
当数据具有对象结构时，上述关系恰好相反：编写高效的、可维护的代码要以牺牲数据访问、存储和可扩展性方面的高效性为代价。
When data has a relational structure, data access, storage, and scalability are very efficient, but writing efficient and maintainable code becomes more difficult.
当数据具有关系结构时，其在数据访问、存储和可扩展性方面会非常高效，但编写高效的、可维护的代码则变得非常困难。
When data has a relational structure, data access, storage, and scalability are very efficient, but writing efficient and maintainable code becomes more difficult.
当数据具有关系结构时，其在数据访问、存储和可扩展性方面会非常高效，但编写高效的、可维护的代码则变得非常困难。
应用推荐