多媒体数据库检索的一种并行算法

Parallel Algorithm in Multimedia Database

本文描述了并行算法在多媒体数据库中的应用。重点介绍了K-树模型和建立在K-树模型上的一种基于内 容、多特征匹配的多媒体并行检索算法。在K-树模型下,每一多媒体数据类型可被视为一个K维的数据集合,它能 在保证检索精度的情况下显著提高检索速度。通过在Beowulf机群系统上的性能测试验证了该算法的有效性。

This paper describes the application of parallel algorithm in multimedia database. A k-trec modei is proposed for the indexing and retrieval by content of multimedia data using a weighted cascade. Each multimedia data type can be viewed as k-dimensional (k-d) data in spatial temporal domain. Using the k-tree structure, the retrieval time improves while the retrieval accuracy remains relatively constant. The performance is evaluat-ed by the results of multimedia database queries using a Beowulf-class cluster of workstations. The experimental results indicate that the retrieval accuracy improves with the utilized tree depth, while the parallel processing minimizes the retrieval time.