earticle

영어

With the development of many new technologies, the data grows much faster than before, and most of the data are stored in database. When the data amount in database is huge, it is needed to create appropriate index to keep the performance of database applications. This paper proposes a new index structure, namely MCRC-tree, to solve complicated range count query problem efficiently. Multiple experiments show that the performance of MCRC-tree is similar to that of traditional B-tree, to be specific, MCRC-tree can solve any range count query in O(logcN) I/Os, so is the complexity of insert and delete operations, here C means the disk page size, N is the total data amount.