Towards a fully distributed n-tuple store

  • Authors:
  • Yan Shvartzshnaider;Maximilian Ott

  • Affiliations:
  • NICTA and The University of Sydney, Sydney, Australia;NICTA, Sydney, Australia

  • Venue:
  • Proceedings of the ACM SIGCOMM 2011 conference
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present our work towards building a novel distributed n-tuple store by extending the Kademlia DHT [1] algorithm to support n dimensional keys as well as an multi get operator, where some of the dimensions of the "query" key can be left unspecified.