Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2000-12-19
2003-09-23
Mizrahi, Diane D. (Department: 2175)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06625615
ABSTRACT:
TECHNICAL FIELD
The present invention relates in general to data processing systems, and in particular, to data processing systems for directory management and directories having a backing store implemented as a relational database.
BACKGROUND INFORMATION
Information describing the various users, applications, files, printers and other resources accessible in a multi-user environment is often collected into a special database which may be referred to as a directory. The Lightweight Directory Access Protocol (LDAP) is an open architecture set of protocols for accessing and updating information in a directory. (LDAP version 2 is defined in Request for Comments (RFC) 1777, and LDAP version 3 is specified in RFC 2251, December 1997 (copyright, The Internet Society, 1997)). RFC 1777 and RFC 2251 are hereby incorporated herein by reference.
In the LDAP, the basic unit of information stored in the directory is referred to as an entry. Entries represent objects of interest, for example, in a multi-user dataprocessing system environment, people, servers, organizations, etc. Entries are composed of a collection of attributes that contain information about the object. Every attribute has a type and one or more values. Attribute types are associated with a syntax. The syntax specifies what kind of value can be stored. Directory entries are arranged in a tree structure or hierarchy. (Entries may also be referred to as nodes, and the terms may be used interchangeably herein.) The organization of the tree structure and the type of objects that can be stored in the directory as well as their attributes are defined in the schema for the objects. The set of schema defining a particular directory provides a road map to the organization of the directory. (Note, that the schema do not refer to the instances of entries in a particular directory.) Additionally, the data store that contains the information constituting the directory may be implemented using a multiplicity of mechanisms. The LDAP itself does not specify a particular storage mechanism. For example, the directory storage mechanism may be implemented using flat files, a binary tree (b-tree) or a relational database.
Directory entry information is retrieved by formulating an LDAP search. An application may perform a search by invoking an application program interface (API) call, as discussed in the commonly owned U.S. Pat. No. 6,085,188, entitled “Method of Hierarchical LDAP Searching With Relational Databases,” to Bachmann, et al., which is hereby incorporated in its entirety herein by reference. A search within the directory hierarchy is specified in LDAP by a “distinguished name” (DN). A DN (discussed further hereinbelow) is a unique name that unambiguously identifies a single entry within the directory hierarchy. The search request also may include a search scope which specifies the depth of the search in the directory hierarchy. However, the search scope which may be specified in a directory having a relational database as a backing store is limited. Consequently, there is a need in the art for mechanisms for providing an arbitrary search level in a directory having a backing store implemented as a relational database.
SUMMARY OF THE INVENTION
The aforementioned needs are addressed by the present invention. Accordingly, there is provided, in a first form, a search method. The method includes retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier. For each node corresponding to one of the one or more second identifiers having a corresponding one of the associated distance values not greater that a preselected distance value, the node is matched against a first search parameter.
There is also provided, in a second form, a computer program product in a tangible storage medium. The program product includes a program of instructions for retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier. Also included are instructions for matching the node against a second search parameter for each node corresponding to one of the one or more second identifiers and having a corresponding one of the associated distance value not greater that a preselected distance value.
Additionally, there is provided, in a third form, a data processing system. The system contains circuitry operable for retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier. The system also has circuitry operable, for each node corresponding to one of the one or more second identifiers having a corresponding one of the associated distance value not greater that a preselected distance value, matching the node against a first search parameter.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention.
REFERENCES:
patent: 5916299 (1999-06-01), Poppen
patent: 6377957 (2002-04-01), Jeyaraman
patent: 6427123 (2002-07-01), Sedlar
patent: 6446059 (2002-09-01), Berger et al.
patent: 6470332 (2002-10-01), Weschler
patent: 6470344 (2002-10-01), Kothuri et al.
patent: 6480857 (2002-11-01), Chandler
Sudarshan S. Chawathe, Anand Rajaraman, Hector Garcia-Molina, and Jennifer Widom titled “Change Detection in□□Hierarchically Structured Information” SIGMOD '96 6/96 Montreal, Canada copyright 1996 ACM 0-89791-794-4/96/0006 pp. 493-504.*
Nick Roussopoulos, Stephen Kelley & Frederic Vincent,titled “Nearest Neighbor Queries”, Proc. of ACM SIGMOD Int'l Conf. on Management of Data, 1995, 71-79.*
Henning Maass, Titled “Location-aware mobile applications based on directory services” Copyright ACM Mobile Networks and Applications Aug. 1998 p. 157-173.
Hill Reginal R.
Shi Shepherd
LaBaw Jeffrey S.
Mizrahi Diane D.
Newberger Barry S.
Winstead Sechrest & Minick P.C.
LandOfFree
Data processing system and method for multi-level directory... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data processing system and method for multi-level directory..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing system and method for multi-level directory... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3034792