An Efficient Index Structure for Range Count Query Based on Improved B-tree

• DOI: 10.14257/ijunesst.2015.8.4.16
• Publication Date: 2015-12-14T09:53:20Z
• Authors: Jinglin Hu; Deyu Qi
• Keywords: Tree (set theory)

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