1) memory compaction
存储紧缩
2) compact storage
紧缩存储
1.
A variation of Aho-Corasick algorithm via compact storage was presented, which replaced homogeneous rou-tine explicit storage with heterogeneous requirement oriented implicit one, first started from two aspects of widthwise fan-out compression and lengthwise path compression, then expanded around the compression of sparse event table, thus reduced memory usage to about 0.
提出了紧缩存储型Aho-Corasick算法变体,以异构的按需隐式存储取代同构的例行显式存储,从横向扇出压缩与纵向路径压缩2个方向入手,围绕着压缩稀疏事件表展开,当字符集大小σ=256时可将存储量缩减为原来的0。
3) memory compact
内存紧缩
4) compressed store
压缩存储
1.
Based on the MOLAP technology of multi-dimension array,the article proposes a new method of compressed store,which was stored in dimensions by binary code.
基于多维数组MOLAP技术,针对目前使用较多的多维数组线性化压缩存储方法在处理维内部层次的聚集查询方面效率比较低的问题,本文提出了一种新的压缩存储方法,即采用二进制编码存储维方法,能有效提高存储和查询效率。
5) compression storage
压缩存储
1.
Explains the compression storage of the OpenOffice.
org文档的压缩存储方式以及这种方式和其他的多种存储方式相比的优势;针对OpenOffice。
2.
The author has,through the combination of sparse matrix compression storage and the characteristics of C/C++ language, produced an improved sparse matrix compression storage method,binary compression storage method,which stores the nonezero elements in the sparse matrix into a sequence list by way of binary scale.
结合稀疏矩阵顺序存储方法和C/C++语言的特点,提出一种稀疏矩阵压缩存储的改进方法——二元组压缩存储方法,把稀疏矩阵中的非零元素按一定规律用二元组表存储到顺序表(或链表)中。
6) Compress storage
压缩存储
1.
The paper analyzes compress storage of large coefficient matrix which realizes 1D chain compress storage of coefficient matrix by combination of array and structure.
讨论了大型容量矩阵的压缩存储方式,采用数组和结构体相结合的方法实现容量矩阵的一维链表式压缩存储。
补充资料：随机存取存储器(见半导体存储器)
随机存取存储器(见半导体存储器)
random access memory,RAM
s日1}}Cunq日Ct旧choql随机存取存储器random aeeess memoryRAM)见半导体存储器。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条