In this paper we present a novel approach to model the search space for optimal set data types in network component realisations. The main objective is to arrive at power efficient realisations of these data types in data structures, but the model can also be used with non-power cost functions. This work also strongly contributes to our overall goal of a higher level of specification and shorter design cycles for table-based memory organisations in network components.