# table lookup

Also found in: Dictionary, Thesaurus, Medical, Financial, Acronyms.

## table lookup

Searching for one item in a list or matrix of data (the table). Table lookups are used in countless operations to obtain a value or set of values such as retail and wholesale prices, product descriptions, street addresses, network routes and machine addresses.

Software or Hardware
Table lookups are often performed by software routines. However, to speed up operations, especially in network routers and switches, they can be performed in hardware (see content-addressable memory). See lookup table, binary search, address resolution and routing protocol.
References in periodicals archive ?
In this section, we apply the table lookup method to construct exact analytical solutions of four nonlinear fPDEs, namely, the time fractional simplified MCH equation, the space-time combined KdV-MKdV equation, the (2+1)-dimensional time fractional Zoomeron equation, and the space-time fractional ZKBBM equation, which are very important nonlinear fPDEs in mathematical physics and have received much attention from researchers.
MacGregor, "Multi-zone caches for accelerating IP routing table lookups," Merging Optical and IP Technologies Workshop on High Performance Switching and Routng, pp.
ALGORITHM 1 // Splay Finger Table Lookup // Return the successor of key n*slookup(key) (1) if (key is between S*id and T*id) (2) n' = splay search(ST, key) (3) if (n' is sentinel) (4) remove sentinel root(ST) (5) n' = ST*root (6) if (n'*id == key) (7) return n' (8) n' = n'*slookup(key) (9) else (10) n' = T*slookup(key) (11) if (Count < CACHE MAX) (12) splay insert(ST, n') (13) S = min (S, n') (14) T = max (T, n') (15) return n' Here we recall the static optimality theorem in [9].
Three operations are needed to run the [SHARK.sub.w][K] algorithm: bit multiplication, bit addition, and T-Box table lookup. We list the number of required operations in Table 1.

Site: Follow: Share:
Open / Close