Autonomic network management strives to reduce the complexity associated to managing large scale communications networks. Policy based management is a critical facilitator for this vision and more importantly policy conflict analysis processes must be efficient and scalable to cope with the dynamicity and size of such communications networks. We present an efficient policy selection process for policy conflict analysis that maintains a history of previous policy comparisons in a tree based data structure to reduce the number comparisons required in subsequent iterations. The ability to incorporate historical information into the selection process stems from the two phase approach we take in our conflict analysis algorithm. The first phase of the algorithm initialises a relationship pattern matrix between a candidate policy and a deployed policy, the second phase matches this pattern against a conflict signature. Previous solutions compare candidate policies against all deployed policies sequentially, however our approach can re-use the patterns already discovered from previous iterations of the algorithm to reduce the number of comparisons. Experimental results presented here show that significant performance improvements can be made using this approach, however the degree of this improvement is dependent on the nature of the relationships between deployed policies.