MIDAS: Multi-attribute Indexing for Distributed Architecture Systems

  • George Tsatsanifos
  • Dimitris Sacharidis
  • Timos Sellis
Conference paper

DOI: 10.1007/978-3-642-22922-0_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6849)
Cite this paper as:
Tsatsanifos G., Sacharidis D., Sellis T. (2011) MIDAS: Multi-attribute Indexing for Distributed Architecture Systems. In: Pfoser D. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg

Abstract

This work presents a pure multidimensional, indexing infrastructure for large-scale decentralized networks that operate in extremely dynamic environments where peers join, leave and fail arbitrarily. We propose a new peer-to-peer variant implementing a virtual distributed k-d tree, and develop efficient algorithms for multidimensional point and range queries. Scalability is enhanced as each peer has only partial knowledge of the network. The most prominent feature of our method, is that in expectance each peer maintains O(logn) state and requests are resolved in O(logn) hops with respect to the overlay size n. In addition, we provide mechanisms for handling peer failures and improving fault tolerance as well as balancing the load of peers. Finally, our work is complemented by an experimental evaluation, where MIDAS is shown to outperform existing methods in spatial as well as in higher dimensional settings.

Keywords

Peer-to-peer systems kd-trees 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • George Tsatsanifos
    • 1
  • Dimitris Sacharidis
    • 2
  • Timos Sellis
    • 1
    • 2
  1. 1.National Technical University of AthensGreece
  2. 2.Institute for the Management of Information Systems, R.C. “Athena”Greece

Personalised recommendations