An efficient optimized query and quick data operations (insert, update, delete) has been in a potential focus of database programmers and researchers. In a query oriented database system it is always intended that the response time should be fast and accurate and for this objective along with other measures physical schema design is very important. One of the important examples of query intensive databases is an OLAP. On the other hand there are update/insertion oriented databases like scientific databases which need some other special database design. In this paper the authors discussed the work done on three different approaches for automating the physical design of database and they have proposed a new physical design technique using Dynamic Programming’s Edit Distance and 0/I knapsack algorithms along with sorting technique. The rest of the approaches use greedy algorithms to automate the DB physical design.