Structure independent searching in disparate databases

• US 20060074881A1
• Filed: 10/02/2004
• Published: 04/06/2006
• Est. Priority Date: 10/02/2004
• Status: Abandoned Application

• Current Assignee: Adventnet Incorporated
• Original Assignee: Adventnet Incorporated
• Inventors: Srinivasan, Santhana Krishnan, Vembu, Sridhar, Vembu, Radha
• Application Number:
  US10/957,341
• Publication Number:
  US 20060074881A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: G06F 16/25 Integrating or interfacing systems involving database management systems
• CPC Class Codes: G06F 16/901 Indexing; Data structures therefor; Storage structures for retrieval from the web G06F16/951

Abstract

This invention allows keyword searches in both structured and unstructured databases, and across multiple databases of different vendors. An index database is created comprising word occurrences and table relationship information. In the case of unstructured databases with no predetermined schema, the relationship between different tables is derived through propagative n-level indexing and data is then populated in index tables. A database adapter enables indexing and searching across multi-vendor databases, which resolves discrepancies across different database access methodologies. Given a set of keyword inputs, the rows containing the search words and all the related rows are searched using word occurrences and relationship information.

Claims

1. A method of conducting keyword searches in databases, comprising the steps of:

creating an index database of word occurrences information and relationship information by extracting said word occurrences information and relationship information through an existing schema from structured databases and through propagative n-level indexing of unstructured databases for which no predetermined schema is available;

providing a database adapter for enabling indexing and searching across multi-vendor structured and unstructured databases and supporting database specific operations of new database systems, removing structured query language inconsistencies, removing java database connectivity driver related inconsistencies and removing database vendor specific inconsistencies;

determining the occurrences information of said keywords and determining the relationship information for the keywords from said index database;

forming a query with joins for fetching the rows of the database containing the keywords using the word occurrences information and relationship information, wherein said rows are of multiple tables that are related by keys, or are of a single table; and

retrieving the results from the database and prioritizing the results based on the importance of the tables using table ranks.

2. The method of claim 1 wherein the step of extracting word occurrences information comprises the steps of:

extracting the database name, table name and column name in which a word occurs; and

determining the count of occurrence of the word in a given column.

3. The method of claim 1 wherein the step of extracting the relationship information through an existing schema from structured databases is performed by deriving metadata application programming interface of java database connectivity of the structured databases.

4. The method of claim 1 wherein the step of extracting the relationship information through an existing schema from structured databases comprises the steps of:

extracting primary key information;

extracting unique key information of different tables of the database;

extracting the foreign key information of different tables of the database;

extracting the relationship between keys of different tables using java database connectivity application programmer interface; and

extracting information on table marks for each table, wherein said table marks are calculated by determining the number of other tables that point to said table.

5. The method of claim 1, wherein the step of extracting said word occurrences information and relationship information by propagative n-level indexing of unstructured databases, comprises the steps of:

identifying unique keys of each of the tables in the database by determining all the unique column combinations;

identifying the primary key of each of said tables from a set of said unique keys;

identifying the relationship between the keys of different-tables, further comprising the steps of;

determining like relationship between the primary keys of different tables; and

determining the relationship between the foreign key of a table and the primary key of another table using the word occurrences information, whereby the method of using the word occurrences information precludes the need to search all the columns of all the tables of the unstructured databases.

6. The method of claim 1, wherein the step of searching the databases comprises the steps of:

fetching word occurrences of the keyword;

fetching the relationship information from the index database; and

utilizing the word occurrences information and the relationship information for determining a list of tables and the corresponding columns in the tables that contains the keywords.

7. The method of claim 6, wherein determining a list of tables further comprises the step of selecting or dropping a table, the step of selecting or dropping a table comprising the steps of:

selecting a table, or list of multiple tables when the keywords are present either in a single table or distributed across multiple tables; and

dropping a table even if one of the keyword is not present in the table and its related tables.

8. The method of claim 1, wherein said database is either from a single vendor or from multiple vendors.

9. The method of claim 1, wherein the step of providing a database adapter further comprises:

providing a uniform, database neutral application programmer interface for input to the database adapter; and

deriving an output as a uniform wrapper of a result set independent of the nature of the underlying database used.

10. The method of claim 1, wherein the step of retrieving the results comprises presenting the results in batches after sorting the table ranks, wherein the table rank is calculated using table weights, the count of the occurrence of a word in a given column and whether the column that contains the words is a primary key column, a foreign key column, or a unique key column.