addresstable

An addresstable, or address table, is a data structure or database construct that stores mappings from addresses to data or other addresses. It functions as a lookup mechanism, enabling efficient translation, routing, or association based on an address value. The term is used in multiple domains, and the precise meaning depends on the context.

In memory management, page tables are a canonical example: they map virtual addresses to physical frame numbers, often with protection bits. Translation lookaside buffers (TLBs) cache these mappings to speed up address translation.

In networking, address tables include ARP tables that map IP addresses to MAC addresses on a local network, as well as routing tables that map destination prefixes to next-hop interfaces.

In software and databases, address tables may store addresses (for users, customers, devices) associated with identifiers, ensuring fast retrieval of address-based records.

Common implementations use hash tables for fast lookups, or trees and B+-tree-based structures for ordered access and persistent storage. Prefix-based data may employ tries or Patricia trees for efficient address matching.

Typical operations include add or update an entry, look up an entry by address, delete entries, and cache aging or expiration in dynamic environments.

Key considerations include performance, memory footprint, synchronization in concurrent environments, and security concerns such as spoofing or stale data.

Related concepts include ARP tables, page tables, and symbol tables.