Multidimensional routing indices for efficient distributed query processing

Authors:
Christos Doulkeridis;Akrivi Vlachou;Kjetil Nørvåg;Yannis Kotidis;Michalis Vazirgiannis
Affiliations:
Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway;Athens University of Economics and Business, Athens, Greece;Athens University of Economics and Business, Athens, Greece
Venue:
Proceedings of the 18th ACM conference on Information and knowledge management
Year:
2009

Citing 11
Cited 2

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional access methods

ACM Computing Surveys (CSUR)
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
One torus to rule them all: multi-dimensional queries in P2P systems

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Processing relaxed skylines in PDMS using distributed data summaries

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Peer-to-peer similarity search in metric spaces

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Summary management in P2P systems

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On efficient top-k query processing in highly distributed environments

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
DESENT: decentralized and distributed semantic overlay generation in P2P networks

IEEE Journal on Selected Areas in Communications

On the selectivity of multidimensional routing indices

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
The state of the art in content-based image retrieval in P2P networks

ICIMCS '10 Proceedings of the Second International Conference on Internet Multimedia Computing and Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the number of documents that can be obtained in a certain direction in the network. In this paper, we introduce the concept of multidimensional routing indices (MRIs), which are suitable for handling multidimensional data represented by minimum bounding regions (MBRs). Depending on data distribution on peers, the aggregation of the MBRs may lead to MRIs that exhibit extremely poor performance, which renders them ineffective. Thus, focusing on a hybrid unstructured P2P network, we analyze the parameters for building MRIs of high selectivity. We present techniques that boost the query routing performance by detecting similar peers and grouping and reassigning these peers to other parts of the hybrid network in a distributed and scalable way. We demonstrate the advantages of our approach using large-scale simulations.