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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Received: August 2001, Accepted: May 2002,
Supported in part by a grant from the Israel Science Foundation.
About this article
Cite this article
Gavoille, C., Peleg, D. Compact and localized distributed data structures. Distrib. Comput. 16, 111–120 (2003). https://doi.org/10.1007/s00446-002-0073-5
- Informative labeling schemes
- Distance labeling
- Compact routing tables