Home
Tags
No Tags
NEAREST NEIGHBOR SEARCH IN DISTRIBUTED DATABASES
| Title: | NEAREST NEIGHBOR SEARCH IN DISTRIBUTED DATABASES |
| Author: | KUMAR, SUSMIT |
| Description: | The pair of nearest neighbors in a given set S of n data points in d-dimensional space in distributed databases can be found by Centralized and Decomposable methods. In the Centralized method, all the data points are brought to one computer and then computations are done to find to the pair of nearest neighbors. A new decomposable algorithm has been developed to find a pair of nearest neighbors in a given set S of n data points in d-dimensional space in distributed databases. In this algorithm, individual computers also perform significant amount of computation as compared to the brute force or Centralized method. This results in less transmission of data. Results based on the proposed algorithm are found to give same result as the brute force method. |
| Permanent Link: |
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1022879916
http://hdl.handle.net/2374.OX/12177 |
| Date: | 2002 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||