RFC 1960 PROPOSED STANDARD LDAP · DIRECTORIES

A String Representation of LDAP Search Filters

A human-readable format for specifying which directory entries you want

On rfc-editor.org ↗
PUBLISHED
June 1996
AUTHORS
T. Howes
STREAM
IETF
BUILDS ON
RFC 1558 — LDAP filters
OBSOLETED BY
RFC 2254 — The String Representation of LDAP Search Filters
DOCUMENT LENGTH
3 pages
LOGICAL OPERATORS
&, |, !
COMPARISON OPERATORS
=, ~=, >=, <=
DOI
10.17487/RFC1960

RFC text

Contents
Original text · RFC Editor View on rfc-editor.org ↗
Network Working Group                                           T. Howes
Request for Comments: 1960                        University of Michigan
Obsoletes: 1558                                                June 1996
Category: Standards Track

             A String Representation of LDAP Search Filters

Status of this Memo

   This document specifies an Internet standards track protocol for the
   Internet community, and requests discussion and suggestions for
   improvements.  Please refer to the current edition of the "Internet
   Official Protocol Standards" (STD 1) for the standardization state
   and status of this protocol.  Distribution of this memo is unlimited.

1.  Abstract

   The Lightweight Directory Access Protocol (LDAP) [1] defines a
   network representation of a search filter transmitted to an LDAP
   server.  Some applications may find it useful to have a common way of
   representing these search filters in a human-readable form.  This
   document defines a human-readable string format for representing LDAP
   search filters.

2.  LDAP Search Filter Definition

   An LDAP search filter is defined in [1] as follows:

     Filter ::= CHOICE {
             and                [0] SET OF Filter,
             or                 [1] SET OF Filter,
             not                [2] Filter,
             equalityMatch      [3] AttributeValueAssertion,
             substrings         [4] SubstringFilter,
             greaterOrEqual     [5] AttributeValueAssertion,
             lessOrEqual        [6] AttributeValueAssertion,
             present            [7] AttributeType,
             approxMatch        [8] AttributeValueAssertion
     }

     SubstringFilter ::= SEQUENCE {
             type    AttributeType,
             SEQUENCE OF CHOICE {
                     initial        [0] LDAPString,
                     any            [1] LDAPString,
                     final          [2] LDAPString
             }
     }
     AttributeValueAssertion ::= SEQUENCE {
             attributeType   AttributeType,
             attributeValue  AttributeValue
     }

     AttributeType ::= LDAPString

     AttributeValue ::= OCTET STRING

     LDAPString ::= OCTET STRING

   where the LDAPString above is limited to the IA5 character set.  The
   AttributeType is a string representation of the attribute type name
   and is defined in [1].  The AttributeValue OCTET STRING has the form
   defined in [2].  The Filter is encoded for transmission over a
   network using the Basic Encoding Rules defined in [3], with
   simplifications described in [1].

3.  String Search Filter Definition

   The string representation of an LDAP search filter is defined by the
   following grammar.  It uses a prefix format.

     <filter> ::= '(' <filtercomp> ')'
     <filtercomp> ::= <and> | <or> | <not> | <item>
     <and> ::= '&' <filterlist>
     <or> ::= '|' <filterlist>
     <not> ::= '!' <filter>
     <filterlist> ::= <filter> | <filter> <filterlist>
     <item> ::= <simple> | <present> | <substring>
     <simple> ::= <attr> <filtertype> <value>
     <filtertype> ::= <equal> | <approx> | <greater> | <less>
     <equal> ::= '='
     <approx> ::= '~='
     <greater> ::= '>='
     <less> ::= '<='
     <present> ::= <attr> '=*'
     <substring> ::= <attr> '=' <initial> <any> <final>
     <initial> ::= NULL | <value>
     <any> ::= '*' <starval>
     <starval> ::= NULL | <value> '*' <starval>
     <final> ::= NULL | <value>

   <attr> is a string representing an AttributeType, and has the format
   defined in [1].  <value> is a string representing an AttributeValue,
   or part of one, and has the form defined in [2].  If a <value> must
   contain one of the characters '*' or '(' or ')', these characters
   should be escaped by preceding them with the backslash '\' character.

   Note that although both the <substring> and <present> productions can
   produce the 'attr=*' construct, this construct is used only to denote
   a presence filter.

4.  Examples

   This section gives a few examples of search filters written using
   this notation.

     (cn=Babs Jensen)
     (!(cn=Tim Howes))
     (&(objectClass=Person)(|(sn=Jensen)(cn=Babs J*)))
     (o=univ*of*mich*)

5.  Security Considerations

   Security considerations are not discussed in this memo.

6.  Bibliography

   [1] Yeong, W., Howes, T., and S. Kille, "Lightweight
       Directory Access Protocol", RFC 1777, March 1995.

   [2] Howes, R., Kille, S., Yeong, W., and C. Robbins, "The String
       Representation of Standard Attribute Syntaxes", RFC 1778,
       March 1995.

   [3] Specification of Basic Encoding Rules for Abstract Syntax
       Notation One (ASN.1).  CCITT Recommendation X.209, 1988.

7.  Author's Address

   Tim Howes
   University of Michigan
   ITD Research Systems
   535 W William St.
   Ann Arbor, MI 48103-4943
   USA

   Phone: +1 313 747-4454
   EMail: tim@umich.edu

AI ELI5

On this page
PROBLEMLDAP search filters are normally encoded in a binary format for transmission over the network, which is not readable by humans.
MECHANISMRFC 1960 defines a plain text format for writing LDAP filters using prefix notation with operators like &, |, !, and comparison operators =, ~=, >=, <=.
WHY IT FADEDIt was obsoleted by RFC 2254, which extended the format.

§1Introduction

The Lightweight Directory Access Protocol (LDAP) defines network search filters that a client sends to a directory server to find entries. The RFC defines a human-readable string format so that filters can be written and understood by people, not just transmitted in their binary encoding.

The format uses a simple prefix notation: logical operators like & (and) and | (or) wrap other filters, and comparison operators like = and >= match attribute values.

Instead of writing code that only computers understand, this format lets you write directory search rules in a way that people can read and write.

§2The Filter Grammar

A filter is a parenthesized expression containing comparison operators. The equals operator tests exact matches, while approximately-equals tests similarity, greater-or-equal tests if a value is at least as large, and less-or-equal tests if a value is at most as large. The special syntax equals-asterisk tests whether an attribute is present. Substring matching uses asterisks as wildcards.

Logical operators combine filters. The AND operator requires all conditions to match. The OR operator requires at least one condition to match. The NOT operator inverts a filter. Complex expressions nest filters, for example matching entries with a name of John that also have an email address.

It is like asking for records with conditional logic: find people named John with email addresses, or find all Smiths except Tim.

§3Examples

Simple equality: (cn=Babs Jensen) matches entries where the common name is exactly Babs Jensen. Negation: (!(cn=Tim Howes)) matches any entry except Tim Howes. Complex combinations like (&(objectClass=Person)(|(sn=Jensen)(cn=Babs J*))) match persons whose surname is Jensen OR whose common name starts with Babs J. Wildcards in values like (o=univ*of*mich*) use asterisks to match any substring.

You can ask for people named John, or anyone EXCEPT named John, or people in New York with a phone number. The asterisk lets you match partial words.

§4References