Poster: Towards A Fully Distributed N-Tuple Store

Select |




Print


Shvartzshnaider, Yan; Ott, Max


2011-08-15


Conference Material


ACM SIGCOMM


Canada


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.


Distributed Pattern Matching, Kademlia


http://conferences.sigcomm.org/sigcomm/2011/posters.php


nicta:4869


Shvartzshnaider, Yan; Ott, Max. Poster: Towards A Fully Distributed N-Tuple Store. In: ACM SIGCOMM; Canada. 2011-08-15. http://hdl.handle.net/102.100.100/103403?index=1



Loading citation data...

Citation counts
(Requires subscription to view)