.png){kind=icon}
返回
Distributed searching of multi-dimensional data: A performance evaluation study
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1998.1428.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a data structure for searching in multi-dimensional point sets in distributed environments and discuss its experimental evaluation also through a comparison with previous proposals. The data structure is based on an extension of k-d trees. The technological reference context is a distributed environment where multicast (i.e., restricted broadcast) is allowed, but it is also shown how to avoid using it. The data structure supports exact, partial, and range search queries with a complexity that is optimal in a distributed sense. The set of multidimensional points is managed in a scalable way, i.e., it can be dynamically enlarged with insertion of new points. We also propose new performance measures for the comparative evaluation of the efficiency with which a data structure is distributed over a communication network. (C) 1998 Academic Press.
Keyword:
TREES
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
.png){kind=icon}
