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

摘要

PURPOSE: A method for performing an efficient MR-tree data indexing operation through delaying computing in an NAND flash memory is provided to make the writing in the flash memory corresponding to each node possible. CONSTITUTION: A method for performing an efficient MR-tree data indexing operation through delaying computing in an NAND flash memory comprises a step of performing the indexing operation by using an indexing tree structure consisting of plural nodes. The tree structure is formed in the type of an MR-tree structure including plural intermediate nodes, plural leaf nodes, and plural half leaf nodes. The half leaf nodes are nodes including the entries of a data object and leaf nodes.