Abstract: By abandoning irrelevant tuples and reducing the way of retrieval, we presented an optimization algorithm STRN3, which solved the problem that all the tuples of negative table constraint were traversed in the compatibility algorithm, resulting in redundant retrieval and low efficiency. The experimental results show that the performance of the algorithm STRN3 is better than that of the algorithm STRN when the average number of the valid tuples in the negative table does not decrease substantially in the retrieval process. In the constraint networks, when the number of supported tuples is more than conflict tuples, the performance of the algorithm STRN3 is better than that of  the algorithm STR3, thus the improvement of the negative table constraint algorithm is realized.

Key words: reducing retrieval, artificial intelligence, minimum support interval, negative table constraint