Abstract

Object partitioning is an essential mechanism for improving the performance of object-based systems. However, in most of the work to date, emphasis has been confined to the optimization of disk rotation and seek time. The trend in the development of advanced information systems has become more and more towards distributed environments. In a distributed environment, multiple loosely-coupled (or even independent) systems are interconnected through communication networks, each, possibly, with its own local disks. An essential step in developing an information system in such a distributed environment is to efficiently distribute data to disks attached to the sites. Therefore, network communication overhead becomes an important concern during object partitioning. In this paper, we exploit the Mincut algorithm and introduce the concept of the binding strength to interpret the relationships between objects in order to develop a linear time partitioning algorithm. The algorithm partitions the ...

Citations