• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Dynamic Storage Balancing in a Distributed Spatial Index

Rigaux, Philippe; Litwin, Witold; du Mouza, Cédric (2007), Dynamic Storage Balancing in a Distributed Spatial Index, in Schneider, Markus; Shahabi, Cyrus; Samet, Hanan, 15th ACM International Symposium on Geographic Information Systems, ACM-GIS 2007, November 7-9, 2007, Seattle, Washington, USA, Proceedings, ACM, p. 8

View/Open
publi818.PDF (210.2Kb)
Type
Communication / Conférence
Date
2007
Conference title
15th ACM International Symposium on Advances in Geographic Information Systems (ACMGIS 2007)
Conference date
2007-11
Conference city
Seattle
Conference country
États-Unis
Book title
15th ACM International Symposium on Geographic Information Systems, ACM-GIS 2007, November 7-9, 2007, Seattle, Washington, USA, Proceedings
Book author
Schneider, Markus; Shahabi, Cyrus; Samet, Hanan
Publisher
ACM
ISBN
978-1-59593-914-2
Pages
8
Metadata
Show full item record
Author(s)
Rigaux, Philippe cc
Litwin, Witold
du Mouza, Cédric
Abstract (EN)
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 (SDRtree) [4] and addresses specifically the server allocation problem. In the classical situation, 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 allows to cope with a temporary shortage of storage resources. We analyze the cost of this protocol, describe its features, and propose practical hints to use it appropriately. Experiments are also provided and discussed.
Subjects / Keywords
datasets; spatial data; distributed system

Related items

Showing items related by title and author.

  • Thumbnail
    A Framework for Distributed Spatial Indexing in Shared-Nothing Architectures 
    du Mouza, Cedric; Litwin, Witold; Rigaux, Philippe (2007) Communication / Conférence
  • Thumbnail
    Large-scale indexing of spatial data in distributed repositories: the SD-Rtree 
    Rigaux, Philippe; Litwin, Witold; du Mouza, Cédric (2009) Article accepté pour publication ou publié
  • Thumbnail
    SD-Rtree: a Scalable Distributed Rtree 
    du Mouza, Cedric; Litwin, Witold; Rigaux, Philippe (2007) Communication / Conférence
  • Thumbnail
    AS-Index: A Structure For String Search Using n-grams and Algebraic Signatures 
    Constantin, Camelia; du Mouza, Cedric; Litwin, Witold; Rigaux, Philippe; Schwarz, Thomas (2016) Article accepté pour publication ou publié
  • Thumbnail
    AS-Index: A Structure For String Search Using n-grams and Algebraic Signatures 
    du Mouza, Cedric; Litwin, Witold; Rigaux, Philippe; Schwarz, Thomas (2009) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo