Distributed Searching of Multi-dimensional Data: A Performance Evaluation Study |
| |
Affiliation: | 1. Department of Automation, Tsinghua University, Beijing, 100084, China;2. Beijing National Research Center for Information Science and Technology, 100084, China;1. Gynecologic Oncology Unit, Buenos Aires University Hospital, Buenos Aires, Argentina;2. Department of Obstetrics and Gynecology, All India Institute of Medical Sciences, New Delhi, India;3. Department of Radiation Oncology, Sunnybrook Health Sciences Center, Odette Cancer Centre, Toronto, Ontario, Canada |
| |
Abstract: | 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 ofk-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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|