Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Compact and localized distributed data structures

Compact and localized distributed data structures This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Compact and localized distributed data structures

Distributed Computing , Volume 16 (3) – Sep 1, 2003

Loading next page...
 
/lp/springer-journals/compact-and-localized-distributed-data-structures-LgRiGtLn0C

References (126)

Publisher
Springer Journals
Copyright
Copyright © 2003 by Springer-Verlag Berlin/Heidelberg
Subject
ComputerScience
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/s00446-002-0073-5
Publisher site
See Article on Publisher Site

Abstract

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.

Journal

Distributed ComputingSpringer Journals

Published: Sep 1, 2003

There are no references for this article.