A Framework for Distributed Spatial Indexing in Shared-Nothing Architectures.

作者: Cédric du Mouza , Witold Litwin , Philippe Rigaux

DOI:

关键词: Distributed computingStrongly connected componentShared nothing architectureComputer scienceScalable distributedLoad balancing (computing)ServerSearch engine indexing

摘要: The paper presents a complete framework for spatial indexing support in distributed setting. We consider shared-nothing environment where set of servers provides independent storage and computational services. Servers only communicate through point-to-point messaging, and constitute non-structured network (i.e., non-central server or "super peer"). These features cover two popular architectures, namely strongly connected cluster servers, P2P networks. Our proposal extends the recently proposed "Scalable Distributed Rtree (SD-Rtree)" structure with new algorithms protocols. More specifically, we introduce nearest-neighbors algorithm, load balancing method and termination protocol. result constitutes set of functionalities that matches those commonly found in centralized architectures.

参考文章(16)
Scott T. Leutenegger, Mario A. Lopez, Yván J. García, On Optimal Node Splitting for R-trees very large data bases. pp. 334- 344 ,(1998)
Robert Devine, Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms. pp. 101- 114 ,(1993) , 10.1007/3-540-57301-1_7
Marie-Anne Neimat, Witold Litwin, Donovan A. Schneider, RP*: A Family of Order Preserving Scalable Distributed Data Structures very large data bases. pp. 342- 353 ,(1994)
Jonas S Karlsson, HQT: a scalable distributed data structure for high-performance spatial accesses Information organization and databases. pp. 295- 312 ,(2000) , 10.1007/978-1-4615-1379-7_21
Vassil Kriakov, Alex Delis, George Kollios, Management of Highly Dynamic Multidimensional Data in a Cluster of Workstations extending database technology. pp. 748- 764 ,(2004) , 10.1007/978-3-540-24741-8_43
Yannis Theodoridis, Jefferson R. O. Silva, Mario A. Nascimento, On the Generation of Spatiotemporal Datasets Lecture Notes in Computer Science. pp. 147- 164 ,(1999) , 10.1007/3-540-48482-5_11
R. A. Finkel, J. L. Bentley, Quad trees a data structure for retrieval on composite keys Acta Informatica. ,vol. 4, pp. 1- 9 ,(1974) , 10.1007/BF00288933
Witold Litwin, Marie-Anna Neimat, Donovan A. Schneider, LH*—a scalable, distributed data structure ACM Transactions on Database Systems. ,vol. 21, pp. 480- 525 ,(1996) , 10.1145/236711.236713
Nick Roussopoulos, Stephen Kelley, Frédéric Vincent, Nearest neighbor queries international conference on management of data. ,vol. 24, pp. 71- 79 ,(1995) , 10.1145/223784.223794
Adina Crainiceanu, Prakash Linga, Johannes Gehrke, Jayavel Shanmugasundaram, Querying peer-to-peer networks using P-trees international workshop on the web and databases. pp. 25- 30 ,(2004) , 10.1145/1017074.1017082