• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on High Performance Computing and Communications(HPCC 2005); 20050921-23; Sorrento(IT) >P-CBF: A Parallel Cell-Based Filtering Scheme Using a Horizontal Partitioning Technique
【24h】

P-CBF: A Parallel Cell-Based Filtering Scheme Using a Horizontal Partitioning Technique

机译：P-CBF：使用水平分区技术的基于并行单元的过滤方案

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

To efficiently retrieve high-dimensional data in data warehousing and multimedia database applications, many high-dimensional index structures have been proposed, but they suffer from the so called 'dimensional curse' problem, i.e., the retrieval performance becomes increasingly degraded as the dimensionality is increased. To solve this problem, the cell-based filtering (CBF) scheme has been proposed, but it shows a linear decrease in performance as the dimensionality is increased. In this paper, we propose a parallel CBF scheme using a horizontal partitioning technique, which is called P-CBF, so as to cope with the linear decrease in retrieval performance. To achieve it, we construct our P-CBF scheme under an SN(Shared Nothing) cluster-based parallel architecture. In addition, we present data insertion, range query processing and k-NN query processing algorithms which are suitable for the SN architecture. Finally, we show that our P-CBF scheme achieves good retrieval performance in proportion to the number of servers in the SN architecture and that it outperforms a parallel version of the VA-File when the dimensionality is over 10.
机译：为了在数据仓库和多媒体数据库应用中有效地检索高维数据，已经提出了许多高维索引结构，但是它们遭受了所谓的“维数诅咒”问题，即，随着维数的增加，检索性能会越来越差。增加。为了解决这个问题，已经提出了基于小区的滤波（CBF）方案，但是随着维数的增加，它的性能呈线性下降。在本文中，我们提出了一种使用水平分割技术的并行CBF方案，称为P-CBF，以应对检索性能的线性下降。为了实现这一目标，我们在基于SN（无共享）集群的并行架构下构造了P-CBF方案。此外，我们提出了适合SN体系结构的数据插入，范围查询处理和k-NN查询处理算法。最后，我们证明了我们的P-CBF方案与SN架构中的服务器数量成比例地实现了良好的检索性能，并且当维数超过10时，它的性能优于VA-File的并行版本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号