Abstract: A roll-to-roll method for manufacturing 2D/3D grating switch membrane is performed in such a way that: Step 1 and Step 2 are simultaneously performed, then Step 3 is performed, and finally Step 4 is performed: Step 1, subjecting a concave grating facing down to rubbing and liquid crystal dropping; Step 2, uniformly coating a PI liquid onto a surface layer of a mirror-face metal roller, and performing self-hating and rubbing; Step 3, making the concave grating rubbed and dropped with liquid crystals in Step 1 and PI layer coated and directionally-rubbed on the mirror-face metal roller in Step 2 attached to each other, forming a grating membrane, and rotating and pre-baking the grating membrane with the mirror-face metal roller; Step 4, curing the attached and baked grating membrane by the UV curing means and after stripping, collecting and winding through the 2D/3D grating switch membrane collecting roller.

Abstract: A roll-to-roll method for manufacturing 2D/3D grating switch membrane is performed in such a way that: Step 1 and Step 2 are simultaneously performed, then Step 3 is performed, and finally Step 4 is performed: Step 1, subjecting a concave grating facing down to rubbing and liquid crystal dropping; Step 2, uniformly coating a PI liquid onto a surface layer of a mirror-face metal roller, and performing self-hating and rubbing; Step 3, making the concave grating rubbed and dropped with liquid crystals in Step 1 and PI layer coated and directionally-rubbed on the mirror-face metal roller in Step 2 attached to each other, forming a grating membrane, and rotating and pre-baking the grating membrane with the mirror-face metal roller; Step 4, curing the attached and baked grating membrane by the UV curing means and after stripping, collecting and winding through the 2D/3D grating switch membrane collecting roller.

Abstract: “Grid Plus T Tree” multidimensional index method in memory database partitions the whole record sets to different grid cells. Every grid data unit is connected with one data barrel, which loads records, through the grid directory. Every data unit is only mapped with one data barrel. For memory database, setting up a “T Tree” with these data units according to one field, so as to set up one “T Tree” for each data barrel according to one field. Then the grid directory can be presented by a k-dimensional (the dimension of keyword) array. The field ranges of these data units are called scale. Scale is the memory range of each “T Tree”. This invention successfully overcomes the shortcomings that the current index methods for memory database neither efficiently use the memory space nor suits multi-dimension.

Abstract: “Grid Plus T Tree” multidimensional index method in memory database partitions the whole record sets to different grid cells. Every grid data unit is connected with one data barrel, which loads records, through the grid directory. Every data unit is only mapped with one data barrel. For memory database, setting up a “T Tree” with these data units according to one field, so as to set up one “T Tree” for each data barrel according to one field. Then the grid directory can be presented by a k-dimensional (the dimension of keyword) array. The field ranges of these data units are called scale. Scale is the memory range of each “T Tree”. This invention successfully overcomes the shortcomings that the current index methods for memory database neither efficiently use the memory space nor suits multi-dimension.