Table arrangement for a directory service and for related method and facilitating queries for the directory

a table arrangement and directory service technology, applied in relational databases, data processing applications, instruments, etc., can solve the problems of prior art systems, no products that address the market need of implementing x.500 using sql rdbms, and no products that address the market need of implementing x.500 successfully, etc., to achieve high performance

Inactive Publication Date: 2008-02-14
COMP ASSOC THINK INC +1
View PDF56 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0020] Furthermore, in the present invention each service is modeled, instead of each data type as seen in the prior art, and relationships are defined between each service, rather than between each data type as in the prior art. Implementation of service modeling using relational queries to satisfy directory services, such as X.500 services, enables the benefits of RDBMS to be optimally exploited.
[0061] the ability to leverage off hundreds of man years of relational database developments and use “industrial strength” databases with proven reliability, integrity, security and tools for developing high performance applications.

Problems solved by technology

The problem, therefore, is to address the need of data managers and implement X.500 with all the flexibility of object-oriented systems but using an SQL product so that it can achieve the scalability and performance inherent in relational systems coupled with the stability, robustness, portability and cost-effectiveness of current SQL products.
None of these products use a SQL database as an underlying data store, and none of these products therefore address successfully the market need of implementing X.500 using an SQL RDBMS.
The Directory System disclosed, as with many prior art systems, is relatively slow in operation, particularly where the database is relatively extensive and is incomplete in its implementation of X.500, such as aliases, subsearch and entry information.
As noted above, there have been a number of attempts made to address prior art problems, but none of the attempts have resulted in a product which has proven to be commercially accepted by the market.
In particular, the prior art has been unable to address problems that are associated with queries in and out of the directory, table organization and layout, and clustering.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Table arrangement for a directory service and for related method and facilitating queries for the directory
  • Table arrangement for a directory service and for related method and facilitating queries for the directory
  • Table arrangement for a directory service and for related method and facilitating queries for the directory

Examples

Experimental program
Comparison scheme
Effect test

example

[0540] Modify the Entry “Datacraft / Sales / Network Products / Chris Masters” with the following changes:

Delete Attribute and ValuetelephoneNumber018 - 042 671Modify Attribute and ValuetitleSales Assistant

[0541] The Search and Entry Tables reflect the changes.

SEARCHEIDAIDVIDDISTINGNORM300002.5.6.730301CHRIS30401MASTERS301200SALES ASSISTANT30200003 727 9456

[0542]

ENTRYEIDAIDVIDRAW3000[2.5.6.7]3030[Chris]3040[Masters]30120[Sales Assistant]30200[(03) 727-9456]

[0543] 5.9 Modify RDN Service

[0544] The ModifyRDN operation is used to change the Relative Distinguished Name of a leaf entry (either an object entry or an alias entry) from the Directory Information Tree.

ArgumentDescriptionobjectThe Distinguished Name of the entry to bemodifiednewRDNThe new RDN of the entrydeleteOldRDNflag - delete all values in the old RDN not innew RDNCommon ArgumentsResultDescriptionNULLNULL

[0545] Method [0546] Perform a tree walk using the DIT table. Obtain the EID and Parent EID of the base object. [0547] U...

example implementation

7. Example Implementation

[0627] The following provides an example of system performance and capabilities. It is to be understood that the present inventions should not be limited to the following disclosure.

[0628] 7.1 Overall System Benefits

[0629] The present invention is considered to provide enhanced performance over prior art implementations. Performance can be appraised in many ways, including:

[0630] aliases;

[0631] size (use of relational theory);

[0632] complexity (use of query optimiser and search method(s));

[0633] extensibility (use of meta-data); and

[0634] substantially without degrading efficiency (use of disk based model) and

[0635] reliability (use of RDBMS).

[0636] The present invention is considered unique in its ability to claim performance improvement in all areas noted above.

[0637] 7.2 Test Results

[0638] Performance testing of the present invention has been carried out, with the objectives of: [0639] Proving that an SQL based X.500 application can perform at ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A directory services system, such as one providing a X.500 or LDAP directory service, having a design and a method of operation which facilitates queries in and out of the directory, table organization / layout and clustering. In the arrangement of the directory service, tables are organized corresponding to their function, thereby permitting an arrangement based on service modeling and functional organization that permits clustering. A preferred layout design incorporates principal, conceptual, logical and / or physical designs.

Description

RELATED APPLICATIONS [0001] This application is a continuation of U.S. application Ser. No. 09 / 427,263, filed Oct. 26, 1999, entitled “Directory Service System and Method with Tolerance for Data Entry Storage and Output,” which is a divisional of U.S. Ser. No. 08 / 793,575, now U.S. Pat. No. 6,052,681 and which is incorporated herein by reference in its entirety.BACKGROUND OF THE INVENTION [0002] 1. Field of the Invention [0003] The present invention relates to the field of directory services. In particular, the present invention is directed to application of X.500, LDAP and similar services to a relational database, a database design and use of the database to perform X.500 services. [0004] One aspect of the invention relates to the design of a directory service(s) system, including table organization and clustering, and method of operation which facilitates queries in and out of the directory. [0005] Other aspects of the present disclosure are directed to an implementation using a R...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F17/30G06F7/00
CPCG06F17/30595Y10S707/99942Y10S707/99933G06F7/00G06F16/284
Inventor HARVEY, RICHARD HANS
Owner COMP ASSOC THINK INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products