Name lookup is a key operation in new network architectures, such as Information-Centric Networking (ICN), Content Delivery Network (CDN), and 5G core networks. Due to the longest prefix match in large-scale rule tables, it faces several challenges in terms of search speed, storage overhead, and security. This paper proposes a high-performance name lookup approach, building fixed length character indexing for variable length name components. Aiming at the performance bottleneck caused by the high detection times of the mainstream multi-level hash name lookup algorithm, the character indexing is convenient to read in once for decreasing hash detections. The cache utilization of character indexing is higher than existing algorithms in hash detections, which can decrease the memory access overhead and speed up the match processing. In this way, this approach can quick filter mismatched contents which relieving the flooding attacks. Our experimental results show that this approach can improve the name lookup performance obviously in the above scenarios.