Distributed Spatial Databases
Distributed spatial databases belong to the broad category of distributed database systems. Data reside in more than one sites interconnected by a network, and query processing may involve several sites. A site can be anything from a server to a small mobile device. The broad definition covers many research areas. This entry gives an overview of the following sub-categories: (i) Distributed spatial query processing, which focuses mainly on spatial joins. (ii) Distributed spatial indexes (e.g., a distributed version of the R-tree). (iii) Spatial queries in large distributed systems formed by devices such as PDAs, mobile phones, or even sensor networks.
Similar to relational databases, in spatial databases the most important operator is the spatial join. In relational databases, distributed joins are often implemented by using the semijoin operator. Let R and S be relations residing in two different sites Rsite and Ssite. First Rsite calculates R′ which...
- 2.Coman A, Nascimento MA, Sander J. Exploiting redundancy in sensor networks for energy efficient processing of spatiotemporal region queries. In: Proceedings of the International Conference on Information and Knowledge Management; 2005. p. 187–94.Google Scholar
- 4.Jagadish HV, Ooi BC, Vu QH, Zhang R, Zhou A. VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proceedings of the 22nd International Conference on Data Engineering; 2006.Google Scholar
- 5.Kalnis P, Mamoulis N, Bakiras S, Li X. Ad-hoc distributed spatial joins on mobile devices. In: Proceedings of the 20th International Parallel & Distributed Processing Symposium; 2006.Google Scholar
- 6.Kantere V, Sellis TK. A study for the parameters of a distributed framework that handles spatial areas. In: Proceedings of the 10th International Symposium on Advances in Spatial and Temporal Databases; 2007. p. 385–402.Google Scholar
- 7.Karlsson JS. hQT*: a scalable distributed data structure for high-performance spatial accesses. In: Proceedings of the International Conference of Foundations of Data Organization; 1998. p. 37–46.Google Scholar
- 8.Litwin W, Neimat M-A. k-RP*S: a scalable distributed data structure for high-performance multi-attribute access. In: Proceedings of the International Conference on Parallel and Distributed Information Systems; 1996. p. 120–31.Google Scholar
- 9.Liu D-Z, Lim E-P, Ng W-K. Efficient k nearest neighbor queries on remote spatial databases using range estimation. In: Proceedings of the 14th International Conference on Scientific and Statistical Database Management; 2002. p. 121–30.Google Scholar
- 12.du Mouza C, Litwin W, Rigaux P. SD-Rtree: a scalable distributed Rtree. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 296–305.Google Scholar
- 15.Zheng B, Lee W-C, Lee DL. Search continuous nearest neighbor on air. In: Proceedings of the International Conference on Mobile and Ubiquitous Systems: Networking and Services; 2004. p. 236–45.Google Scholar