Combining the classification and matching of fingerprints together, a neighborhood structure is proposed in this paper, which includes the orientation field and minutia around the reference singular point. This structure has the advantage that the identification information is centralized around the singular point, and can dramatically decrease the calculation of matching. It can also be directly used as pattern in both the continuous classification and the fast matching of fingerprints, and carry out the fast identification of the large scale database. Experimental results on NIST and FVC2004 databases show that this algorithm can highly speed up the matching of large scale fingerprint database with a preferable performance, and it can be used in one-to-many matching of on-line fingerprint identification system.