LinkedPeers: a distributed system for interlinking multidimensional data

Authors:
Athanasia Asiki;Dimitrios Tsoumakos;Nectarios Koziris
Affiliations:
School of Electrical and Computer Engineering, National Technical University of Athens, Greece;School of Electrical and Computer Engineering, National Technical University of Athens, Greece;School of Electrical and Computer Engineering, National Technical University of Athens, Greece
Venue:
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Year:
2011

Citing 7
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The chatty web: emergent semantics through gossiping

WWW '03 Proceedings of the 12th international conference on World Wide Web
CISS: An efficient object clustering framework for DHT-based peer-to-peer applications

Computer Networks: The International Journal of Computer and Telecommunications Networking
Querying the internet with PIER

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Squid: Enabling search in DHT-based systems

Journal of Parallel and Distributed Computing
GrouPeer: Dynamic clustering of P2P databases

Information Systems
Distributing and searching concept hierarchies: an adaptive DHT-based system

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present LinkedPeers, a distributed system designed for efficient distribution and processing of multidimensional hierarchical data over a Peer-to-Peer overlay. he system design aims at incorporating two important features, namely large-scale support for partially-structured data and highperformance, distributed query processing including multiple aggregates. To achieve that, LinkedPeers utilizes a conceptual chain of DHT rings that stores data in a hierarchy-preserving manner and is able to adjust both the granularity of indexing and the amount of pre-computation according to the incoming workload. Extensive experiments prove that our system is very efficient achieving over 85% precision in answering queries while minimizing communication cost and adapting its indexing to the incoming queries.