Paper Info
Title
On using histograms as routing indexes in peer-to-peer systems
Abstract
Peer-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.
Year
DOI
Venue
2004
10.1007/978-3-540-31838-5_2
DBISP2P
Keywords
Field
DocType
decentralized solution,cluster similar node,largest number,peer-to-peer system,autonomous node,decentralized procedure,routing index,user query,similar node,data structure,indexation
Edit distance,Similitude,Data structure,Data mining,Peer-to-peer,Shared memory,Computer science,Range query (data structures),Destination-Sequenced Distance Vector routing,Cluster analysis
Conference
Volume
ISSN
ISBN
3367
0302-9743
3-540-25233-9
Citations 
PageRank 
References 
17
1.04
14
Authors
3
Name
Order
Citations
PageRank
Yannis Petrakis1292.38
Georgia Koloniari222016.49
evaggelia pitoura31968321.56