Query workload-aware overlay construction using histograms

Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected with a small number of other nodes thus creating an overlay network of nodes. A query posed at a node is routed through the overlay network towards nodes hosting data items that satisfy it. In this paper, we consider building overlays that exploit the query workload so that nodes are clustered based on their results to a given query workload. The motivation is to create overlays where nodes that match a large number of similar queries are a few links apart. Query frequency is also taken into account so that popular queries have a greater effect on the formation of the overlay than unpopular ones. We focus on range selection queries and use histograms to estimate the query results of each node. Then, nodes are clustered based on the similarity of their histograms. To this end, we introduce a workloadaware ed...

• Type: Conference
• Year: 2005
• Where: CIKM
• Authors: Georgia Koloniari, Yannis Petrakis, Evaggelia Pitoura, Thodoris Tsotsos
• Keywords: CIKM 2005, Overlay Network, Overlays, Query Workload