Most of the current data mining algorithms handle databases consisting of a single table. Recently few algorithms are proposed that mine data stored in multiple tables for association rules. The classical association rule mining implicitly assumes that all items in the data are of the same nature and/or have similar frequencies in the data. In real life applications this is not the case. So use of only one minimum support value for the whole database may not be sufficient. If minimum support is set high the rules that involve infrequent items will not be found and if minimum support is set very low then this may result in flood of rules. In this paper we present a technique that can allow a user to specify multiple minimum supports to take care of the natures of items and their varied frequencies in multiple-table database environment. We discuss previous approaches that partly address the related issues to present a couple of algorithms to address the issue of multiple support constraints in multiple table environment.