首页> 外文会议>2015 IEEE Conference on Collaboration and Internet Computing >Hike: A High Performance kNN Query Processing System for Multimedia Data
【24h】

Hike: A High Performance kNN Query Processing System for Multimedia Data

机译:Hike:一种用于多媒体数据的高性能kNN查询处理系统

获取原文
获取原文并翻译 | 示例

摘要

Internet continues to serve as the dominating platform for sharing and delivering multimedia contents. kNN queries are an enabling functionality for many multimedia applications. However, scaling kNN queries over large highdimensional multimedia datasets remains challenging. In this paper we present Hike, a high performance multimedia kNN query processing system, it integrate the proposed novel Distance-Precomputation based R-tree (DPR-Tree) index structure, coupled with the fast distance based pruning methods. This unique coupling improves the computational performance of kNN search and consequently reducing I/O cost. Since Hike's index structure DPR-Tree by design generates two types of query independent precomputed distances during the index construction, and it can intelligently utilizes the precomputed distances to design a suite of computationally inexpensive pruning techniques, which make the Hike system can filter out irrelevant index nodes and data objects, and minimize the amount of duplicate computations among different kNN queries.We conduct an extensive experimental evaluation using real-life web multimedia datasets. Our results show that DPRTree indexing coupled with precomputed distance based query processing make the Hike system can significantly reduce the overall cost of kNN search, and is much faster than the existing representative methods.
机译:Internet继续充当共享和交付多媒体内容的主要平台。 kNN查询是许多多媒体应用程序的启用功能。然而,在大型高维多媒体数据集上扩展kNN查询仍然具有挑战性。在本文中,我们提出了一种高性能的多媒体kNN查询处理系统Hike,该系统集成了提出的新颖的基于距离预计算的R树(DPR-Tree)索引结构,并结合了基于快速距离的修剪方法。这种独特的耦合提高了kNN搜索的计算性能,从而降低了I / O成本。由于Hike的索引结构DPR-Tree在设计时会在索引构建期间生成两种类型的查询独立的预先计算的距离,并且它可以智能地利用预先计算的距离来设计一套计算上便宜的修剪技术,这使Hike系统可以过滤掉不相关的索引节点和数据对象,并最大程度地减少了不同kNN查询之间的重复计算量。我们使用真实的网络多媒体数据集进行了广泛的实验评估。我们的结果表明,DPRTree索引与基于预先计算的距离的查询处理相结合,使Hike系统可以显着降低kNN搜索的总体成本,并且比现有的代表性方法要快得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号