Skip Navigation Links | |
Exit Print View | |
Oracle Fusion Middleware Glossary for Oracle Unified Directory 11g Release 1 (11.1.1) |
access control instruction (ACI)
authentication password syntax
authorization identity control
Common Development and Distribution License
deprecated password storage scheme
Directory Services Markup Language
entry change notification control
extensible match search filter
greater than or equal to search filter
less than or equal to search filter
Lightweight Directory Access Protocol
Password Modify extended operation
Simple Authentication and Security Layer
virtual attributes only control
A name form is a schema element that may be used to control which attribute type may be used in the RDN for an entry based on its structural object class.
A name form definition include these components:
An OID used to uniquely identify the name form.
A set of zero or more names that can be used to more easily reference the name form.
The name or OID of the structural object class with which the name form is associated. Any entry with that structural class will be required to have an RDN which conforms to the requirements of the name form.
An set of one or more attribute type names or OIDs for attributes that must be present in the RDN of entries with the associated structural class.
An optional set of one or more attribute type names or OIDs for attributes that may optionally be present in the RDN of entries with the associated structural class.
The set of name forms defined in the server may be determined by retrieving the nameForms attribute of the subschema subentry. For more information about name forms, see the Understanding Name Forms in Oracle Fusion Middleware Architecture Reference for Oracle Unified Directory.
A naming context, also called a suffix, is a top-level entry in the server's directory information tree. It is an entry that does not have a parent.
The set of naming contexts defined in the server is listed in the namingContexts attribute of the root DSE. Naming contexts are visible through workflows.
A network group contains a set of criteria that define categories of client connection. If the client request that is sent to the server meets the policies that are attached to the network group, the network group forwards the request to a workflow.
A non-leaf entry is an entry that has at least one subordinate entry in the server.
A normalized value is a value that has been processed in a way that makes it possible to be efficiently compared against other values. The normalization process is performed using matching rules and varies based on the type of matching rule. Some kinds of transformations that may be made include:
Converting all characters to lowercase (or uppercase) to eliminate insignificant differences in capitalization
Eliminating unnecessary spaces in the value
Converting values which may have multiple representations into a common form
The notice of disconnection is a type of unsolicited notification that can be used to indicate that the server is about to close the connection to the client for some reason (for example, the server is being shut down, or the client has remained idle for too long).
The OID for the extended response containing the notice of disconnection is 1.3.6.1.4.1.1466.20036. It will not have a response value, but the result code may provide an indication of the reason for the disconnection, and the diagnostic message may provide a human-readable explanation.
A NOT search filter is a type of search filter that is intended to serve as a container that holds exactly one embedded search filter. The NOT filter is essentially an inverse operation, and in order for an entry to match a NOT filter, it must not match the embedded filter.
NOT filters may be represented as a string by enclosing the entire filter in parentheses and placing an exclamation point just after the opening parentheses. For example, a filter of (!(objectClass=person)) will only match an entry if it does not have an object class value of person.
A proxy distribution algorithm in which data is split into partitions based on numerical delimitations. For example, [1–1000[ for one partition, and [1000–2000[ for the next partition.