@inproceedings{OverlayMeter2016Sets,
  author = {DFG-Förderung GR4498 1-1 "OverlayMeter")},
  title = {Sets, Lists and Trees: Distributed Data Structures on Distributed Hash Tables},
  year = {2016},
  booktitle = {IEEE Int. Performance Computing and Communications Conference (IPCCC)},
  abstract = {A distributed hash table only offers storage and retrieval of single items, which leaves P2P applications such as online social networks to manage their own complex data. The paper presents a Distributed Data Structures (DDS) layer between the application logic and the DHT in which sets, lists, trees and free graphs are realised as pointer graphs of ordinary DHT objects, each object consisting of an object ID, pointers and a payload; the entry point of a structure is either a deterministic hash or a random identifier, and the objects are replicated with PAST. Store, retrieve and modify operati},
  note = {2016_Pub__IEEE.IPCCC.16_RA_Distributed-Data-Structures__RELEVANT.pdf},
}
