AN MR-TREE DATA INDEXING METHOD USING DELAYED COMPUTING FOR A NAND FLASH MEMORY

摘要

PURPOSE: it is a kind of execute efficient MR-tree data by calculate indexing operation postpone a NAND quick-flash memory be provided to make be written flash memory each node it is corresponding be possible. ;CONSTITUTION: a kind of to execute efficient MR-tree data by calculating the step of indexing operation postpones a NAND quick-flash memory include: to execute indexing operation by using indexing tree construction by a plurality of nodes. The MR-tree structures for being formed in the type of the tree construction include multiple intermediate nodes, multiple leaf nodes, and multiple half leaf nodes. Half leaf node node includes the data object and leaf node of entry. ;The 2010 of copyright KIPO submissions