Rough set is a valid mathematical theory developed in recent years
which has the ability to deal with imprecise
uncertain
and vague information.The core and reduction of attributes are two important topics in the research on rough set theory.It has been proven that computing all the reductions and the optimal (minimal) reduction of decision table is a NP-hard problem.In this paper
Rough set theory is deeply investigated;a number of useful properties of the positive region are discovered.Based on the above findings
we present a calculation algorithm for core directly.And then
two algorithms for relative reduction based on the positive region are designed.