.png){kind=icon}
返回
Fully dynamic metric access methods based on hyperplane partitioning
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2011.01.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Metric access methods based on hyperplane partitioning have the advantage, compared to the ball partitioning-based ones, that regions do not overlap. The price is less flexibility for controlling the tree shape, especially in the dynamic scenario, that is, upon insertions and deletions of objects. In this paper we introduce a technique called ghost hyperplanes, which enables fully dynamic data structures based on hyperplane partitioning. We apply the technique to Brin's GNAT static index, obtaining a dynamic variant called EGNAT, which in addition we adapt to secondary memory. We show experimentally that the EGNAT is competitive with the M-tree, the baseline for this scenario. We also apply the ghost hyperplane technique to Voronoi trees, obtaining a competitive dynamic structure for main memory. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Metric spaces
Secondary memory
Similarity search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
.png){kind=icon}
分享收藏Analyzing the Market for Shadow Education in Pakistan:
Does Private Tuition Affect the Learning Gap between
Private and Public Schools?分析巴基斯坦影子教育市场：私人补习是否影响私立学校与公立学校之间的学习差距？
OAAI
OAAI分享收藏 没有更多内容
没有更多内容