skip to main content
10.1145/1341012.1341019acmotherconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Dynamic storage balancing in a distributed spatial index

Published: 07 November 2007 Publication History

Abstract

We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-Rtree) [4] and addresses specifically the server allocation problem. In SD-Rtree, a new server is assigned to the network whenever a split of a full node is required. We describe a more flexible allocation protocol which copes with a temporary shortage of storage resources. Our algorithm is especially based on k-NN query processing we introduce as well. We analyze the cost of this protocol, describe its features, and propose practical hints to use it. We also present experiments validating our approach.

References

[1]
L. Arge, D. Eppstein, and M. T. Goodrich. Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. In PODC, pages 69--76, 2005.
[2]
A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying Peer-to-Peer Networks Using P-Trees. In WebDB, pages 25--30, 2004.
[3]
R. Devine. Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm. In FODO, 1993.
[4]
C. du Mouza, W. Litwin, and P. Rigaux. SD-Rtre: A Scalable Distributed Rtree. In ICDE, pages 296--305, 2007.
[5]
V. Gaede and O. Guenther. Multidimensional Access Methods. ACM Computing Surveys, 30(2), 1998.
[6]
U. C. B. Geography Division. Tiger/Line files, 2007. URL:http://www.census.gov/geo/www/tiger/.
[7]
A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD, pages 45--57, 1984.
[8]
H. Jagadish, B. C. Ooi, and Q. H. Vu. BATON: A Balanced Tree Structure for Peer-to-Peer Networks. In VLDB, pages 661--672, 2005.
[9]
H. Jagadish, B. C. Ooi, Q. H. Vu, R. Zhang, and A. Zhou. VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes. In ICDE, 2006.
[10]
J. S. Karlsson. hQT*: A Scalable Distributed Data Structure for High-Performance Spatial Accesses. In FODO, 1998.
[11]
V. Kriakov, A. Delis, and G. Kollios. Management of Highly Dynamic Multidimensional Data in a Cluster of Workstations. In EDBT, pages 748--764, 2004.
[12]
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH* - A Scalable, Distributed Data Structure. TODS, 21(4):480--525, 1996.
[13]
N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. In SIGMOD, 1995.
[14]
H. Samet. Foundations of Multi-dimensional Data Structures. Morgan Kaufmann Publishing, 2006.
[15]
Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento. On the Generation of Spatiotemporal Datasets. In SSD, 1999.

Cited By

View all
  • (2022)Multi-GPU Efficient Indexing For Maximizing Parallelism of High Dimensional Range Query ServicesIEEE Transactions on Services Computing10.1109/TSC.2021.307958015:5(2910-2924)Online publication date: 1-Sep-2022
  • (2010)Multi-dimensional Index on Hadoop Distributed File SystemProceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage10.1109/NAS.2010.44(240-249)Online publication date: 15-Jul-2010
  • (2009)Large-scale indexing of spatial data in distributed repositoriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0135-418:4(933-958)Online publication date: 1-Aug-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
GIS '07: Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
November 2007
439 pages
ISBN:9781595939142
DOI:10.1145/1341012
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • ESRI
  • Google Inc.
  • Oak Ridge National Laboratory
  • Microsoft: Microsoft

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. distributed index
  2. kNN-query
  3. storage balancing

Qualifiers

  • Research-article

Conference

GIS07
Sponsor:
  • Microsoft

Acceptance Rates

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Multi-GPU Efficient Indexing For Maximizing Parallelism of High Dimensional Range Query ServicesIEEE Transactions on Services Computing10.1109/TSC.2021.307958015:5(2910-2924)Online publication date: 1-Sep-2022
  • (2010)Multi-dimensional Index on Hadoop Distributed File SystemProceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage10.1109/NAS.2010.44(240-249)Online publication date: 15-Jul-2010
  • (2009)Large-scale indexing of spatial data in distributed repositoriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0135-418:4(933-958)Online publication date: 1-Aug-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media