http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Efficient Index Structure for Range Count Query Based on Improved B-tree
Hu Jinglin,Qi Deyu 보안공학연구지원센터 2015 International Journal of u- and e- Service, Scienc Vol.8 No.4
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.