In this paper, we revisit the Property Matching problem and present a better indexing scheme for the problem. Let T be a text of length n with property p, and P be a pattern of length m, both strings are over a fixed finite alphabet. In particular, the existing data structures all require O(n log n)-bit space, where n is the length of the text. By using compressed suffix array and other supporting data structures, we propose a new index structure for the problem. We discuss the index structure and searching process for the case |p| = O(n/ log n) and |p| = O(n/ log n). Our index only needs nHk(T)+O(n log |S|)-bits and nHk(T)+nH0(A)+O(n(log |S|+log log n)) bits space for the above cases respectively (A is an array with length n here), while needing a little more searching time as return.