Skip to main content

Approximate Queries in Peer-to-Peer Systems

  • Reference work entry
  • First Online:
  • 30 Accesses

Synonyms

Aggregate queries in P2P systems; Top-k queries in P2P systems

Definition

Peer-to-peer (P2P) networks enable the interconnection of a huge amount of information sources without imposing costs for a central coordination infrastructure. Due to the dynamic and self-organizing nature of such networks, it is not feasible to guarantee completeness and correctness as in traditional distributed databases. Therefore, P2P systems are usually applied in areas where approximate query evaluation, i.e., the computation of a nearly complete and correct answer set, is sufficient. As the most frequent application of querying in P2P is search, many of these algorithms fall into the class of top-k query algorithms. Another important case is the approximation of aggregate query results.

Historical Background

P2P networks use approximate querying from the outset. In Gnutella, an unstructured network, the query is distributed in a limited neighborhood only, thus the result is usually not complete....

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Arai B, Das G, Gunopulos D, Kalogeraki V. Efficient approximate query processing in peer-to-peer networks. IEEE Trans Knowl Data Eng. 2007;19(7):919–33.

    Article  Google Scholar 

  2. Balke WT, Nejdl W, Siberski W, Thaden U. Progressive distributed top-k retrieval in peer-to-peer networks. In: Proceedings of the 21st International Conference on Data Engineering; 2005. p. 174–85.

    Google Scholar 

  3. Bender M, Michel S, Triantafillou P, Weikum G, Zimmer C. MINERVA: collaborative P2P search. In: Proceedings of the 31st International Conference on Very Large Data Bases; 2005. p. 1263–6.

    Google Scholar 

  4. Callan JP, Lu Z, Croft WB. Searching distributed collections with inference networks. In: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; 1995. p. 21–8.

    Google Scholar 

  5. Chu D, Deshpande A, Hellerstein JM, Hong W. Approximate data collection in sensor networks using probabilistic models. In: Proceedings of the 22nd International Conference on Data Engineering; 2006. p. 48.

    Google Scholar 

  6. Cuenca-Acuna FM, Peery C, Martin RP, Nguyen RD. Planet P: using gossiping to build content addressable peer-to-peer information sharing communities. In: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing; 2003. p. 236–46.

    Google Scholar 

  7. Gravano L, Garcia-Molina H, Tomasic A. GlOSS: Text-source discovery over the internet. ACM Trans Database Syst. 1999;24(2):229–64.

    Article  Google Scholar 

  8. Hellerstein JM, Condie T, Garofalakis MN, Loo BT, Maniatis P, Roscoe T, Taft N. Public health for the internet (PHI). In: Proceedings of the 3rd Biennial Conference on Innovative Data Systems Research; 2007. p. 332–40.

    Google Scholar 

  9. Michel S, Triantafillou P, Weikum G. Klee: a framework for distributed top-k query algorithms. In: Proceedings of the 31st International Conference on Very Large Data Bases; 2005. p. 637–48.

    Google Scholar 

  10. Ntarmos N, Triantafillou P, Weikum G. Counting at large: efficient cardinality estimation in internet-scale data networks. In: Proceedings of the 22nd International Conference on Data Engineering; 2006. p. 40.

    Google Scholar 

  11. Seshadri S, Cooper BF. Routing queries through a peer-to-peer infobeacons network using information retrieval techniques. IEEE Trans Parallel Distrib Syst. 2007;18(12):1754–65.

    Article  Google Scholar 

  12. Skobeltsyn G, Luu T, Podnar ZI, Rajman M, Aberer K. Web text retrieval with a P2P query-driven index. In: Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; 2007. p. 679–86.

    Google Scholar 

  13. Suel T, Mathur C, Wu J, Zhang J, Delis A, Kharrazi M, Long X, Shanmugasundaram K. ODISSEA: a peer-to-peer architecture for scalable web search and information retrieval. In: Proceedings of the 6th International Workshop on the World Wide Web and Databases; 2003. p. 67–72.

    Google Scholar 

  14. Yu C, Philip G, Meng W. Distributed top-n query processing with possibly uncooperative local systems. In: Proceedings of the 29th International Conference on Very Large Data Bases; 2003. p. 117–28.

    Chapter  Google Scholar 

  15. Zimmer C, Tryfonopoulos C, Weikum G. MinervaDL: an architecture for information retrieval and filtering in distributed digital libraries. In: Proceedings of the 11th European Conference on Research and Advanced Technology for Digital Libraries; 2007. p. 148–60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wolf Siberski .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Siberski, W., Nejdl, W. (2018). Approximate Queries in Peer-to-Peer Systems. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1229

Download citation

Publish with us

Policies and ethics