@inproceedings{AlAaridhi2016Distributed,
  author = {Read Al-Aaridhi and Ahmet Yükseltepe and Tobias Amft and Kalman Graffi (Informatik and Heinrich-Heine-Universität Düsseldorf)},
  title = {Distributed Data Structures Improvement for Collective Retrieval Time (Structure Cache)},
  year = {2016},
  booktitle = {Int. Symp. on Wireless Personal Multimedia Communications (WPMC)},
  abstract = {Distributed data structures (DDS) built on a DHT consist of chained objects that each hold an object ID, pointers and a payload, so retrieving a deep structure collectively is slow: the items of a reference chain have to be fetched one after another by recursive lookups, and the retrieval time grows linearly with the depth. The paper proposes a Structure Cache attached to the root object of a DDS that keeps the overlay keys of all deeper objects, turning the recursive chain retrieval into a single parallel retrieval (interface IStructureCache with CacheStructure(depth) and BuildStructureFromCa},
  note = {2016_Pub__IEEE.WPMC.16_RA_Structure.Cache.for.Distributed.Data.Structures.pdf},
}
