| 1. | Nominal storage allocation
名义存储分配 |
| 2. | Dynamic storage allocation
动态存储分配 |
| 3. | 552 requested file action aborted . exceeded storage allocation ( for current directory or dataset )
对请求文件的操作中止。超出存储分配。 |
| 4. | Storage assignment on a 64 - bit platform is different from assignment on a 32 - bit platform
64位平台上的存储分配与32位平台上的存储分配不同。 |
| 5. | You cannot rely on simply adding together the nominal storage allocations of the type s members
不能简单地将类型的各成员的名义存储分配相加。 |
| 6. | Then it compares the performance of the three different methods , and draws a conclusion by the analysis
同时将这三种存储分配算法进行了性能对比与分析，并得出结论。 |
| 7. | When you declare an elementary data type , it is not safe to assume that its memory consumption is the same as its nominal storage allocation
在声明一个基本数据类型时，假定该数据类型的内存消耗等于其名义存储分配是不安全的。 |
| 8. | The following table shows the visual basic data types , their supporting common language runtime types , their nominal storage allocation , and their value ranges
下表显示了visual basic的数据类型及其支持的公共语言运行库类型、名义存储分配和取值范围。 |
| 9. | As with all composite data types , you cannot safely calculate the total memory consumption of a structure by adding together the nominal storage allocations of its members
与所有的复合数据类型一样，您无法通过将结构成员的名义存储分配相加来得到确切的总内存消耗。 |
| 10. | The paper puts forward a combined - allocation - scheme based on the idea of constrained - block - allocation at the storing allocation strategy and gives disk - striping about the storing of big capacity disk array . in the study about the access path of the multi - media data , we introduce several kinds of representative multi - dimensions data index structure including k - d tree , r tree , vp tree and so on . ( 3 ) the research of multi - media database system architecture .
在存储分配策略上根据受限块分配( constrainedblock ? allocation )的思想，本文提出了联合分配模式( combinedallocationscheme ) ；并针对大容量磁盘阵列的存储给出了条形分配方案( diskstriping ) ；在多媒体数据的存取路径的探讨中，重点介绍了几种有代表性的多维数据索引结构，有k - d树、 r *树、 vp树等。 |
