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 to check access.
Recommended Reading
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.
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.
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.
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.
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.
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.
Gravano L, Garcia-Molina H, Tomasic A. GlOSS: Text-source discovery over the internet. ACM Trans Database Syst. 1999;24(2):229–64.
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.
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.
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.
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.
Skobeltsyn G, Luu T, Podnar ZI, Rajman M, Aberer K. Web text retrieval with a P2P query-driven index. In: Proceedings 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; 2007. p. 679–86.
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.
Yu C, Philip G, Meng W. Distributed top-n query processing with possibly uncooperative local systems. In: Proceedings 29th International Conference on Very Large Data Bases; 2003. p. 117–28.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media LLC
About this entry
Cite this entry
Siberski, W., Nejdl, W. (2016). Approximate Queries in Peer-to-Peer Systems. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1229-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_1229-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering