Partial query optimization techniques for partitioned tables

With the emerging of large database and the explosion of mass data, people need to extract useful information, knowledge from huge database, and to improve the utilization rate of the information further. Partitioning technologies allows users to divisive a big table into some smaller and can manage partitions easier, so it can solve some of the problems of mass data. This paper discussed the Partial-MAX/MIN query optimization for the partitioned tables. We introduce the Rank Bisection Partition Tree (RBP-T) structure to improving the efficiency of this class of query. The experimental results show that our method to solve the Partial-MAX/MIN query in the mass data cases is effective.