P2P-DIET: One-Time and Continuous Queries in Super-Peer Networks

  • Stratos Idreos
  • Manolis Koubarakis
  • Christos Tryfonopoulos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)


In peer-to-peer (P2P) systems a very large number of autonomous computing nodes (the peers) pool together their resources and rely on each other for data and services. P2P systems are application level virtual or overlay networks that have emerged as a natural way to share data and resources. The main application scenario considered in recent P2P data sharing systems is that of one-time querying: a user poses a query (e.g., “I want music by Moby”) and the system returns a list of pointers to matching files owned by various peers in the network. Then, the user can go ahead and download files of interest. The complementary scenario of selective dissemination of information (SDI) or selective information push is also very interesting. In an SDI scenario, a user posts a continuous query to the system to receive notifications whenever certain resources of interest appear in the system (e.g., when a song of Moby becomes available). SDI can be as useful as one-time querying in many target applications of P2P networks ranging from file sharing, to more advanced applications such as alert systems for digital libraries, e-commerce networks etc.


Access Point Digital Library Overlay Network Continuous Query Language Agent Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a widearea event notification service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)CrossRefGoogle Scholar
  2. 2.
    Tryfonopoulos, C., Koubarakis, M.: Selective Dissemination of Information in P2P Networks: Data Models, Query Languages, Algorithms and Computational Complexity. Technical Report TUC-ISL-02-2003, Intelligent Systems Laboratory, Dept. of Electronic and Computer Engineering, Technical University of Crete (July 2003)Google Scholar
  3. 3.
    Koubarakis, M., Tryfonopoulos, C., Idreos, S., Drougas, Y.: Selective Information Dissemination in P2P Networks: Problems and Solutions. In: Aberer, K. (ed.) ACM SIGMOD Record, Special issue on Peer-to-Peer Data Management, vol. 32(3) (September 2003)Google Scholar
  4. 4.
    Koubarakis, M., Koutris, T., Tryfonopoulos, C., Raftopoulou, P.: Information Alert in Distributed Digital Libraries: The Models, Languages and Architecture of DIAS. In: Agosti, M., Thanos, C. (eds.) ECDL 2002. LNCS, vol. 2458, pp. 527–542. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Idreos, S., Koubarakis, M.: P2P-DIET: A Query and Notification Service Based on Mobile Agents for Rapid Implementation of P2P Applications. Technical Report TUC-ISL-01-2003, Intelligent Systems Laboratory, Dept. of Electronic and Computer Engineering, Technical University of Crete (June 2003)Google Scholar
  6. 6.
    Yan, T.W., Garcia-Molina, H.: Index structures for selective dissemination of information under the boolean model. ACM Transactions on Database Systems 19(2), 332–364 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Stratos Idreos
    • 1
  • Manolis Koubarakis
    • 1
  • Christos Tryfonopoulos
    • 1
  1. 1.Dept. of Electronic and Computer EngineeringTechnical University of CreteChaniaGreece

Personalised recommendations