Flash memory can be a viable solution for the fu ture embedded systems. Embedded systems usually carry database as a part of embedded software. It is well known that Flash memo ry is far faster than usual hard disk storages especially for read however it takes much time for Flash memory to delete than to read or to write. For a database system, index tr ees on Flash memory have been widely studied for the better performance. From our previous research es on indexing tree performance on Flash memory, we suggest a delaying technique for index tree ope rations on Flash memory. Among B-tree, R-Tree and MR-tree, we choose MR-tree as it is multimedia data base index. Considering both of the flash memory operation characteristics and MR-tree operation characteristics, we adjust MR-tree parameters for a just fit for Flash memory and applied aggregated-delayed MR-tree operations on Flash memory. We believe we find a reasonable parameter and efficient operation delaying technique for MR-tree on flash memory. The benefit of our researches has been proven by the experimental results based on several database access profiles.