WO2001077902A2 - Directory searching method and system - Google Patents
Directory searching method and system Download PDFInfo
- Publication number
- WO2001077902A2 WO2001077902A2 PCT/US2001/011587 US0111587W WO0177902A2 WO 2001077902 A2 WO2001077902 A2 WO 2001077902A2 US 0111587 W US0111587 W US 0111587W WO 0177902 A2 WO0177902 A2 WO 0177902A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- row
- database
- services system
- component
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Definitions
- RBDMS Relational Database Management System
- RDBMS are the preferred choice of most large scale managers of data.
- RDBMS are readily available and known to be reliable and contain many useful management tools.
- Most relational database products support the industry standard SQL (Structured Query Language).
- SQL Structured Query Language
- Object Oriented systems which provide data extensibility and the ability to handle arbitrarily complex data items.
- many corporations and governmental departments have a large number of database applications, which are not interconnected. Data managers are looking for solutions which enable them to integrate their data, and to simplify the management of that data.
- X.500 is the International Standard for Electronic Directories [CCITT89 or ITU93]. These standards define the services, protocols and information model of a very flexible and general purpose directory. X.500 is applicable to information systems where the data is fairly static (e.g. telephone directory) but may need to be distributed (e.g. across organisations or countries), extensible (e.g. store names, addresses, job titles, devices etc.), object oriented (i.e. to enforce rules on the data) and/or accessed remotely. Electronic directories, such as X.500 and its associated standards, provide a framework and a degree of functionality that enables data managers to achieve their objectives.
- data managers prefer to implement an electronic directory, e.g., an X.500 directory, with all the flexibility of object-oriented systems, but using an SQL product so that the system can achieve the scalability and performance inherent in relational systems coupled with the stability, robustness, portability and cost-effectiveness of current SQL products.
- an electronic directory e.g., an X.500 directory
- hierarchy tables e.g., NAME, DIT and TREE
- Object tables e.g., SEARCH and ENTRY
- SEARCH and ENTRY manage values within an object.
- object tables are arranged according to one row per value. Every object has a corresponding row in the hierarchy tables and every attribute value has a corresponding row in the object tables.
- the object table used for searching objects contains rows of the form (EID, AID, VID, Norm), where EID identifies the object to which the value belongs, AID identifies the attribute type of the value, VID identifies one of a possible number of attribute values in the one entry, and Norm contains the syntax normalized value.
- Attribute tables e.g., attribute, define information about attribute types.
- the attribute table used contains rows of the form (AID, SYX,DESC, OBJECT ID).
- the present application relates to the storing and/or searching for data types using some form of indicia, such as one of the components contained in stored data, an identifier of stored data and / or a manipulation of stored data.
- This implementation facilitates the searching of complex data types by adding new search and/or attribute tables that store information relating to data entries, predetermined information considered to be of assistance or useful in searching for particular entries of a database, such as, by not limited to including component identifier (CID) information representing an individual component and/or component value identifier information (CVID) representing a multi-valued component or components used for searching.
- CID component identifier
- CVID component value identifier information
- These new tables are referred to herein as subsearch tables and/or subattribute tables which serve to store components of values, and facilitate the searching of individual components and/or multi-valued components.
- subsearch tables and/or subattribute tables which serve to store components of values, and facilitate the searching of individual components and/or multi-valued
- the present application provides a method of arranging data in a database.
- the method includes creating a first table adapted for storing the data and having one row for each data entry, and creating a second table adapted for storing data components and having one row for each component of the stored data type.
- the data is a structured data type or a string data.
- the present application also provides a database and / or directory having a data storage arrangement.
- the data storage arrangement includes a first table directed to a hierarchy which defines a relationship between objects and configured to have one row per object, a second table directed to objects which define one or more values within each object and configured to have one row per value, and a third table directed to one or more selected components or representations of values and configured to have one row for each component of each value.
- the database is a part of a directory services system, such as X.500 or LDAP services system.
- the present application also provides a method of searching a database for a given data entry.
- the database has a first table adapted for storing data and having one row for each data entry, and a second table adapted for storing data components or representations and having one row for each component of the stored data.
- the searching method includes determining a component or representation of a given data entry, executing one of an exact or initial matching on the second table in order to locate the component or representation, and returning the given data entry matching the component or representation located.
- reference to 'component' may instead or in addition include 'representations' of values, e.g. reverse indexing or pointers or fingerprints or checksum, or some suitable smaller representation of relatively large data.
- Figure 1 b illustrates a logical and physical design of an exemplary database according to the present application including a subsearch table and a subattribute table;
- Figure 2 is a schematic representation of a high order search method according to the present application.
- Figure 3 is a schematic representation of a sub-order search method according to the present application
- Figure 4 illustrates an exemplary X.509 certificate and corresponding example of search and subsearch tables
- Figure 5 illustrates exemplary search and subsearch tables related to a telephone number data component.
- Figure 1a illustrates an exemplary implementation of a database design and is only one type of database to which the methods and arrangements of the present application can be applied. A more detailed description of this database design can be found in U.S. Serial No. 09/427,267 which is incorporated herein in its entirety by reference.
- Figure 1 b illustrates a more detailed implementation of the database design of Figure 1a.
- a search argument defines where to start the search (base object), the scope of the search (subset), the conditions to apply to the search (filter) and what information should be returned from the search (selection).
- the filter is a combination of one or more filter items (or conditions) connected by operators such as AND, OR and NOT.
- filters are applied to values and attributes in the object table, e.g., the search table.
- An example of a general filter is "NORM LIKE '%RICK HARVEY%"'.
- a clause may be added the SQL statement that includes a component identifier, which addresses a particular component of a data type and an exact or initial (or “begins with”) filter is applied to components in a subsearch table instead of the search table.
- the table structure of logical design 1 and physical design 2 include search table 3, subsearch table 4, attribute table 5, and subattribute table 6.
- the search table 3 and attribute table 5 are similar to the search and attribute tables described in U.S. Serial No. 09/427,267 and will not be described in more detail here.
- the subsearch table 4 can be configured to include one or more components used to improve the speed and reliability of the search.
- the subsearch table 4 can include a CID field 7 and a CVID field 8.
- the CID field 4 serves as a tool (or index) for searching components of data types
- the CVID field 8 serves as a tool (or index) for multi-valued component searching.
- the attribute table 5 describes or references information in search table 3, and the subattribute table 6 describes or references information in subsearch table 4.
- the subattribute table 6 has similar fields as the attribute table 5, but substitutes CID field 9 for AID field 10.
- the CID field 9 is used to identify one or more components in the subsearch table 4.
- the subsearch table 4 preferably stores information that improves searching performance or components of complex data types.
- Other components stored in the subsearch table can be those that improve the manageability of the database. In other words, it is not a requirement that every value in a data entry is included in the subsearch table.
- searches that have a scope of base object or whole tree 11 use the search table 3.
- Searches that have a scope of base object or whole tree 11 and can make use of a stored component use the subsearch table 4.
- Searches that have a scope of one level 12 use a join between the DIT table 14 and search table 3.
- Searches that have a scope of one level 12 and can make use of a stored component use a join between the DIT table 14 and subsearch table 4.
- Searches that have a scope of subtree 13 use a join between the tree table 15 and search table 3.
- Searches that have a scope of subtree 13 and make use of a stored component use a join between the tree table 15 and subsearch table 4.
- a desired search argument is structured with a general filter
- the base object and whole tree searches 11 would use the search table 3
- the one level search 12 would use DIT table 14 and search table 3
- the subtree search 13 would use tree table 15 and search table 3.
- An example of an SQL statement for such a search may be:
- the search may be slow and inefficient because the database may have to scan through a large number of values.
- One way to improve the efficiency of such a search is to utilize a subsearch table and search one or more components associated with the stored data. In such instances the database may be able to use an index to the component in the string or structure thus avoiding a scan of a large number of values.
- An example of an SQL statement for such a search would be: SELECT EID ⁇ other columns ⁇ FROM SUBSEARCH ⁇ other tables ⁇ WHERE
- the base object and whole tree searches 11 would use the subsearch table 4
- the one level search 12 would use DIT table 14 and subsearch table 4
- the subtree search 13 would use tree table 15 and subsearch table 43.
- the filter used would reference a component of the data stored, which permits the use of an index and results in faster more efficient searches.
- Methods according to the present application can be used in various other applications.
- One application is the security area where directories are increasingly being used by Certification authorities to store standardized certificates.
- An example of such a certificate is an X.509 certificate. Certificates such as the X.509 can be referred to as 'complex' attributes because they contain many components.
- the present application should not be limited to only these types of certificates. It will be understood that the present application can be utilized with any form of information having components.
- consideration should be given as to how the certificate is stored so that retrieval of a certificate is quick and reliable (i.e., the desired certificate is actually retrieved).
- the methods and database arrangements of the present application achieve this by finding and managing one or more of the components of the data in the certificate, e.g., serial number, expiration date and issuer.
- Figure 4 illustrates the application of the present application to X.509 certificates.
- the certificate 20 is illustrated schematically, and for the purposes of illustration only shows information, such as the issuer at field 21 , validity information at field 22, serial number at field 23, version number at field 24, and subject information (e.g., rick harvey) at field 25.
- the search table 3 is arranged in one row with spaces (preferably two) separating the normalized value of each component or field of the certificate 20.
- the search table also includes a normalized value representing the entire certificate.
- the subsearch table 4 is arranged with one or more rows (26, 27, 28, 29 and 30) where one row corresponds to one component or field in certificate 20.
- subsearch table 4 does not have to include every field identified in certificate 20.
- a simple certificate consists of information similar to what a credit card holds, e.g., a serial number, an expiration date, and the cardholders name.
- This simple certificate has three components or fields, namely a number field, a date field and a string field.
- the normalized value of certificate 20 that would be stored in the search table 3 is as follows:
- subsearch table 4 may store, for example, three rows - one for each component of the certificate. Each row of the subsearch table would be in the form of Figure 1 b: (xx, yy, zz, 0, 0, "123456")
- xx, yy and zz are integers corresponding to fields in the particular table design, such as EID, AID and VID.
- a search for a certificate that was issued to "RICK HARVEY" that utilized the search table 3 may use the following SQL statement:
- search table 3 for such a search may be slow because each component of the string for each entry would have to be examined and the degree of certainty that the string being searched and retrieved is the desired entry. This is because the flattened representation has no boundaries as it is an unstructured text representation.
- search table 3A is a search table arranged to include a check sum or finger print.
- the search table 3A is used for exact matching on some attribute types e.g. binary, the value in the search table may be a fingerprint or checksum value.
- the present application can also be utilized for non-complex data types, such as string data types.
- string data types include multi-word sentences, multi-line paragraphs of text, and a multi-line postal addresses.
- an attribute value that is a simple sentence may be stored in a single row in the search table as:
- the present application also has general applicability to the problem of being able to add one or more indices to a given attribute for the purpose of increasing performance for certain types of queries. Adding indices provides a different path in order to find an attribute, such as for example, reverse indexing. In this case, there may only be one component in the subsearch table. The component in effect represents an alternate form of that attribute value.
- the subsearch table can cope with the problem of "ends in” searches or searching for values where an initial portion of data stored is relatively highly repetitive (such as distinguished names, MAC addresses, telephone numbers, full qualified file names, etc ) by storing a reversed form of the value and thereby giving effect to having a reversed index on the attribute.
- a telephone number 31 is entered into a search table 32, and the telephone number is also entered into a subsearch table 33 in a reverse form.
- this aspect of application is not limited to the reverse form, it may be any other suitable form of data entry suitable for a given situation or search, such as treating the area code of a telephone number as a separate component.
- a search When searching for a telephone extension, which is typically the end portion of a telephone number, a search may be expressed as a string search for "*1234" (the star being a wild card). If only search table 32 were used, then the performance of the search would be slow because indexes are only possible for
- the search table 32 might store a telephone number for a given person as:
- Searching the subsearch table 33 should retrieve the desired record faster than searching the search table 32 because the search is for an initial match (i.e., begins with) for "4321", which is a faster search.
- an alternative index is the storing of a checksum of a binary value, e.g., photograph or audio.
- Still another example of an alternative index is the storing of a fingerprint being a smaller representation of the data, such as a smaller representation of a photograph.
Abstract
Description
Claims
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01924878A EP1287446A1 (en) | 2000-04-07 | 2001-04-06 | Directory searching methods and systems |
AU5149001A AU5149001A (en) | 2000-04-07 | 2001-04-06 | Directory searching methods and systems |
BR0109892-6A BR0109892A (en) | 2000-04-07 | 2001-04-06 | Directory Search Systems and Methods |
CA002405058A CA2405058A1 (en) | 2000-04-07 | 2001-04-06 | Directory searching methods and systems |
IL15213201A IL152132A0 (en) | 2000-04-07 | 2001-04-06 | Directory searching methods and systems |
JP2001575281A JP2004506963A (en) | 2000-04-07 | 2001-04-06 | Directory search and system |
IL152132A IL152132A (en) | 2000-04-07 | 2002-10-06 | Directory searching methods and systems |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AUPQ6785A AUPQ678500A0 (en) | 2000-04-07 | 2000-04-07 | Directory searching apparatus and method(s) |
AUPQ6785 | 2000-04-07 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001077902A2 true WO2001077902A2 (en) | 2001-10-18 |
WO2001077902A3 WO2001077902A3 (en) | 2003-09-12 |
Family
ID=3820880
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2001/011587 WO2001077902A2 (en) | 2000-04-07 | 2001-04-06 | Directory searching method and system |
Country Status (10)
Country | Link |
---|---|
EP (1) | EP1287446A1 (en) |
JP (1) | JP2004506963A (en) |
KR (1) | KR20030045666A (en) |
CN (1) | CN1461446A (en) |
AU (1) | AUPQ678500A0 (en) |
BR (1) | BR0109892A (en) |
CA (1) | CA2405058A1 (en) |
IL (2) | IL152132A0 (en) |
WO (1) | WO2001077902A2 (en) |
ZA (1) | ZA200207743B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101014234B1 (en) * | 2004-03-31 | 2011-02-14 | 엘지전자 주식회사 | Apparatus and method for generating pulsating noise in audio device |
JP4186973B2 (en) * | 2005-09-28 | 2008-11-26 | ブラザー工業株式会社 | Facsimile transmission apparatus, facsimile transmission program, facsimile transmission method, and facsimile transmission system |
CN101447981B (en) * | 2008-04-03 | 2012-11-28 | 中兴通讯股份有限公司 | Client-server interaction method based on LDAP protocol and system thereof |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5291583A (en) * | 1990-12-14 | 1994-03-01 | Racal-Datacom, Inc. | Automatic storage of persistent ASN.1 objects in a relational schema |
WO1996007147A1 (en) * | 1994-09-01 | 1996-03-07 | Datacraft Technologies Pty. Ltd. | X.500 system and methods |
WO1996034350A1 (en) * | 1995-04-24 | 1996-10-31 | Aspect Development, Inc. | Modeling of object-oriented database structures, translation to relational database structures, and dynamic searches thereon |
US5970497A (en) * | 1996-08-09 | 1999-10-19 | Digital Equipment Corporation | Method for indexing duplicate records of information of a database |
US6016497A (en) * | 1997-12-24 | 2000-01-18 | Microsoft Corporation | Methods and system for storing and accessing embedded information in object-relational databases |
-
2000
- 2000-04-07 AU AUPQ6785A patent/AUPQ678500A0/en not_active Abandoned
-
2001
- 2001-04-06 BR BR0109892-6A patent/BR0109892A/en not_active IP Right Cessation
- 2001-04-06 CA CA002405058A patent/CA2405058A1/en not_active Abandoned
- 2001-04-06 WO PCT/US2001/011587 patent/WO2001077902A2/en active IP Right Grant
- 2001-04-06 IL IL15213201A patent/IL152132A0/en active IP Right Grant
- 2001-04-06 CN CN01808811A patent/CN1461446A/en active Pending
- 2001-04-06 JP JP2001575281A patent/JP2004506963A/en active Pending
- 2001-04-06 EP EP01924878A patent/EP1287446A1/en not_active Ceased
- 2001-04-06 KR KR1020027013452A patent/KR20030045666A/en not_active Application Discontinuation
-
2002
- 2002-09-26 ZA ZA200207743A patent/ZA200207743B/en unknown
- 2002-10-06 IL IL152132A patent/IL152132A/en not_active IP Right Cessation
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5291583A (en) * | 1990-12-14 | 1994-03-01 | Racal-Datacom, Inc. | Automatic storage of persistent ASN.1 objects in a relational schema |
WO1996007147A1 (en) * | 1994-09-01 | 1996-03-07 | Datacraft Technologies Pty. Ltd. | X.500 system and methods |
WO1996034350A1 (en) * | 1995-04-24 | 1996-10-31 | Aspect Development, Inc. | Modeling of object-oriented database structures, translation to relational database structures, and dynamic searches thereon |
US5970497A (en) * | 1996-08-09 | 1999-10-19 | Digital Equipment Corporation | Method for indexing duplicate records of information of a database |
US6016497A (en) * | 1997-12-24 | 2000-01-18 | Microsoft Corporation | Methods and system for storing and accessing embedded information in object-relational databases |
Also Published As
Publication number | Publication date |
---|---|
BR0109892A (en) | 2004-07-06 |
ZA200207743B (en) | 2004-07-08 |
CN1461446A (en) | 2003-12-10 |
CA2405058A1 (en) | 2001-10-18 |
JP2004506963A (en) | 2004-03-04 |
WO2001077902A3 (en) | 2003-09-12 |
KR20030045666A (en) | 2003-06-11 |
AUPQ678500A0 (en) | 2000-05-11 |
IL152132A (en) | 2008-06-05 |
IL152132A0 (en) | 2003-05-29 |
EP1287446A1 (en) | 2003-03-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8065338B2 (en) | Directory searching methods and systems | |
Stonebraker et al. | Document processing in a relational database system | |
Lin et al. | The TV-tree: An index structure for high-dimensional data | |
US6192373B1 (en) | Managing directory listings in a relational database | |
US7289986B2 (en) | Method and system for indexing and searching contents of extensible markup language (XML) documents | |
US4933848A (en) | Method for enforcing referential constraints in a database management system | |
Baeza-Yates | Text-Retrieval: Theory and Practice. | |
Lim et al. | An automated approach for retrieving hierarchical data from HTML tables | |
EP0380240A2 (en) | Coded signature indexed databases | |
US20030037037A1 (en) | Method of storing, maintaining and distributing computer intelligible electronic data | |
US20040139046A1 (en) | Data organization in a fast query system | |
CA2451208A1 (en) | Database indexing method and apparatus | |
EP1480132B1 (en) | System and method for identifying and storing changes made to a table | |
US6691103B1 (en) | Method for searching a database, search engine system for searching a database, and method of providing a key table for use by a search engine for a database | |
Jang et al. | An effective mechanism for index update in structured documents | |
US7426506B2 (en) | Parameterized keyword and methods for searching, indexing and storage | |
EP1287446A1 (en) | Directory searching methods and systems | |
AU2001251490B2 (en) | Directory searching methods and system | |
EP1116137B1 (en) | Database, and methods of data storage and retrieval | |
AU2001251490A1 (en) | Directory searching methods and system | |
US6578038B1 (en) | Managing directory listings in a relational database | |
Krátký et al. | The geometric framework for exact and similarity querying XML data | |
Soergel | Data models for an integrated thesaurus database | |
White et al. | A brief introduction to data storage and retrieval in MERLIN (MachinE Readable Library INformation) | |
Li et al. | XKMis: Effective and efficient keyword search in XML databases |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2002/07743 Country of ref document: ZA Ref document number: 200207743 Country of ref document: ZA |
|
WWE | Wipo information: entry into national phase |
Ref document number: IN/PCT/2002/01351/MU Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001924878 Country of ref document: EP Ref document number: 2405058 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 152132 Country of ref document: IL |
|
ENP | Entry into the national phase |
Ref document number: 2001 575281 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001251490 Country of ref document: AU Ref document number: 1020027013452 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 018088112 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 2001924878 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020027013452 Country of ref document: KR |
|
WWG | Wipo information: grant in national office |
Ref document number: 2001251490 Country of ref document: AU |