A vertical partitioning algorithm for distributed multimedia databases

Abstract

Efficient retrieval of multimedia objects is a key factor for the success of distributed multimedia databases. One way to provide faster access to multimedia objects in these databases is using vertical partitioning. In this paper, we present a vertical partitioning algorithm for distributed multimedia databases (MAVP) that takes into account the size of the multimedia objects in order to generate an optimal vertical partitioning scheme. The objective function of MAVP minimizes the amount of access to irrelevant data and the transportation cost of the queries in distributed multimedia databases to achieve efficient retrieval of multimedia objects. A cost model for evaluating vertical partitioning schemes in distributed multimedia databases is developed. Experimental results clarify the validness of the proposed algorithm. © 2011 Springer-Verlag Berlin Heidelberg.