Simulated annealing for vertically partitioning an OO database

Author

Chinchwadkar, Gajanan S. ; Goh, Angela ; Lim, Ee-Peng

Author_Institution

Sch. of Appl. Sci., Nanyang Technol. Univ., Singapore

fYear

1997

fDate

9-12 Sep 1997

Firstpage

800

Abstract

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

Keywords

object-oriented databases; parallel processing; query processing; simulated annealing; IO load distribution; OO database; asynchronous parallel query processing; cost functions; load balance; object oriented databases; partition sizes; processing nodes; simulated annealing; standard deviation; vertical partitioning algorithms; Cost function; Data models; Database systems; Frequency; Object oriented databases; Object oriented modeling; Parallel processing; Partitioning algorithms; Relational databases; Simulated annealing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on

Print_ISBN

0-7803-3676-3

Type

conf

DOI

10.1109/ICICS.1997.652089

Filename

652089