s and exemptions held by a database user. See also exemption.
See load balancing group.
See large block interface.
See local buffer pool.
See low bit rate.
See link connection component manager.
See line control definer.
See logical channel number.
See link connection subsystem manager.
See logical channel subsystem.
See logical control unit.
See Lightweight Directory Access Protocol.
LDAP data source adapter (LDAP DSA)
A data source adapter that reads directory data managed by an LDAP server. See also Lightweight Directory Access Protocol.
A type of repository that stores information on people, organizations, and other resources and that is accessed using the LDAP protocol. The entries in the repository are organized into a hierarchical structure, and in some cases the hierarchical structure reflects the structure or geography of an organization.
LDAP Directory Interchange Format (LDIF)
A file format that is used to describe directory information as well as changes that need to be applied to a directory, such that directory information can be exchanged between directory servers that are using LDAP.
See LDAP data source adapter.
An expression that is used to select data elements located at a point in an LDAP directory tree. See also filter.
See Lightweight Directory Access Protocol injection.
See logical device component.
See local device node control block.
- In text formatting, the divider between text and footnotes on a page, usually a short line of dashes.
- In text formatting, a row of dots or hyphens used to lead the eye horizontally, as in a table of contents.
- The blank section of tape at the beginning of a reel.
Bytes of data, from the beginning of a migrated file, that are stored in the file's corresponding stub file on the local file system. The amount of leader data that is stored in a stub file depends on the stub size that is specified.
- The edge of a character box closest to the graphic character that appears to precede it on a sequential baseline. In architecture, the edge of a character box that in the inline direction precedes the graphic character.
- In architecture, the front edge of a sheet as it moves through a printer.
- The amount of time it takes a supplier, such as a distribution center, to acquire an item for shipping.
- The amount of time between placing an order and receiving the items.
- A switch field replaceable unit (FRU) that plugs into a switch chassis. It contains connectors for interconnecting with adapters and other switches. Internal to the switch chassis, a leaf connects to spine modules, which provide connectivity to other leaf FRUs in the same switch chassis by way of a midplane.
- In a tree, an entry or node that has no children.
A leaf card in a switch chassis that contains a specific number of InfiniBand port connectors and has the capability of communicating with other leaf modules through connections to spines.
- The lowest level contract folder or organization in a hierarchy that is not a parent.
- See leaf member.
A page that contains pairs of keys and record identifiers and that points to actual data. See also nonleaf page.
See thin client.
- A continual physical connection over a telecommunications line between two computers or between a computer and a network.
- See nonswitched line.
least significant byte (LSB)
See little endian.
least traveled path
A putaway and picking strategy that selects putaway or pick locations by calculating the shortest distance to travel through the warehouse to putaway or pick all of the items required for that assignment.
least upper bound (LUB)
The smallest number that is greater than the variable. Least upper bounds are important in math programming (MP) and constraint programming (CP) in the context of setting bounds on variables as tightly as possible. See also greatest lower bound, upper bound.
In APPN, the one route calculated by topology and routing services (TRS) to have the lowest total weight after TRS compares the node characteristics and TG characteristics of each intermediate node and intermediate TG of each possible route fo