Multi-set DHT for Range Queries on Dynamic Data for Grid Information Service

  • Georges Da Costa
  • Salvatore Orlando
  • Marios D. Dikaiakos
Conference paper

DOI: 10.1007/978-3-540-85176-9_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5187)
Cite this paper as:
Da Costa G., Orlando S., Dikaiakos M.D. (2008) Multi-set DHT for Range Queries on Dynamic Data for Grid Information Service. In: Hameurlain A. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2008. Lecture Notes in Computer Science, vol 5187. Springer, Berlin, Heidelberg


Scalability is a fundamental problem for information systems when the amount of managed data increases. Peer to Peer systems are usually used to solve scalability problems as centralized approaches do not scale without large dedicated infrastructure. But most current Peer to Peer systems do not take into account that indexed data can be dynamic. Thus, we propose the Multi-set approach, which aims to find the best trade-off between DHT-based network and total replication. This approach is built over classical DHT Peer to Peer system. It can improve most of pure DHT Peer to Peer system by taking into account the dynamism of indexed data. Evaluation is done by modeling, simulation and experimentation on PlanetLab. The use case is an information service for Grid, where resource attributes are indexed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Georges Da Costa
    • 1
  • Salvatore Orlando
    • 2
  • Marios D. Dikaiakos
    • 3
  1. 1.IRITUniversite Paul Sabatier, Toulouse IIIFrance
  2. 2.Department of Computer ScienceCa’ Foscari University of VeniceItaly
  3. 3.Department of Computer ScienceUniversity of CyprusNicosiaCyprus

Personalised recommendations