Name
Abstract | ||
|---|---|---|
The paper presents a complete framework for spa- tial indexing support in a distributed setting. We consider a shared-nothing environment where a set of servers provides independent storage and com- putational services. Servers only communicate through point-to-point messaging, and constitute a non-structured network (i.e., non-central server or "super peer"). These features cover two popular ar- chitectures, namely a strongly connected cluster of servers, and P2P networks. Our proposal extends the recently proposed "Scal- able Distributed Rtree (SD-Rtree)" structure with new algorithms and protocols. More specifically, we introduce a nearest-neighbors algorithm, a load bal- ancing method and a termination protocol. The result constitutes a set of functionalities for distributed spa- tial indexing that matches those commonly found in centralized architectures. |
Year | Venue | Keywords |
|---|---|---|
2007 | BDA | share-nothing architecture.,storage balancing,. distributed index,point to point,indexation,nearest neighbor,spatial index |
Field | DocType | Citations |
Computer science,Load balancing (computing),Server,Search engine indexing,Shared nothing architecture,Strongly connected component,Scalable distributed,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cédric du Mouza | 1 | 100 | 14.67 |
| Witold Litwin | 2 | 1937 | 928.21 |
| Philippe Rigaux | 3 | 444 | 110.71 |