Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10873
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPetrakis, Y.en
dc.contributor.authorKoloniari, G.en
dc.contributor.authorPitoura, E.en
dc.date.accessioned2015-11-24T17:01:07Z-
dc.date.available2015-11-24T17:01:07Z-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10873-
dc.rightsDefault Licence-
dc.titleOn using histograms as routing indexes in peer-to-peer systemsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2005-
heal.abstractPeer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of neighboring nodes. Each node uses its routing index to route a query towards those of its neighbors that provide the largest number of results. We consider using histograms as routing indexes. We describe a decentralized procedure for clustering similar nodes based on histograms. Similarity between nodes is defined based on the set of queries they match and related with the distance between their histograms. Our experimental results show that using histograms to cluster similar nodes and to route queries increases the number of results returned for a given number of nodes visited.en
heal.journalNameDatabases, Information Systems, and Peer-to-Peer Computingen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
pitoura-2004-On using histograms as routing indexes in peer-to-peer systems.pdf191.64 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons