Content-based overlay networks for XML peers based on multi-level bloom filters

Απλή σελίδα τεκμηρίου
dc.contributor.authorKoloniari, G.en
dc.contributor.authorPetrakis, Y.en
dc.contributor.authorPitoura, E.en
dc.date.accessioned2015-11-24T17:00:41Z
dc.date.available2015-11-24T17:00:41Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10803
dc.rightsDefault Licence-
dc.titleContent-based overlay networks for XML peers based on multi-level bloom filtersen
heal.abstractPeer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that store XML documents. We show how an extension of traditional Bloom filters, called multi-level Bloom filters, can be used to route path queries in such a system. In addition, we propose building content-based overlay networks by linking together peers with similar content. The similarity of the content (i.e., the local documents) of two peers is defined based on the similarity of their filters. Our experimental results show that overlay networks built based on filter similarity are very effective in retrieving a large number of relevant documents, since peers with similar content tend to be clustered together.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameDatabases, Information Systems, and Peer-to-Peer Computingen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2004-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή:
Κατεβάστε

Συλλογές

Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)