The invention relates to a large-scale graphic constraint linkage path searching
algorithm in a high-dimensional vector space. The
algorithm mainly includes the following steps of projection screening;
dimensionality reduction deletion and selection;
node deletion and selection; node subset high-dimensional spatial integration, wherein constraint linkage paths are output. By means of the
algorithm, a node similarity linkage algorithm based on distance in the vector space is improved, a gridding technique and constraint linkage characters are introduced, a great quantity of invalid nodes are screened out, and the calculation complexity is reduced; a Map-Reduce framework is introduced into the algorithm, the path of each node is calculated by means of a four-stage deletion and
selection strategy, an optional node set meeting the constraint conditions is found, a
result set is called circularly to return to a reachable constraint path, unnecessary text
copying costs and unnecessary path calculation costs are reduced, and the algorithm has high efficiency and a low error rate. Meanwhile, certain improvement and innovation are conducted on the algorithm during
processing of the high-dimensional
data space, unnecessary calculation
processing is decreased through various dimension reduction means, the
processing execution capability of the algorithm is improved, and therefore the algorithm can give answers and make responses to the questions of users more quickly.