Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries
Identifieur interne : 000861 ( Main/Curation ); précédent : 000860; suivant : 000862Efficient Search and Approximate Information Filtering in a Distributed Peer-to-Peer Environment of Digital Libraries
Auteurs : Christian Zimmer [Allemagne] ; Christos Tryfonopoulos [Allemagne] ; Gerhard Weikum [Allemagne]Source :
- 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 toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000555
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :000525
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000675
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :000861
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>
</author>
<author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name>
</author>
<author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
</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>
<idno type="wicri:Area/Istex/Curation">000525</idno>
<idno type="wicri:Area/Istex/Checkpoint">000675</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000675</idno>
<idno type="wicri:doubleKey">0302-9743:2007:Zimmer C:efficient:search:and</idno>
<idno type="wicri:Area/Main/Merge">000861</idno>
<idno type="wicri:Area/Main/Curation">000861</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 wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department for Databases and Information Systems, Max-Planck-Institute for Informatics, 66123 Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</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>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000861 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 000861 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Sarre |area= MusicSarreV3 |flux= Main |étape= Curation |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. |