Advertisement

LinkedPeers: A Distributed System for Interlinking Multidimensional Data

  • Athanasia Asiki
  • Dimitrios Tsoumakos
  • Nectarios Koziris
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6861)

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 high-performance, 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.

Keywords

Exact Match Primary Ring Distribute Hash Table Primary Dimension Concept Hierarchy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    MacManus, R.: The coming data explosion (2010), http://www.readwriteweb.com/archives/
  2. 2.
    Linked Data - Connect Distributed Data across the Web, http://linkeddata.org/
  3. 3.
    Asiki, A., Tsoumakos, D., Koziris, N.: Distributing and searching concept hierarchies: an adaptive dht-based system. Cluster Computing 13, 257–276 (2010)CrossRefGoogle Scholar
  4. 4.
  5. 5.
    OLAP Council APB-1 OLAP Benchmark, http://www.olapcouncil.org/research/resrchly.htm
  6. 6.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proc. of the ACM SIGCOMM (2001)Google Scholar
  7. 7.
    Schmidt, C., Parashar, M.: Squid: Enabling search in dht-based systems. Journal of Parallel and Distributed Computing 68(7), 962–975 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Lee, J., Lee, H., Kang, S., Kim, S.M., Song, J.: CISS: An efficient object clustering framework for DHT-based peer-to-peer applications. Computer Networks 51(4)Google Scholar
  9. 9.
    Huebsch, R., Hellerstein, J., Boon, N.L., Loo, T., Shenker, S., Stoica, I.: Querying the Internet with PIER. In: VLDB (2003)Google Scholar
  10. 10.
    Aberer, K., Cudre-Mauroux, P., Hauswirth, M.: The Chatty Web: Emergent Semantics Through Gossiping. In: WWW Conference (2003)Google Scholar
  11. 11.
    Kantere, V., Tsoumakos, D., Sellis, T., Roussopoulos, N.: GrouPeer: Dynamic clustering of P2P databases. Inf. Syst. 34(1), 62–86 (2009)CrossRefGoogle Scholar
  12. 12.
    Ooi, B., Shu, Y., Tan, K., Zhou, A.: PeerDB: A P2P-based System for Distributed Data Sharing. In: ICDE (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Athanasia Asiki
    • 1
  • Dimitrios Tsoumakos
    • 1
  • Nectarios Koziris
    • 1
  1. 1.School of Electrical and Computer EngineeringNational Technical University of AthensGreece

Personalised recommendations