Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries
Identifieur interne : 000555 ( Istex/Corpus ); précédent : 000554; suivant : 000556Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries
Auteurs : Christian Zimmer ; Christos Tryfonopoulos ; Gerhard WeikumSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
English descriptors
- Teeft :
- Algorithm, Approximate functionality, Approximate information, Bingo, Common properties, Continuous queries, Continuous query, Digital, Digital libraries, Digital library, Directory, Directory service, Exact information, Experimental evaluation, Experimental results, Global directory, Hash table, Local indexes, Local search index, Ltering, Ltering system, Maps information, Minerva, Minervalight, Minervalight search system, Model peer behavior, News items, Overlay, Overlay network, Overlay networks, Pagerank scores, Particular term, Peer, Peer document frequency, Peer selection, Peer statistics, Prediction mechanism, Promising peers, Publication service, Publishing behavior, Publishing rate, Query, Randomized subset, Relevant documents, Resource selection, Resource selection algorithms, Result quality, Same directory, Same infrastructure, Search engine, Selection process, System architecture, System properties, Time period, Time series data, Total number, Tryfonopoulos, User, User query, Weikum, Zimmer.
Abstract
Abstract: We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The MinervaLight search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the MAPS information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.
Url:
DOI: 10.1007/978-3-540-77088-6_32
Links to Exploration step
ISTEX:35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title><author><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: czimmer@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: trifon@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, 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:35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-77088-6_32</idno><idno type="url">https://api.istex.fr/document/35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000555</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000555</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title><author><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: czimmer@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: trifon@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, 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>2007</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>Algorithm</term><term>Approximate functionality</term><term>Approximate information</term><term>Bingo</term><term>Common properties</term><term>Continuous queries</term><term>Continuous query</term><term>Digital</term><term>Digital libraries</term><term>Digital library</term><term>Directory</term><term>Directory service</term><term>Exact information</term><term>Experimental evaluation</term><term>Experimental results</term><term>Global directory</term><term>Hash table</term><term>Local indexes</term><term>Local search index</term><term>Ltering</term><term>Ltering system</term><term>Maps information</term><term>Minerva</term><term>Minervalight</term><term>Minervalight search system</term><term>Model peer behavior</term><term>News items</term><term>Overlay</term><term>Overlay network</term><term>Overlay networks</term><term>Pagerank scores</term><term>Particular term</term><term>Peer</term><term>Peer document frequency</term><term>Peer selection</term><term>Peer statistics</term><term>Prediction mechanism</term><term>Promising peers</term><term>Publication service</term><term>Publishing behavior</term><term>Publishing rate</term><term>Query</term><term>Randomized subset</term><term>Relevant documents</term><term>Resource selection</term><term>Resource selection algorithms</term><term>Result quality</term><term>Same directory</term><term>Same infrastructure</term><term>Search engine</term><term>Selection process</term><term>System architecture</term><term>System properties</term><term>Time period</term><term>Time series data</term><term>Total number</term><term>Tryfonopoulos</term><term>User</term><term>User query</term><term>Weikum</term><term>Zimmer</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The MinervaLight search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the MAPS information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>minervalight</json:string><json:string>query</json:string><json:string>ltering</json:string><json:string>continuous query</json:string><json:string>digital library</json:string><json:string>weikum</json:string><json:string>digital libraries</json:string><json:string>approximate information</json:string><json:string>zimmer</json:string><json:string>tryfonopoulos</json:string><json:string>resource selection</json:string><json:string>bingo</json:string><json:string>promising peers</json:string><json:string>directory service</json:string><json:string>peer statistics</json:string><json:string>peer</json:string><json:string>overlay network</json:string><json:string>same infrastructure</json:string><json:string>algorithm</json:string><json:string>same directory</json:string><json:string>local search index</json:string><json:string>user query</json:string><json:string>result quality</json:string><json:string>total number</json:string><json:string>peer selection</json:string><json:string>user</json:string><json:string>directory</json:string><json:string>digital</json:string><json:string>system architecture</json:string><json:string>common properties</json:string><json:string>maps information</json:string><json:string>hash table</json:string><json:string>randomized subset</json:string><json:string>search engine</json:string><json:string>local indexes</json:string><json:string>pagerank scores</json:string><json:string>ltering system</json:string><json:string>approximate functionality</json:string><json:string>publication service</json:string><json:string>overlay networks</json:string><json:string>minervalight search system</json:string><json:string>time period</json:string><json:string>experimental evaluation</json:string><json:string>peer document frequency</json:string><json:string>prediction mechanism</json:string><json:string>time series data</json:string><json:string>model peer behavior</json:string><json:string>publishing rate</json:string><json:string>relevant documents</json:string><json:string>publishing behavior</json:string><json:string>resource selection algorithms</json:string><json:string>news items</json:string><json:string>selection process</json:string><json:string>global directory</json:string><json:string>experimental results</json:string><json:string>system properties</json:string><json:string>exact information</json:string><json:string>continuous queries</json:string><json:string>particular term</json:string><json:string>minerva</json:string><json:string>overlay</json:string></teeft></keywords><author><json:item><name>Christian Zimmer</name><affiliations><json:string>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</json:string><json:string>E-mail: czimmer@mpi-inf.mpg.de</json:string></affiliations></json:item><json:item><name>Christos Tryfonopoulos</name><affiliations><json:string>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</json:string><json:string>E-mail: trifon@mpi-inf.mpg.de</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, 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: We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The MinervaLight search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the MAPS information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.</abstract><qualityIndicators><score>7.262</score><pdfWordCount>3938</pdfWordCount><pdfCharCount>24498</pdfCharCount><pdfVersion>1.6</pdfVersion><pdfPageCount>10</pdfPageCount><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>152</abstractWordCount><abstractCharCount>1089</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title><chapterId><json:string>32</json:string><json:string>Chap32</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor></serie><host><title>Digital Libraries: Research and Development</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-77088-6</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-77088-6</json:string></eisbn><bookId><json:string>978-3-540-77088-6</json:string></bookId><isbn><json:string>978-3-540-77087-9</json:string></isbn><volume>4877</volume><pages><first>328</first><last>337</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Costantino Thanos</name></json:item><json:item><name>Francesca Borri</name></json:item><json:item><name>Leonardo Candela</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>User Interfaces and Human Computer Interaction</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Multimedia Information Systems</value></json:item></subject></host><categories><inist><json:string>sciences appliquees, technologies et medecines</json:string><json:string>sciences exactes et technologie</json:string><json:string>sciences appliquees</json:string><json:string>pollution</json:string></inist></categories><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-77088-6_32</json:string></doi><id>35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2007</p></availability><date>2007</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title><author xml:id="author-0000"><persName><forename type="first">Christian</forename><surname>Zimmer</surname></persName><email>czimmer@mpi-inf.mpg.de</email><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Christos</forename><surname>Tryfonopoulos</surname></persName><email>trifon@mpi-inf.mpg.de</email><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation></author><author xml:id="author-0002"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><email>weikum@mpi-inf.mpg.de</email><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation></author><idno type="istex">35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221</idno><idno type="DOI">10.1007/978-3-540-77088-6_32</idno><idno type="ChapterID">32</idno><idno type="ChapterID">Chap32</idno></analytic><monogr><title level="m">Digital Libraries: Research and Development</title><title level="m" type="sub">First International DELOS Conference, Pisa, Italy, February 13-14, 2007, Revised Selected Papers</title><idno type="DOI">10.1007/978-3-540-77088-6</idno><idno type="pISBN">978-3-540-77087-9</idno><idno type="eISBN">978-3-540-77088-6</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-ID">158450</idno><idno type="book-ID">978-3-540-77088-6</idno><idno type="book-chapter-count">33</idno><idno type="book-volume-number">4877</idno><idno type="book-sequence-number">4877</idno><idno type="PartChapterCount">3</idno><editor xml:id="book-author-0000"><persName><forename type="first">Costantino</forename><surname>Thanos</surname></persName></editor><editor xml:id="book-author-0001"><persName><forename type="first">Francesca</forename><surname>Borri</surname></persName></editor><editor xml:id="book-author-0002"><persName><forename type="first">Leonardo</forename><surname>Candela</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2007"></date><biblScope unit="volume">4877</biblScope><biblScope unit="page" from="328">328</biblScope><biblScope unit="page" to="337">337</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></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName></editor><biblScope><date>2007</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>2007</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The MinervaLight search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the MAPS information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.</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>I18024</label><item><term>Database Management</term></item><label>I18040</label><item><term>Information Systems Applications (incl.Internet)</term></item><label>I18032</label><item><term>Information Storage and Retrieval</term></item><label>I18067</label><item><term>User Interfaces and Human Computer Interaction</term></item><label>I13022</label><item><term>Computer Communication Networks</term></item><label>I18059</label><item><term>Multimedia Information Systems</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2007">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221/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><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-77088-6</BookID><BookTitle>Digital Libraries: Research and Development</BookTitle><BookSubTitle>First International DELOS Conference, Pisa, Italy, February 13-14, 2007, Revised Selected Papers</BookSubTitle><BookVolumeNumber>4877</BookVolumeNumber><BookSequenceNumber>4877</BookSequenceNumber><BookDOI>10.1007/978-3-540-77088-6</BookDOI><BookTitleID>158450</BookTitleID><BookPrintISBN>978-3-540-77087-9</BookPrintISBN><BookElectronicISBN>978-3-540-77088-6</BookElectronicISBN><BookChapterCount>33</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I18024" Priority="1" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18067" Priority="4" Type="Secondary">User Interfaces and Human Computer Interaction</BookSubject><BookSubject Code="I13022" Priority="5" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I18059" Priority="6" Type="Secondary">Multimedia Information Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Costantino</GivenName><FamilyName>Thanos</FamilyName></EditorName><Contact><Email>Costantino.Thanos@isti.cnr.it</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Francesca</GivenName><FamilyName>Borri</FamilyName></EditorName><Contact><Email>francesca.borri@isti.cnr.it</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Leonardo</GivenName><FamilyName>Candela</FamilyName></EditorName><Contact><Email>leonardo.candela@isti.cnr.it</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part10"><PartInfo TocLevels="0"><PartID>10</PartID><PartSequenceNumber>10</PartSequenceNumber><PartTitle>Peer to Peer</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Digital Libraries: Research and Development</BookTitle></PartContext></PartInfo><Chapter ID="Chap32" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>32</ChapterID><ChapterDOI>10.1007/978-3-540-77088-6_32</ChapterDOI><ChapterSequenceNumber>32</ChapterSequenceNumber><ChapterTitle Language="En">Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</ChapterTitle><ChapterFirstPage>328</ChapterFirstPage><ChapterLastPage>337</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</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>10</PartID><BookID>978-3-540-77088-6</BookID><BookTitle>Digital Libraries: Research and Development</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Christian</GivenName><FamilyName>Zimmer</FamilyName></AuthorName><Contact><Email>czimmer@mpi-inf.mpg.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Christos</GivenName><FamilyName>Tryfonopoulos</FamilyName></AuthorName><Contact><Email>trifon@mpi-inf.mpg.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></AuthorName><Contact><Email>weikum@mpi-inf.mpg.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The <Emphasis Type="Italic">MinervaLight</Emphasis> search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the <Emphasis Type="Italic">MAPS</Emphasis> information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries</title></titleInfo><name type="personal"><namePart type="given">Christian</namePart><namePart type="family">Zimmer</namePart><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation><affiliation>E-mail: czimmer@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Christos</namePart><namePart type="family">Tryfonopoulos</namePart><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation><affiliation>E-mail: trifon@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken, Germany</affiliation><affiliation>E-mail: weikum@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2007</dateIssued><copyrightDate encoding="w3cdtf">2007</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: We present a new architecture for efficient search and approximate information filtering in a distributed Peer-to-Peer (P2P) environment of Digital Libraries. The MinervaLight search system uses P2P techniques over a structured overlay network to distribute and maintain a directory of peer statistics. Based on the same directory, the MAPS information filtering system provides an approximate publish/subscribe functionality by monitoring the most promising digital libraries for publishing appropriate documents regarding a continuous query. In this paper, we discuss our system architecture that combines searching and information filtering abilities. We show the system components of MinervaLight and explain the different facets of an approximate pub/sub system for subscriptions that is high scalable, efficient, and notifies the subscribers about the most interesting publications in the P2P network of digital libraries. We also compare both approaches in terms of common properties and differences to show an overview of search and pub/sub using the same infrastructure.</abstract><relatedItem type="host"><titleInfo><title>Digital Libraries: Research and Development</title><subTitle>First International DELOS Conference, Pisa, Italy, February 13-14, 2007, Revised Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Costantino</namePart><namePart type="family">Thanos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Francesca</namePart><namePart type="family">Borri</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Leonardo</namePart><namePart type="family">Candela</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2007</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="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18067">User Interfaces and Human Computer Interaction</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I18059">Multimedia Information Systems</topic></subject><identifier type="DOI">10.1007/978-3-540-77088-6</identifier><identifier type="ISBN">978-3-540-77087-9</identifier><identifier type="eISBN">978-3-540-77088-6</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">158450</identifier><identifier type="BookID">978-3-540-77088-6</identifier><identifier type="BookChapterCount">33</identifier><identifier type="BookVolumeNumber">4877</identifier><identifier type="BookSequenceNumber">4877</identifier><identifier type="PartChapterCount">3</identifier><part><date>2007</date><detail type="part"><title>Peer to Peer</title></detail><detail type="volume"><number>4877</number><caption>vol.</caption></detail><extent unit="pages"><start>328</start><end>337</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</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><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><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><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><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><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><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><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2007</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-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><identifier type="istex">35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221</identifier><identifier type="DOI">10.1007/978-3-540-77088-6_32</identifier><identifier type="ChapterID">32</identifier><identifier type="ChapterID">Chap32</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</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 000555 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000555 | 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:35F9B4E9B28CD3BE2EF78996FCCF7ABDA743E221
|texte= Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries
}}
| This area was generated with Dilib version V0.6.33. |  |