The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6, and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address. To solve these two difficult problems, this algorithm converts the prefix into ranges and stores them in a B-tree, then uses range fragment tree in the nodes to reduce the memory access and the storage requirement. Theoretical analysis and the experimental results indicate that the algorithm can support the high performance lookup for huge IPv6 route tables.