Simulated annealing for vertically partitioning an OO database

Vertical partitioning of object oriented databases (OODBs) is a difficult problem. We present a simulated annealing (SA) approach for generating partitions which are suitable for asynchronous parallel processing of queries. We study two cost functions for SA and compare the resulting partitions with respect to irrelevant IO, % distribution of IO load for transactions across the processing nodes and the standard deviation of the partition sizes which determines the load balance in the asynchronous parallel query processing. The results are compared with one of the existing vertical partitioning algorithms