Skip to main content

An Extensible, Distributed Simulation Environment for Peer Data Management Systems

  • Conference paper
Advances in Database Technology - EDBT 2006 (EDBT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3896))

Included in the following conference series:

Abstract

Peer Data Management Systems (PDMS) have recently attracted attention by the database community. One of the main challenges of this paradigm is the development and evaluation of indexing and query processing strategies for large-scale networks. So far, research groups working in this area build their own testing environment which first causes a huge effort and second makes it difficult to compare different strategies. In this demonstration paper, we present a simulation environment that aims to be an extensible platform for experimenting with query processing techniques in PDMS and allows for running large simulation experiments in distributed environments such as workstation clusters or even PlanetLab. In the demonstration we plan to show the evaluation of processing strategies for queries with specialized operators like top-k and skyline computation on structured data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: 22nd Int. Conf. on Distributed Computing Systems, pp. 23–32 (2002)

    Google Scholar 

  2. Tatarinov, I., Halevy, A.: Efficient query reformulation in peer data management systems. In: SIGMOD 2004, pp. 539–550 (2004)

    Google Scholar 

  3. Buchmann, E., Böhm, K.: How to Run Experiments with Large Peer-to-Peer Data Structures. In: IPDPS 2004 (2004)

    Google Scholar 

  4. Sun Microsystems, I.: JXTA v2.3.x: Java Programmer’s Guide (2005), http://www.jxta.org/docs/JxtaProgGuide_v2.3.pdf

  5. Karnstedt, M., Hose, K., Sattler, K.U.: Query Routing and Processing in Schema-Based P2P Systems. In: DEXA 2004, pp. 544–548. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  6. Karnstedt, M., Hose, K., Stehr, E.A., Sattler, K.U.: Adaptive Routing Filters for Robust Query Processing in Schema-Based P2P Systems. In: IDEAS 2005, Montreal, Canada (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hose, K., Job, A., Karnstedt, M., Sattler, KU. (2006). An Extensible, Distributed Simulation Environment for Peer Data Management Systems. In: Ioannidis, Y., et al. Advances in Database Technology - EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 3896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11687238_91

Download citation

  • DOI: https://doi.org/10.1007/11687238_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32960-2

  • Online ISBN: 978-3-540-32961-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy