Claims
- 1. A method of locating information stored in a directory comprising:using a predicate to designate said information, said predicate expressed as a plurality of primitive predicates, individual predicates of said plurality of primitive predicates joined by logical connectors; representing said logical connectors by numbers, and representing terms in each predicate by numbers, said numbers chosen so that each different logical connector and each different term in said plurality of predicates is represented by a unique number; sorting said logical connectors and said predicates in numerical order of said unique numbers representing said logical connectors and said terms to create a normal form of said predicate; and storing said information into a cache and using said normal form of said predicate as an index to said information stored in said cache.
- 2. The method as in claim 1 further comprising:submitting a client predicate by a client to designate desired information; sorting said client predicate into a normal form of said client predicate; and comparing said normal form of said client predicate with index predicates to stored information stored in a cache, and retrieving stored information when said normal form of said client predicate matches said index predicate.
- 3. The method as in claim 1 further comprising: choosing said directory as a database.
- 4. A data structure stored in a computer memory, comprising:a predicate sorted into normal form, said predicate serving as an index to data stored in a cache, said cache stored in a memory unit of said computer; and said predicate having at least one logical operator and having a plurality of elements, said logical operator and said plurality of elements each represented by a number, and said normal form of said predicate formed by sorting said numbers representing said logical operators and said plurality of elements into numerical order.
RELATED APPLICATIONS
This application claims priority to U.S. Provision Application 60/113,870 filed on Dec. 23, 1998, and now abandoned. The disclosure of which is hereby incorporated by reference herein.
This Application is related to U.S. patent application Ser. No. 09/398,685, filed on even date with this application of Sukanta Ganguly, Chin Ming Kuo, and Cheng Yang, entitled PREDICATE INDEXING FOR LOCATING OBJECTS IN A DISTRIBUTED DIRECTORY, all disclosure of which is incorporated herein by reference.
US Referenced Citations (11)
Number |
Name |
Date |
Kind |
5794232 |
Mahlum et al. |
Aug 1998 |
A |
5870739 |
Davis, III et al. |
Feb 1999 |
A |
5873079 |
Davis, III et al. |
Feb 1999 |
A |
5884304 |
Davis, III et al. |
Mar 1999 |
A |
6014667 |
Jenkins et al. |
Jan 2000 |
A |
6049799 |
Mangat et al. |
Apr 2000 |
A |
6081814 |
Mangat et al. |
Jun 2000 |
A |
6157925 |
Jenkins et al. |
Dec 2000 |
A |
6292880 |
Mattis et al. |
Sep 2001 |
B1 |
6347312 |
Byrne et al. |
Feb 2002 |
B1 |
6389460 |
Stewart et al. |
May 2002 |
B1 |
Non-Patent Literature Citations (4)
Entry |
U.S. patent application Ser. No. 09/398,685, Ganguly et al., pending. |
C.Weider, J. Reynolds, S. Heker, Technical Overview of Directory Services Using the X.500 Protocol, RFC 1309. |
W. Yeong, T. Howes, S. Kille, X.500 Lightweight Directory Access Protocol, Jul. 1993, RFC 1487. |
M. Wahl, T. Howes, S. Kille, Lightweight Directory Access Protocol (v3), Dec. 1997, RFC 2251. |
Provisional Applications (1)
|
Number |
Date |
Country |
|
60/113870 |
Dec 1998 |
US |