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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.