该向导自动创建纵栏式数据访问页。
This wizard automatically creates a columnar data access page.
access会将超链接添加到数据访问页。
在保存数据访问页时，默认情况下，所有支持文件(如项目符号、背景纹理和图形)都被组织在支持文件夹中。
When you save a data access page, all supporting files - such as bullets, background textures, and graphics - are, by default, organized in a supporting folder.
要从输出JSP页访问输入消息，必须将数据显式地从输入 JSP文档传输到输出 JSP 文档。
To access the input message from the output JSP page, you have to transport the data explicitly from the input JSP document to the output JSP document.
例如，对于典型的8KB或16 KB的页面，页内处理天性是连续的，CPU效率低于随机数据访问。
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.
如果您不能通过Windows网络访问该远程主机，那么当您试图使用resource页来选择您想获取的数据类型时将显示错误消息。
If the remote host is not accessible through the Windows network, an error message will display when you attempt to use the Resource page to select the type of data that you want to capture.
如果为关系数据和XML数据，或者为数据和索引使用单一的页宽，那么32kb的页宽对于XML数据而言可能有利，但是不利于关系数据和索引的访问。
If you use a single page size for relational and XML data, or for data and indexes, a 32kb page size may be beneficial for XML data but somewhat detrimental for relational data and index access.
所有的这些页均使用了数据库密集访问而且大都是我们最受欢迎的页面。
All of these pages have database-intensive accesses and are among our most popular pages.
数据库集群会将经常访问的DB 2行放在同一页面中，经常访问的页面集中放在磁盘上。
Database clustering places frequently accessed DB2 rows in the same page and frequently accessed pages close together on disk.
拖到绘图页后，可以表示按顺序访问的数据，如存储在磁带上的数据。
Drag onto the page to represent sequentially accessible data, such as data on magnetic tape.
当其他进程唤醒和要访问的数据，他们得到的页面错误和内存中的内核页。
When other processes wake up and want to access that data, they get a page fault and the kernel page in the memory.
该数据可以被任何一个激活路由访问，并能用来保存诸如页标题、面包屑以及其它只读数据。
This data is accessible within each activated route and can be used to store items such as page titles, breadcrumb text and other read-only data.
空间数据的无序性，使得应用在其上的利用连接索引的算法需要进一步的改进，为此分析了其中关键的最佳页访问次序问题。
For the reason of the no order of space data, the algorithm based on join index have to improve for it. The key problem of optimal page-access sequence with a fixed Buffer has been analyzed.
这将会花费SQLServer大量时间来访问文件中每个大小为8K的数据页(尤其当文件非常巨大时)并将每页数据清零。
It can take a lot of time for SQL Server to go to every 8k page in a file (especially very large files) and physically zero out each page.
这将会花费SQLServer大量时间来访问文件中每个大小为8K的数据页(尤其当文件非常巨大时)并将每页数据清零。
It can take a lot of time for SQL Server to go to every 8k page in a file (especially very large files) and physically zero out each page.
应用推荐