Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
Identifieur interne : 000074 ( Istex/Corpus ); précédent : 000073; suivant : 000075Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
Auteurs : Gerhard WeikumSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
English descriptors
- Teeft :
- Aggregated, Aggregation, Aggregation queries, Algorithm, Algorithmic building blocks, Autonomous peers, Bird watchers, Business model, Business models, Centralized anything, Centralized data centers, Centralized search engine, Clickthrough fraud, Collection selection, Data centers, Data item, Data items, Decentralized, Decentralized algorithm, Different peers, Epidemic dissemination, Expander graph, Future opportunities, Global, Hash, Hash sketches, Hash tables, Heidelberg, High dynamics, High probability, Index lists, Individual peers, Information retrieval, Internet, Inverted list, Inverted lists, Klee family, Large user community, Last decade, Link analyses, Link analysis, Many peers, Many users, Multiple peers, Network size, Other forms, Other hand, Other peers, Overall content, Overlay, Overlay network, Pagerank, Peer, Peer failures, Personal data, Privacy concerns, Provider, Query, Query processing, Random graphs, Range queries, Result candidates, Retrieval, Scalable, Search engine, Search engines, Search network, Search results, Semantic overlay networks, Small number, Social networks, Spectral analysis, Statistical computations, Successful systems, Syst, Target peers, Total number, Unstructured overlay, User, Various forms, Various kinds, Various reasons, Weikum.
Abstract
Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.
Url:
DOI: 10.1007/978-3-642-17226-7_12
Links to Exploration step
ISTEX:0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Max-Planck Institute for Informatics, Saarbruecken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@mpi-inf.mpg.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-17226-7_12</idno><idno type="url">https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000074</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000074</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Max-Planck Institute for Informatics, Saarbruecken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@mpi-inf.mpg.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Aggregated</term><term>Aggregation</term><term>Aggregation queries</term><term>Algorithm</term><term>Algorithmic building blocks</term><term>Autonomous peers</term><term>Bird watchers</term><term>Business model</term><term>Business models</term><term>Centralized anything</term><term>Centralized data centers</term><term>Centralized search engine</term><term>Clickthrough fraud</term><term>Collection selection</term><term>Data centers</term><term>Data item</term><term>Data items</term><term>Decentralized</term><term>Decentralized algorithm</term><term>Different peers</term><term>Epidemic dissemination</term><term>Expander graph</term><term>Future opportunities</term><term>Global</term><term>Hash</term><term>Hash sketches</term><term>Hash tables</term><term>Heidelberg</term><term>High dynamics</term><term>High probability</term><term>Index lists</term><term>Individual peers</term><term>Information retrieval</term><term>Internet</term><term>Inverted list</term><term>Inverted lists</term><term>Klee family</term><term>Large user community</term><term>Last decade</term><term>Link analyses</term><term>Link analysis</term><term>Many peers</term><term>Many users</term><term>Multiple peers</term><term>Network size</term><term>Other forms</term><term>Other hand</term><term>Other peers</term><term>Overall content</term><term>Overlay</term><term>Overlay network</term><term>Pagerank</term><term>Peer</term><term>Peer failures</term><term>Personal data</term><term>Privacy concerns</term><term>Provider</term><term>Query</term><term>Query processing</term><term>Random graphs</term><term>Range queries</term><term>Result candidates</term><term>Retrieval</term><term>Scalable</term><term>Search engine</term><term>Search engines</term><term>Search network</term><term>Search results</term><term>Semantic overlay networks</term><term>Small number</term><term>Social networks</term><term>Spectral analysis</term><term>Statistical computations</term><term>Successful systems</term><term>Syst</term><term>Target peers</term><term>Total number</term><term>Unstructured overlay</term><term>User</term><term>Various forms</term><term>Various kinds</term><term>Various reasons</term><term>Weikum</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>query</json:string><json:string>weikum</json:string><json:string>algorithm</json:string><json:string>decentralized</json:string><json:string>scalable</json:string><json:string>pagerank</json:string><json:string>internet</json:string><json:string>syst</json:string><json:string>aggregated</json:string><json:string>provider</json:string><json:string>different peers</json:string><json:string>aggregation</json:string><json:string>peer</json:string><json:string>social networks</json:string><json:string>overlay network</json:string><json:string>hash</json:string><json:string>overlay</json:string><json:string>autonomous peers</json:string><json:string>total number</json:string><json:string>link analysis</json:string><json:string>hash sketches</json:string><json:string>user</json:string><json:string>retrieval</json:string><json:string>heidelberg</json:string><json:string>target peers</json:string><json:string>individual peers</json:string><json:string>high probability</json:string><json:string>data items</json:string><json:string>multiple peers</json:string><json:string>search engine</json:string><json:string>statistical computations</json:string><json:string>index lists</json:string><json:string>search results</json:string><json:string>other peers</json:string><json:string>search engines</json:string><json:string>business model</json:string><json:string>privacy concerns</json:string><json:string>large user community</json:string><json:string>personal data</json:string><json:string>various forms</json:string><json:string>epidemic dissemination</json:string><json:string>business models</json:string><json:string>hash tables</json:string><json:string>search network</json:string><json:string>collection selection</json:string><json:string>many peers</json:string><json:string>centralized anything</json:string><json:string>high dynamics</json:string><json:string>other hand</json:string><json:string>various reasons</json:string><json:string>network size</json:string><json:string>peer failures</json:string><json:string>centralized search engine</json:string><json:string>last decade</json:string><json:string>data item</json:string><json:string>other forms</json:string><json:string>inverted list</json:string><json:string>inverted lists</json:string><json:string>random graphs</json:string><json:string>expander graph</json:string><json:string>overall content</json:string><json:string>data centers</json:string><json:string>algorithmic building blocks</json:string><json:string>aggregation queries</json:string><json:string>successful systems</json:string><json:string>result candidates</json:string><json:string>range queries</json:string><json:string>klee family</json:string><json:string>small number</json:string><json:string>semantic overlay networks</json:string><json:string>spectral analysis</json:string><json:string>future opportunities</json:string><json:string>link analyses</json:string><json:string>decentralized algorithm</json:string><json:string>unstructured overlay</json:string><json:string>bird watchers</json:string><json:string>centralized data centers</json:string><json:string>information retrieval</json:string><json:string>various kinds</json:string><json:string>clickthrough fraud</json:string><json:string>many users</json:string><json:string>query processing</json:string><json:string>global</json:string></teeft></keywords><author><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute for Informatics, Saarbruecken, Germany</json:string><json:string>E-mail: weikum@mpi-inf.mpg.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</abstract><qualityIndicators><score>9.5</score><pdfWordCount>6768</pdfWordCount><pdfCharCount>41029</pdfCharCount><pdfVersion>1.6</pdfVersion><pdfPageCount>14</pdfPageCount><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>319</abstractWordCount><abstractCharCount>2145</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title><chapterId><json:string>12</json:string><json:string>Chap12</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2010</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor></serie><host><title>From Active Data Management to Event-Based Systems and More</title><language><json:string>unknown</json:string></language><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-17226-7</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-642-17226-7</json:string></eisbn><bookId><json:string>978-3-642-17226-7</json:string></bookId><isbn><json:string>978-3-642-17225-0</json:string></isbn><volume>6462</volume><pages><first>195</first><last>208</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Kai Sachs</name><affiliations><json:string>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</json:string><json:string>E-mail: Sachs@dvs.tu-darmstadt.de</json:string></affiliations></json:item><json:item><name>Ilia Petrov</name><affiliations><json:string>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</json:string><json:string>E-mail: ilia.petrov@dvs.tu-darmstadt.de</json:string></affiliations></json:item><json:item><name>Pablo Guerrero</name><affiliations><json:string>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</json:string><json:string>E-mail: guerrero@dvs.tu-darmstadt.de</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item></subject></host><categories><inist><json:string>sciences humaines et sociales</json:string></inist></categories><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-17226-7_12</json:string></doi><id>0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title><author xml:id="author-0000"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><email>weikum@mpi-inf.mpg.de</email><affiliation>Max-Planck Institute for Informatics, Saarbruecken, Germany</affiliation></author><idno type="istex">0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76</idno><idno type="DOI">10.1007/978-3-642-17226-7_12</idno><idno type="ChapterID">12</idno><idno type="ChapterID">Chap12</idno></analytic><monogr><title level="m">From Active Data Management to Event-Based Systems and More</title><title level="m" type="sub">Papers in Honor of Alejandro Buchmann on the Occasion of His 60th Birthday</title><idno type="DOI">10.1007/978-3-642-17226-7</idno><idno type="pISBN">978-3-642-17225-0</idno><idno type="eISBN">978-3-642-17226-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-ID">215016</idno><idno type="book-ID">978-3-642-17226-7</idno><idno type="book-chapter-count">20</idno><idno type="book-volume-number">6462</idno><idno type="book-sequence-number">6462</idno><idno type="PartChapterCount">3</idno><editor xml:id="book-author-0000"><persName><forename type="first">Kai</forename><surname>Sachs</surname></persName><email>Sachs@dvs.tu-darmstadt.de</email><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation></editor><editor xml:id="book-author-0001"><persName><forename type="first">Ilia</forename><surname>Petrov</surname></persName><email>ilia.petrov@dvs.tu-darmstadt.de</email><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation></editor><editor xml:id="book-author-0002"><persName><forename type="first">Pablo</forename><surname>Guerrero</surname></persName><email>guerrero@dvs.tu-darmstadt.de</email><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6462</biblScope><biblScope unit="page" from="195">195</biblScope><biblScope unit="page" to="208">208</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I13022</label><item><term>Computer Communication Networks</term></item><label>I18040</label><item><term>Information Systems Applications (incl.Internet)</term></item><label>I14029</label><item><term>Software Engineering</term></item><label>I21017</label><item><term>Artificial Intelligence (incl. Robotics)</term></item><label>I18032</label><item><term>Information Storage and Retrieval</term></item><label>I16021</label><item><term>Algorithm Analysis and Problem Complexity</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Commemorative publication" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-17226-7</BookID><BookTitle>From Active Data Management to Event-Based Systems and More</BookTitle><BookSubTitle>Papers in Honor of Alejandro Buchmann on the Occasion of His 60th Birthday</BookSubTitle><BookVolumeNumber>6462</BookVolumeNumber><BookSequenceNumber>6462</BookSequenceNumber><BookDOI>10.1007/978-3-642-17226-7</BookDOI><BookTitleID>215016</BookTitleID><BookPrintISBN>978-3-642-17225-0</BookPrintISBN><BookElectronicISBN>978-3-642-17226-7</BookElectronicISBN><BookChapterCount>20</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I13022" Priority="1" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I21017" Priority="4" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18032" Priority="5" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I16021" Priority="6" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Kai</GivenName><FamilyName>Sachs</FamilyName></EditorName><Contact><Email>Sachs@dvs.tu-darmstadt.de</Email></Contact></Editor><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Ilia</GivenName><FamilyName>Petrov</FamilyName></EditorName><Contact><Email>ilia.petrov@dvs.tu-darmstadt.de</Email></Contact></Editor><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Pablo</GivenName><FamilyName>Guerrero</FamilyName></EditorName><Contact><Email>guerrero@dvs.tu-darmstadt.de</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>FB Informatik/DVS</OrgDivision><OrgName>Technische Universität</OrgName><OrgAddress><Street>Hochschulstraße 10</Street><Postcode>64289</Postcode><City>Darmstadt</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part4"><PartInfo TocLevels="0"><PartID>4</PartID><PartSequenceNumber>4</PartSequenceNumber><PartTitle>Peer-to-Peer</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>From Active Data Management to Event-Based Systems and More</BookTitle></PartContext></PartInfo><Chapter ID="Chap12" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>12</ChapterID><ChapterDOI>10.1007/978-3-642-17226-7_12</ChapterDOI><ChapterSequenceNumber>12</ChapterSequenceNumber><ChapterTitle Language="En">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</ChapterTitle><ChapterFirstPage>195</ChapterFirstPage><ChapterLastPage>208</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>4</PartID><BookID>978-3-642-17226-7</BookID><BookTitle>From Active Data Management to Event-Based Systems and More</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></AuthorName><Contact><Email>weikum@mpi-inf.mpg.de</Email></Contact></Author><Affiliation ID="Aff17"><OrgName>Max-Planck Institute for Informatics</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing.</Para><Para>Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines.</Para><Para>Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute for Informatics, Saarbruecken, Germany</affiliation><affiliation>E-mail: weikum@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</abstract><relatedItem type="host"><titleInfo><title>From Active Data Management to Event-Based Systems and More</title><subTitle>Papers in Honor of Alejandro Buchmann on the Occasion of His 60th Birthday</subTitle></titleInfo><name type="personal"><namePart type="given">Kai</namePart><namePart type="family">Sachs</namePart><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation><affiliation>E-mail: Sachs@dvs.tu-darmstadt.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Ilia</namePart><namePart type="family">Petrov</namePart><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation><affiliation>E-mail: ilia.petrov@dvs.tu-darmstadt.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Pablo</namePart><namePart type="family">Guerrero</namePart><affiliation>FB Informatik/DVS, Technische Universität, Hochschulstraße 10, 64289, Darmstadt, Germany</affiliation><affiliation>E-mail: guerrero@dvs.tu-darmstadt.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Commemorative publication"></genre><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic></subject><identifier type="DOI">10.1007/978-3-642-17226-7</identifier><identifier type="ISBN">978-3-642-17225-0</identifier><identifier type="eISBN">978-3-642-17226-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">215016</identifier><identifier type="BookID">978-3-642-17226-7</identifier><identifier type="BookChapterCount">20</identifier><identifier type="BookVolumeNumber">6462</identifier><identifier type="BookSequenceNumber">6462</identifier><identifier type="PartChapterCount">3</identifier><part><date>2010</date><detail type="part"><title>Peer-to-Peer</title></detail><detail type="volume"><number>6462</number><caption>vol.</caption></detail><extent unit="pages"><start>195</start><end>208</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76</identifier><identifier type="DOI">10.1007/978-3-642-17226-7_12</identifier><identifier type="ChapterID">12</identifier><identifier type="ChapterID">Chap12</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000074 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000074 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76
|texte= Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
}}
| This area was generated with Dilib version V0.6.33. |  |