CN1461446A - Directory searching methods and systems - Google Patents
Directory searching methods and systems Download PDFInfo
- Publication number
- CN1461446A CN1461446A CN01808811A CN01808811A CN1461446A CN 1461446 A CN1461446 A CN 1461446A CN 01808811 A CN01808811 A CN 01808811A CN 01808811 A CN01808811 A CN 01808811A CN 1461446 A CN1461446 A CN 1461446A
- Authority
- CN
- China
- Prior art keywords
- data
- search
- database
- netware
- delegation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Methods for arranging data in relational databases and for searching directory service databases and systems are provided. In particular, but not exclusively, systems and directories which implement or perform X.500 or LDAP services in a relational database are provided. The present application includes a database arrangement that stores data types in a table as components and searches the components for desired data entries.
Description
The intersection contrast of related application
The application is U.S.Serial No.09/427,267 filed October 26,1999 continuation part, the document are U.S.Serial No.08/793,575 filed February 28,1997 (present US Patent 6,052,681) part, the latter is National Stage ofInternational Application No.PCT/AU95/00560 filed August 30,1995, each is whole in conjunction with as a means of contrast at this for these documents.
Background
1. field
The application relates to the directory service field.The present invention be more particularly directed to the application of electronic directory services in the relational database, for example X.500 or LDAP, the list structure of the database layout that is used for searching for, and relate to the method that is used for search database.
2. the explanation of correlation technique
Relational Data Base Management (RDBMS) provides function easily for the application program of storage and management data.The integrality that data are arranged in the numerous characteristics that RDBMS provides, consistance, concurrency, index mechanism, query optimization, restorative, rerun security.RBDMS also provides many instruments to be used for the performance adjustment, changes/produce backup, examination and application development over to.
RDBMS is the gerentocratic optimal selections of many large datas.RDBMS is easy to obtain, and known be reliably, and comprise many useful management tools.The huge basis that has RDBMS to install now, thus existing a large amount of in the intelligence aspect personnel and the program and investment moving these systems, so the data manager just seeks the use to this when the new system of acquisition.Many relational database product supporting industry standard SQL (Structured Query Language (SQL)).
Also have a kind of trend that trends towards the object-oriented system now, these systems provide the data extensibility and have handled the possibility of any complex data item.In addition, many company and government departments have a large amount of not interconnection database application.The data manager is seeking to make them can integrated its data and the solution of reduced data management.Electronic directory provides the instrument of realizing these targets to the data manager.Some electronic directory is standardized.X.500 be the international standard of electronic directory [CCITT89 or ITU93].These standard definitions very flexibly and service, agreement and the information model of general catalogue.X.500 can be used for such infosystem, data quite static (for example phone directory) but may must be (for example trans-departmental or national) that distributes wherein, be extendible (for example, firm name, the address, the work title, device etc.), OO (being that logarithm is executed rule factually) and/or by remote access.Electronic directory such as relevant criterion extremely X.500, provides the framework and the functionality that make the data manager can realize its purpose.
In general, the data manager more wishes to realize having all dirigibilities of object-oriented system but the electronic directory of use SQL product, catalogue X.500 for example, the system that makes can realize scalability, and the intrinsic performance of the relational system stability of SQL product in addition, soundness, portability and cost efficiency.
At U.S.Serial No.09/427,267 and corresponding Australian Patent712451 in the example that electronic directory is realized has been described, these two documents are all whole in conjunction with as a means of contrast at this.In the search strategy of realizing for this conceptual level, used the hierarchy table, NAME for example, DIT and TREE safeguard relation between objects in the hierarchy.The hierarchy table is by the layout of every object delegation.Object table, for example SEARCH and ENTRY, the value in the management object.These Object table are by the layout of every value delegation.Each object has corresponding row in the hierarchy table, and each property value has corresponding row in Object table.In this realization, the Object table that is used for object search comprises form and is (EID, AID, VID, row Norm), the wherein object under the EID ident value, the attribute type of AID ident value, VID identifies one of property value number possible in the clauses and subclauses, and Norm comprises the syntax gauge value.Attribute list, for example attribute has defined the information about attribute type.Employed attribute list comprises the row of form for (AID, SYX, DESC, OBJECT ID).
Have been found that the improvement that can realize, be used for the database of complex data type is carried out layout and search the electronic directory realization.
General introduction
The present invention relates to use the mark of certain form, such as the assembly that is included in the stored data, one of the identifier of stored data and/or processing of stored data are stored and/or are searched for for data type.The search of complicated data type is convenient in this realization, this is by adding the new search and/or the attribute list of the storage information relevant with data item, think to help or useful predetermined information carries out in the particular items of search database, such as comprising the many-value assembly that component identifier (CID) information of representing individual component and/or expression be used to search for or the components values identifier information (CVID) of a plurality of assemblies by not limiting.These new tables are called sub-search list and/or sub-attribute list here, and their effect is the assembly of storing value, and are convenient to the search of individual component and/or many-value assembly.Yet this table is marked with any title.
In one embodiment, the application provides the method for marshal data in database.This method comprises that generating first shows, and this table is suitable for storing data and each data item is had delegation, and generates second table, and this table is suitable for storing data package and each assembly of data type of being stored is had delegation.Data are structured data type or string data preferably.
The application also provides to have and has related to the database and/or the catalogue of storing layout.Below instructions in the whole text in, reference be database, yet this can be used for NetWare directory services NetWare on an equal basis.The data storage layout comprises first table, this table points to the hierarchy that has defined relation between objects, and be configured to every object and have delegation, second table, this table points to the object that has defined one or more values in each object, and is configured to every value and has delegation, and the 3rd table, the one or more selected assembly or the expression of this table sensing value, and be configured to have delegation for each assembly of each value.X.500 or the LDAP service system database is the part of NetWare directory services NetWare preferably, such as.
The application also provides the method for given data item search database.Among this embodiment, database has first table, and be suitable for storing data and have delegation for each data item, and second table, be suitable for storing data package or expression and delegation arranged for stored each data package.This searching method comprises assembly or the expression of determining given data item, to second table carry out be just accord with or one of initial matching so that positioning component or expression, and return the given data item of this assembly of coupling or expression.
This instructions in the whole text in, all assemblies of the mentioning expression of value ' may substitute or comprise in addition ', for example reverse index or pointer or fingerprint or verification and, or certain suitable less expression of big relatively data.
Brief description of drawings
Referring now to description of drawings the preferred embodiments of the present invention, wherein
Fig. 1 a represents according to the principle of the application's exemplary database and conceptual design;
Fig. 1 b represents according to the logic of the application's exemplary database and physical Design, comprises sub-search list and sub-attribute list;
Fig. 2 is the reduced representation according to the application's high-order searching method;
Fig. 3 is the reduced representation according to the application's sub-rank searching method;
Fig. 4 illustrates exemplary X.509 authentication and corresponding search and sub-search list example; And
Fig. 5 illustrates examplar search relevant with the telephone number data assembly and sub-search list.
Describe in detail
Fig. 1 a illustrates the realization of a kind of exemplary database design, and just can use a type of database of the application's method and layout.The more detailed explanation of this database design can be at U.S.Serial No.09/427, finds in 267, and the document is whole in conjunction with as a means of contrast at this.Fig. 1 b illustrates the more detailed realization of Fig. 1 a database design.In general, when search had the catalogue of database, the search argument had defined where search for (base object), and the scope of search (subclass) is applied to the condition (wave filter) of search and should returns what information (selection) from search.Wave filter is by such as AND, the combination of one or more wave filter items (or condition) that OR is connected with NOT.
For general search service, wave filter puts on value and the attribute list in the Object table, for example search list.An example of universal filter is " NORM LIKE ' %RICKHARVEY% ' ".Can add the words and expressions of the component identifier comprise the particular components that data type is described to SQL statement for special search service (following will more detailed description the in detail), and be just accord with or initially (or " beginning ") wave filter with what be applied to the assembly in sub-search list rather than the search list.An example of this words and expressions is " AND CID=n ", and an example that is just accord with wave filter is " NORM=' RICK HARVEY ' ".
Referring to Fig. 1 b, the list structure of logical design 1 and physical Design 2 comprises search list 3, sub-search list 4, attribute list 5, and sub-attribute list 6.Search list 3 and attribute list 5 are similar to U.S.Serial No.09/427, and search and the attribute list described in 267 will no longer describe in detail here.Son table 4 in detail can be configured to comprise the one or more assemblies that are used to improve search speed and reliability.For example, sub-search list 4 can comprise CID field 7 and CVID field 8.The effect of CID field 4 is the instruments as the search data type component, and CVID field 8 is the instruments (or index) that are used as many-value component searches.Though according to the application method can with one or more above-table of sign uses, and each table preferably is provided like this, makes that the inquiry for the special search of spy has a kind of selection.
Information in attribute list 5 descriptions or the reference search table 3, the information in sub-attribute list 6 descriptions or the sub-search list 4 of reference.Sub-attribute list 6 has and attribute list 5 similar fields, but replaces AID field 10 with CID field 9.CID field 9 is used for identifying one or more assemblies in the sub-search list 4.
Referring to Fig. 2 and 3, with the method for explanation search database.The example of search comprises base object and 11, one levels of full tree search other search 12 and subtree search 13.The more detailed description of these search can be at U.S.Serial No.09/427, finds in 267.Have base object or set the search use table 3 of 11 scopes entirely.Have base object or set the search use table 4 that 11 scopes also can be used stored assembly entirely.Search with rank 12 scopes is used between DIT table 14 and the search list 3 also.Have rank 12 scopes and can use the search of stored assembly to use between DIT table 14 and the sub-search list 4 also.Search with subtree 13 scopes is used between tree table 15 and the search list 3 also.Have subtree 13 scopes and use the search of stored assembly to use between tree table 15 and the sub-search list 4 also.
For the example explanation, if required search constitutes with universal filter from argument, then base object and full tree search 11 will use 3, one basic search 12 of search list will use DIT table 14 and search list 3, and subtree search 13 will use tree table 15 and search list 3.An example for the SQL statement of this search can be:
SELECT?EID{other?columns}FROM?SEARCH{other?table}WHERE
{filter}
Yet in this search, some wave filters for example are applied to the high duplication serial data, structured data type serial data or components, the search may be very slow and invalid because database may must scanning big quantity value.
An approach that improves the efficient of this search is to use sub-search list and the search one or more assemblies relevant with stored data.Under this situation, database can make the index that points to the assembly in string or the structure, has avoided the scanning of big quantitative value like this.An example for the SQL of this search will be:
SELECT?EID{other?columns}FROM?SUBSEARCH{other?table}WHERE
{filter}AND?CID＝x
In this realization, base object and full tree search 11 will use other search 12 of 4, one levels of sub-search list will use DIT table 14 and sub-search list 4, and subtree search 13 will use tree table 15 and sub-search list 43.In this example, employed wave filter will be with reference to stored data package, and this allows to make index of reference, consequently faster more effective search.The index that uses in this example comprises CID=x.
Structured attributes
According to the application method can be used in various other application.An application is security fields, constantly increases in these field authentication authorities and uses catalogue with the storage standards certificate.An example of this certificate is a certificate X.509.Preferably be called complexity such as certificate X.509 ' attribute, because they comprise many assemblies.Yet the application should not only limit to the certificate of these types.Should be appreciated that the application can use with any type of information with assembly.
When storage during this certificate, should consider certificate how stored energy make certificate retrieval fast and reliable (be required certificate by actual retrieval to).The application's method and database layout be by finding out and manage one or more assemblies of data in the certificate, sequence number for example, and expired or date of issue has been realized this point.
Fig. 4 illustrates the application to the X.509 application of certificate.For the purpose of removing, the sub-fraction of each table only is shown.Certificate 20 is simplified and illustrates, and only for the purpose of example information only is shown, such as the issuer in field 21, authorization information in field 22, at the sequence number of field 23,, reach subject information (for example rickharvey) in field 25 at the version number of field 24.For this example, search list 3 layouts are in having interval (best two) delegation, and this at interval the field of the standardization value of each assembly or certificate 20 separately.Search list also comprises the standardization value of representing whole certificate.Sub-search list 4 layouts have one or more row (26,27,28,29 and 30), and wherein delegation is corresponding to assembly in the certificate 20 or field.Yet should be noted that sub-search list 4 is not each field that must comprise sign in the certificate 20.
For the realization of this embodiment is described, suppose a simple certificate by be similar to for example sequence number that credit card has, expiration date, and the information of card possessor name form.This simple certificate has three assemblies or field, i.e. number field, date field and string field.In the example of this simplification, the normalized value that will be stored in the certificate 20 in (form among Fig. 1 b) search list 3 is as follows:
(xx，yy，zz，“123456?20000806123000?RICK?HARVEY)”
And sub-search list 4 for example can be stored triplex row-for each assembly delegation of certificate.Each row of sub-search list by the form of Fig. 1 b is:
(xx，yy，zz，0，0，“123456”)
(xx，yy，zz，1，0，“20000806123000”)
(xx，yy，zz，2，0，“RICK?HARVEY”)
Xx wherein, yy and zz are the integers corresponding to the field in the particular table design, such as EID, and AID and VID.
Can use following SQL statement for the certificate that uses search list 3 search to be presented to " RICK HARVEY ":
SELECT...FROM...SEARCH...WHERE?AID＝27?and?NORMLINK
‘％RICK?HARVEY％’
Wherein universal filter is " NORM LINK ' %RICK HARVEY% ' ".Yet it may be slow using search list 3 for this search because must investigate be for each assembly of each clauses and subclauses string and just be the confidence level of required clauses and subclauses at searched and the string of retrieving.This is because dull expression does not have the border because of its non-structured text representation.
When add to adopt one to be just accord with or when initial filter and component identifier,, will be more effective to the search argument for the search of being presented to " RICK HARVEY " certificate if use sub-search list 4.Under this situation, can use following SQL statement:
SELECT...FROM...SUBSEARCH...WHERE?AID＝27?ANDCID＝4
AND?NORM＝‘RICK?HARVEY’
Wherein " ' RICK HARVEY ' " is a wave filter to NORM=, and AID=27 is the attribute-identifier of certificate, and CID=4 is the component identifier of theme.
In above example, because know that from sub-search list 4 or from the design of sub-attribute list 6 index CID=4 is the string of expression card possessor's name, so use the search of identifier (or index) CID=4.Index CID is set to 4, and wave filter should return the certificate of Rick Harvey for the inquiry of " NORM=' RICKHARVEY ' ".This inquiry is considered to preferably, because it can use suitable index, makes that search is more quick and increases the confidence level that search will be found correct certificate or a plurality of certificates.Should be noted that in the design of sub-search list actual designated character/literal or number are arbitrarily, and can design by any way to be fit to specific application.
Come again referring to Fig. 4, with explanation another realization according to the application's method.In this realization, search list 3A is comprised by layout that verification is closed or the search list of fingerprint.Because search list 3A is used to be just accord with some attribute type of coupling, scale-of-two for example, the value in this search list can be fingerprint or the verification value of closing.This makes that the storage in search list is more effective, because need stored data less.
String attribute
The application can also be used for the non-complex data type, such as the string data type.The example of string data type comprises many-words and expressions of text, and is many-the row joint, and many-row postal address.Under this situation, as the property value of simple sentence can be stored in the search list in the single row as:
(1122，33，0，“MANY?WORD?SENTENCE”)
Wherein row (or field) be defined as (EID, AID, VID, NORM).For " WORD ' inquiry of search string data type will be referred to check the row for partial words (part-word) " %WORD% ", this is considered to slow relatively search.In order to improve the search of this data, string in sub-search list 4, makes string " MANY WORD SENTENCE " will be stored in the following triplex row as component stores:
(xx，yy，zz，0，0，“MANY”)
(xx，yy，zz，0，1，“WORD”)
(xx，yy，zz，0，2，“SENTENCE”)
Wherein row be defined as respectively (EID, AID, VID, CID, CVID, NORM).In this example, at this moment the wave filter that is applied will use sub-search list 4 rather than search list 3, and following SQL statement can be used to search " WORD ".
SELECT...FROM?SUBSEARCH...WHERE?AID＝33?AND?CID＝0
AND?NORM＝“WORD”
We search " WORD " be just accord with coupling rather than more than when searching partial words " %WORD% ", its result will be a faster search.
The index that substitutes
For adding one or more index to given attribute so that increase the problem of performance of the inquiry of certain type, but the application also has versatility.The interpolation index provides searches the different approach of attribute, such as reverse index.Under this situation, in sub-search list, may have only an assembly.Effectively assembly is represented an alternative form of this property value.
Especially, sub-search list can be handled " ends in " search or to the problem of the search of value, wherein the initial part of stored data is had high relatively repeatability (such as famous name by storing value by converse form, MAC Address, telephone number, thereby to make attribute have reverse index be effective complete qualified file name etc.).For example referring to Fig. 5, telephone number 31 is imported into search list 32, and telephone number also is input to sub-search list 33 with reverse type.Certainly, this of the application is not limited to reverse type on the one hand, and this can be any other suitable given situation or the form of search of being applicable to of data item, such as the area code of telephone number is handled as separating assembly.
When search generally was the extension of telephone number end portion, search can be expressed as the string search to " 1234 " (asterisk is an asterisk wildcard).If only use search list 32, then search performance is slow, because can only carry out index to " begins with " or " exact " search.Yet, using by the reverse attribute that is stored in the sub-search list 33, sub-search list can be used for carrying out search of equal value, and for example " 4321
*", this is considered to very fast.
More particularly, search list 32 can to given Personal Storage telephone number as:
(1122，44，0，“98791234”)
And in sub-search list 33, to store be:
(1122，44，0，0，0“43219789”)
The SQL statement of searching with " 1234 " end institute telephone number can be such form:
SELECT...FROM?SUBSEARCH...WHERE?AID＝44?and?CID＝0?and
NORM?LIKE‘4321％’
Searching for sub-search list 33 should be than the required record of search search list 32 faster retrievals, because search is carried out for initial matching (being begin with) with regard to " 4321 ", this is to search for faster.
The example of the index that another is alternative is that the verification of storage of binary values is closed, for example photo or audio frequency.
Another example of alternate index is the storage as the fingerprint of less data representation, represents such as less photo.
Though the application is that the application should not be limited in system and method disclosed herein with reference to X.500 NetWare directory services NetWare is disclosed.Whole read this instructions be appreciated that the application applicable to or be implemented or make at some different NetWare directory services NetWares and in all sorts of ways.
Claims (28)
1. the method for a marshal data in database comprises:
Generate first table, this table is suitable for storing data and each data item is had delegation; And
Generate second table, this table is suitable for storing data package and each assembly is had delegation.
2. the method described in claim 1, wherein data are structured data type.
3. the method described in claim 1, wherein data are string data types.
4. the method described in claim 1, wherein data are or represent X.509 certificate.
5. the method described in claim 1, wherein data package is verification and or fingerprint.
6. the method described in claim 1, wherein database is the part of electronic directory services system.
7. the method described in claim 6, wherein X.500 the electronic directory services system comprises and the LDAP service system.
8. database with data storage layout comprises:
Search list, comprising at least one row has a plurality of row; And
Sub-search list, comprising at least one row has a plurality of row, comprises the component identifier row.
9. database as claimed in claim 8, wherein the form of the row of search list is " EID, AID, VID, Norm ", the object under the EID ident value wherein, the attribute type of AID ident value, one of property value that may number in clauses and subclauses of VID sign.
10. database as claimed in claim 8, wherein the form of the row of search list is " EID, AID, VID; CID, Norm ", wherein the object under the EID ident value, the attribute type of AID ident value, one of property value of possibility number in clauses and subclauses of VID sign, and CID identified component identifier.
11. database as claimed in claim 8 also comprises sub-attribute list, this table comprises at least one row and has a plurality of row, and the description and the reference of antithetical phrase search list wherein are provided.
12. database as claimed in claim 11, the form of the row of its neutron attribute list are " CID, SYN, DESC, OBJECT ID, FLAGS ".
13. the database with data storage layout comprises:
First table, this table points to the hierarchy that has defined relation between objects, and be configured to every object and have delegation, second table, this table points to the object that has defined one or more values in each object, and is configured to every value and has delegation, and the 3rd table, the one or more selected assembly of this table sensing value, and be configured to have delegation for each assembly of each value.
14. a NetWare directory services NetWare is used for carrying out the directory service request on database, comprising:
First table, for being used to store data, this first table has delegation to each data item by layout; And
Second table, for being used to store data package, this second table has delegation to each assembly of data by layout.
15. NetWare directory services NetWare as claimed in claim 14, wherein data are structured data type.
16. NetWare directory services NetWare as claimed in claim 14, wherein data are string data types.
X.500 or the ldap directory service system 17. NetWare directory services NetWare as claimed in claim 14 is.
18. the NetWare directory services NetWare with data storage layout comprises:
First table, this table points to the hierarchy that has defined relation between objects, and be configured to every object and have delegation, second table, this table points to the object that has defined one or more values in each object, and is configured to every value and has delegation, and the 3rd table, the one or more selected assembly of this table sensing value, and be configured to have delegation for each assembly of each value.
19. NetWare directory services NetWare as claimed in claim 18, wherein data are structured data type.
20. NetWare directory services NetWare as claimed in claim 18, wherein data are string data types.
X.500 or the ldap directory service system 21. NetWare directory services NetWare as claimed in claim 18 is.
22. for a kind of method of given data item search database, database has first table, and be suitable for storing data and delegation arranged for each data item, and second table, being suitable for storing data package and delegation being arranged for each data package, this method comprises:
Determine the assembly of given data item;
To second table carry out be just accord with or one of initial matching so that locate this assembly; And
Return the given data item of mating this assembly that is positioned.
23. the method described in claim 22, wherein database is the part of electronic directory services system.
24. the method described in claim 22, wherein X.500 the electronic directory services system comprises and the LDAP service system.
25. the method described in claim 22, wherein data are or represent X.509 certificate, and/or the verification of data and and/or the fingerprint of data.
26. the method described in claim 23, wherein assembly is the verification and or the fingerprint of data.
27. the method described in claim 23, wherein use search list search for location fingerprint or verification and.
28. the method described in claim 27 is wherein also searched for verification and or fingerprint assembly.
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 (1)
| Publication Number | Publication Date |
|---|---|
| CN1461446A true CN1461446A (en) | 2003-12-10 |
Family
ID=3820880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN01808811A Pending CN1461446A (en) | 2000-04-07 | 2001-04-06 | Directory searching methods and systems |
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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100442291C (en) * | 2005-09-28 | 2008-12-10 | 兄弟工业株式会社 | System, device and method for a data transmission |
| CN101447981B (en) * | 2008-04-03 | 2012-11-28 | 中兴通讯股份有限公司 | Client-server interaction method based on LDAP protocol and system thereof |
Families Citing this family (1)
| 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 |
Family Cites Families (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 |
| JPH10505690A (en) * | 1994-09-01 | 1998-06-02 | データクラフト テクノロジーズ プロプライエタリー リミテッド | X. 500 System and Method |
| EP0823092A1 (en) * | 1995-04-24 | 1998-02-11 | Aspect Development, Inc. | Modeling of object-oriented database structures, translation to relational database structures, and dynamic searches thereon |
| US5745900A (en) * | 1996-08-09 | 1998-04-28 | Digital Equipment Corporation | Method for indexing duplicate database records using a full-record fingerprint |
| 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 IL IL15213201A patent/IL152132A0/en active IP Right Grant
- 2001-04-06 WO PCT/US2001/011587 patent/WO2001077902A2/en active IP Right Grant
- 2001-04-06 CA CA002405058A patent/CA2405058A1/en not_active Abandoned
- 2001-04-06 KR KR1020027013452A patent/KR20030045666A/en not_active Application Discontinuation
- 2001-04-06 CN CN01808811A patent/CN1461446A/en active Pending
- 2001-04-06 BR BR0109892-6A patent/BR0109892A/en not_active IP Right Cessation
- 2001-04-06 JP JP2001575281A patent/JP2004506963A/en active Pending
- 2001-04-06 EP EP01924878A patent/EP1287446A1/en not_active Ceased
-
2002
- 2002-09-26 ZA ZA200207743A patent/ZA200207743B/en unknown
- 2002-10-06 IL IL152132A patent/IL152132A/en not_active IP Right Cessation
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100442291C (en) * | 2005-09-28 | 2008-12-10 | 兄弟工业株式会社 | System, device and method for a data transmission |
| CN101447981B (en) * | 2008-04-03 | 2012-11-28 | 中兴通讯股份有限公司 | Client-server interaction method based on LDAP protocol and system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2001077902A3 (en) | 2003-09-12 |
| CA2405058A1 (en) | 2001-10-18 |
| ZA200207743B (en) | 2004-07-08 |
| AUPQ678500A0 (en) | 2000-05-11 |
| IL152132A (en) | 2008-06-05 |
| EP1287446A1 (en) | 2003-03-05 |
| JP2004506963A (en) | 2004-03-04 |
| IL152132A0 (en) | 2003-05-29 |
| WO2001077902A2 (en) | 2001-10-18 |
| BR0109892A (en) | 2004-07-06 |
| KR20030045666A (en) | 2003-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6801904B2 (en) | System for keyword based searching over relational databases | |
| JP4627777B2 (en) | A structured index on the result of applying the function to the data | |
| US8037059B2 (en) | Implementing aggregation combination using aggregate depth lists and cube aggregation conversion to rollup aggregation for optimizing query processing | |
| KR101086575B1 (en) | Type path indexing | |
| Wang et al. | Efficient processing of XML path queries using the disk-based F&B index | |
| US9171100B2 (en) | MTree an XPath multi-axis structure threaded index | |
| US7631012B2 (en) | System and method of operating a database | |
| US6356892B1 (en) | Efficient implementation of lightweight directory access protocol (LDAP) search queries with structured query language (SQL) | |
| US6625615B2 (en) | Data processing system and method for multi-level directory searches | |
| US20120089612A1 (en) | Flexible fully integrated real-time document indexing | |
| Cheung et al. | Constructing suffix tree for gigabyte sequences with megabyte memory | |
| JP2000163447A (en) | Method for wild card search and computer program product | |
| CN101645092B (en) | Method for mapping an X500 data model onto a relational database | |
| WO2005077123A2 (en) | Efficient indexing of hierarchical relational database records | |
| US8065338B2 (en) | Directory searching methods and systems | |
| US20060224592A1 (en) | Crawling databases for information | |
| Nanopoulos et al. | Indexing web access-logs for pattern queries | |
| US7028037B1 (en) | Operators for accessing hierarchical data in a relational system | |
| Wittenburg et al. | An adaptive document management system for shared multimedia data | |
| CN1791873A (en) | Undrop objects and dependent objects in a database system | |
| CN1461446A (en) | Directory searching methods and systems | |
| Barg et al. | A fast and versatile path index for querying semi-structured data | |
| AU2001251490B2 (en) | Directory searching methods and system | |
| Li et al. | XKMis: Effective and efficient keyword search in XML databases | |
| Wen et al. | The design of efficient XML document model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| C20 | Patent right or utility model deemed to be abandoned or is abandoned |