|Publication number||US7146356 B2|
|Application number||US 10/394,842|
|Publication date||Dec 5, 2006|
|Filing date||Mar 21, 2003|
|Priority date||Mar 21, 2003|
|Also published as||CN1761962A, CN1761962B, US20040186826, WO2004084092A1|
|Publication number||10394842, 394842, US 7146356 B2, US 7146356B2, US-B2-7146356, US7146356 B2, US7146356B2|
|Inventors||Arthur Choi, Todd L. Leyba, Beate Porst, Amit Radheshyam Somani|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (24), Non-Patent Citations (3), Referenced by (49), Classifications (15), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
Our invention relates to methods of searching (i.e., querying) unstructured data stored in a database, including converting an SQL query into a proper query for unstructured data. A further aspect of our invention is translating an external SQL access of the type identified with structured relational databases into an internal access to unstructured databases or files, and translation of the SQL external query format into an intermediate or internal query format. The method, system, and program product of our invention is especially applicable to text searching and indexing,
Accessing structured data with SQL is quite different from the full text search of unstructured data such as documents on the web. Structured data in the relational model is maintained in two-dimensional tables as rows and columns. Each row in a table represents an instance of an object while each column represents the attributes of the object. A column is given a symbolic name and is assigned a specific data type (such as integer, date, etc.). Integrity constraints can be applied to columns to further indicate valid values.
Because column values are named and represented in a consistent format, you can select rows very precisely, based on their contents. This capability is especially helpful in dealing with numeric data. You can join together data from different tables based on matching column values. You can do useful types of analysis, such as listing objects in one table that are missing from a related table (or that are present in a related table, or that have specific attributes). You can extract specific rows of interest from a large table, regroup them, and generate simple statistics on them.
By contrast, unstructured data is not always organized in a consistent and predictable manner. Unstructured data is stored in a variety of shapes and forms, distributed throughout the enterprise, and managed by the most appropriate software for the task at hand. The data tends to be recorded in free text form (for example, text contained in e-mails, notes, and documents) with little or no metadata codified into fields. As a consequence, searching is less parametric and more keyword-based in nature. Search results derive more from what “matches” a given set of keywords than from computational criteria.
Yet it is desirable to query unstructured data in a structured way to add still more value to the results set. It would be advantageous to treat the web as a relational database, one that could be queried using standard SQL. Just as importantly, it would also be advantageous to be able to treat a plurality of heterogeneous and unstructured data sources uniformly through an SQL interface, thus removing the ambiguity of their integration.
A conventional approach to solving these problems would be to extract the desired data from the unstructured data sources, apply any necessary conversions to the data and then place the so-converted data into a relational database for later processing. Indeed this warehousing approach is a common method used today for a variety of applications.
However, this approach does not address the overarching issue of making unstructured data available for parametric querying.
We address these problems by a method, system, and program product for parametric searching unstructured data. The unstructured data, as text data or image data, is searched by first searching the unstructured data through an Extended Search broker. The extended search broker has intermediary components between a search requestor and a search agent for unstructured data searching. The search agent returns the search results to the broker for aggregation. The broker aggregates the search results and returns them to the wrapper. The wrapper then takes attributes from the aggregated search result and makes them available as one or more columns in a nickname table. This nickname table is searchable by a relational database using a structured query language (SQL).
One aspect of our invention is a method of searching unstructured data. The method comprises searching the unstructured data through an extended search broker. The extended search broker has intermediary components between a search requester and a search agent for unstructured data searching. The search agent returns the search results from the search agent to the broker for aggregating the search results to a wrapper. Next, the result attributes are entered into a nickname table, where the nickname table is searchable by a relational database using a structured query language.
A further aspect of our invention is a computer system having an unstructured data search system, and a structured data search engine, logically or virtually joined by a nickname table. The computer system is adapted to initiate a search of unstructured data initiated with the structured data search engine. The unstructured data search system includes an extended search broker and a search agent for unstructured data searching. The unstructured data search system receives search results from the search agent and sends the search results and search results attributes to the extended search broker for aggregation into a wrapper. The computer system is adapted to enter the wrapper attributes into the nickname table. The structured data search engine is adapted to conduct searches of search results attributes in the nickname table.
A still further aspect of our invention is a computer program product comprising computer readable code to program and configure a computer system to search unstructured data through an unstructured data search system that includes an extended search broker and a search agent for unstructured data searching. The program product further includes code capable of causing search results and search result attributes from the search agent to be returned to the broker for aggregation, and to aggregate the search results and search result attributes in a wrapper. The code then enters the search result attributes in a nickname table, that is, as one or columns in a nickname table, where the nickname table is searchable by a relational database using a structured query language to search unstructured data.
According to our invention unstructured data may be searched through the combination of a federated relational database engine and an extended search engine, exemplified by the IBM DB2 Federated Database and the IBM Lotus Extended Search, respectively. Together the combination of a federated relational database engine and an extended search engine provide a relational interface to unstructured data that is distributed throughout the enterprise.
RDBMS federation provides an extensible architecture by which both internal and external developers can write wrappers to integrate external data sources. A federated RDBMS wrapper is the module that encapsulates (or wraps) the necessary native API calls to retrieve data from the foreign server. The wrapper is activated through callbacks at various points in the SQL processing cycle when data in its associated nickname table is referenced for processing the query over the remote data sources.
A nickname table is a special kind of RDBMS table used specifically for federation. It does not contain persistent data but rather is populated with data by the wrapper on demand. In this context the nickname table is a virtual table—not really existing in the physical sense but still supporting most if not all table operations that can be expressed in an SQL expression.
An extended search engine, such as IBM Lotus Extended Search, is a product that “extends” the standard capabilities of other search products by allowing a user to search and retrieve all types of information, not just data that is managed by the hosting software. An extended search engine is based on a brokered search technology that provides for efficient, parallel searching of thousands of data sources distributed throughout the enterprise. Extended search engine agents perform remote searches in the native grammars of the backend database systems. The agents return results to the broker for aggregation and delivery to the original caller—in this case the extended search engine wrapper.
By integrating these two technologies as described herein, several benefits are realized. First, unstructured data from a diverse set of data source types is made available in real time to the RDBMS engine through loading, including just-in-time loading, of the extended search engine nickname tables. By this expedient, data is now current and up-to-date. While other federated wrappers provide current data for a single source, only the extended search engine wrapper enables this capability for multiple data sources at a time. In this way the data received by the extended search engine wrapper is presented as a single normalized data set even though multiple sources were involved in its formation.
A second benefit is that the data remains distributed throughout the enterprise logically or virtually closest to where the work is performed. The extended search engine, and not the relational database engine, is responsible for the searching of thousands of data sources stored in different locations. The extended search wrapper used in conjunction with the extended search broker acts as a gateway to this vast amount of unstructured information.
A third benefit is the ability to apply relational concepts against the aggregate of unstructured information. With an extended search engine alone it is not possible to relate results received from one source with results received from other discrete sources in order to derive a subordinate results set. For example it is not possible to join together data from different sources based on matching field values. Extended search engines only perform aggregation (analogous to a UNION query in SQL) on the returned data to produce a single result set. But, once the data is made available to the nickname table through the extended search engine wrapper, the data is free to be joined by the RDBMS engine with any other table in the database, including other nickname tables.
This capability has profound implications. By configuring a nickname table for each of the different types of data that can be retrieved by an extended search engine using concepts of our invention, it is now possible to use the power of the relational engine to easily integrate that data outside of its hosting environment.
Certain embodiments and exemplifications of the invention are illustrated in the FIGURES appended hereto.
Our invention facilitates searching unstructured data through a relational database management system using a structured query language. The invention comprises searching unstructured data using a structured query language and a relational data base management system through an extended search broker. The extended search broker has intermediary components between a search requester and a search agent for unstructured data searching. The search agent returns its search results to the extended search broker for aggregating the search results in a wrapper having structured query language searchable attributes. The wrapper attributes are entered into a nickname table, where the nickname table is searchable by a relational database using a structured query language.
A further aspect of our invention is a computer system having at least two search engines, one an unstructured data search engine, and the other a structured data search engine. The search engines are logically, that is, virtually, joined by a nickname table. The computer system is adapted to conduct searches of unstructured data through the synergistic interaction through a nickname table of the structured data search engine and the unstructured data search engine.
A still further aspect of our invention is a computer program product comprising computer readable code to program and configure a computer system to search unstructured data from a relational database management system for structured data through an unstructured data search system including an extended search broker that has intermediary components between a search requester and a search agent for unstructured data searching. The program product further includes code capable of causing search results from the search agent to be returned to the broker for aggregation, and to aggregate the search results and search result attributes in a wrapper. The code then enters the result attributes in a nickname table, where the nickname table is searchable by a relational database using a structured query language to search unstructured data.
According to our invention unstructured data is searched through the combination and interaction of a federated relational database engine and an extended search engine, exemplified, respectively, by the IBM DB2 Federated Database and the IBM Lotus Extended Search. Together the combination of a federated relational database engine and an extended search engine provide a relational interface to unstructured data that may be distributed throughout the enterprise.
RDBMS federation provides an extensible architecture by which both internal and external developers can write wrappers to integrate external data sources. A federated RDBMS wrapper is the module that encapsulates (that is, wraps) the necessary native API calls to retrieve data from the foreign server. The wrapper is activated through callbacks at strategic points in the SQL processing cycle when data in its associated nickname table is referenced.
A nickname table is a special kind of RDBMS table used specifically for database federation. It does not contain persistent data but rather is populated with data by the wrapper on demand. In this context the nickname table is a virtual table—not really existing in the physical sense but still supporting most if not all table operations that can be expressed in an SQL expression.
An extended search engine, such as IBM Lotus Extended Search, is a product that “extends” the standard capabilities of other search products by allowing a user to search and retrieve all types of information, not just data that is managed by the hosting software. An extended search engine is based on a brokered search technology that provides for efficient, parallel searching of thousands of data sources distributed throughout the enterprise. Extended search engine agents perform remote searches in the native gram mars of the backend database systems. The agents return results to the broker for aggregation and delivery to the original caller—in this case the extended search engine wrapper.
Certain embodiments and exemplifications of the invention are illustrated in the FIGURES appended hereto.
Result attributes are assigned to the wrapper, 313, and the results attributes are entered into a nickname table that is searchable by a structured data search engine, 315. The results attributes are entered into a nickname table as a column therein. The structured data search engine then queries the nickname search table, 317, and returns the query results to the requester.
By integrating federated database and extended search technologies as described herein, several benefits are realized. First, unstructured data from a diverse set of data source types is made available in real time to the RDBMS engine through loading, including just-in-time loading, of the extended search engine nickname tables. Data presented to the structured database search engine (the relational database management system) is now current and up-to-date. While other federated wrappers provide current data for a single source, only the extended search engine wrapper enables this capability for multiple data sources at a time. In this way the data received by the extended search engine wrapper is presented as a single normalized data set even though multiple sources were involved in its formation.
A second benefit is that the data remains distributed throughout the enterprise logically closest to where the work is performed. The extended search engine, and not the relational database engine, is responsible for the searching of thousands of data sources stored in different locations. The extended search wrapper used in conjunction with the extended search broker acts as a gateway to this vast amount of unstructured information.
A third benefit is the ability to apply relational concepts against the aggregate of unstructured information. With an extended search engine alone it is not possible to relate results received from one source with other discrete sources in order to derive a subordinate results set. For example it is not possible to join together data from different sources based on matching field values. Extended search engines only perform aggregation on the returned data to produce a single result set. But, once the data is made available to the nickname table through the extended search engine wrapper, the data is free to be joined by the RDBMS engine with any other table in the database, including other nickname tables.
This capability has profound implications. By configuring a nickname table for each of the different types of data that can be retrieved by extended search engines using concepts of our invention, it is now possible to use the power of the relational engine to easily integrate that data outside of its hosting software.
By way of example, suppose an intelligence agency is trying to identify individuals who might be potential terrorists. Given that this agency has access to a diverse set of sensitive sources, they may want to pose the following question: “List the names of those persons who have obtained a visa within a certain time frame, have purchased large quantities of fertilizer since those dates, have corresponded through e-mail with other individuals about bomb fabrication, and have applied for a class B (truck) drivers license.”
The sources that need to be searched are many and have varying degrees of structure. Each source, however, has the notion of a person (identified by name) that can be used to perform the join. An extended search system would be used to perform the brokered searches to the remote data sources and return the appropriate data but would then rely on the relational engine to perform the join. In order to do the join, the data needs to be organized into separate nickname tables—one for each type of data source being searched.
The example above requires four nickname tables. One nickname table would be configured to represent e-mail results, another nickname table would represent drivers license information, another would represent fertilizer purchases, and another visa applications. Each nickname table is associated with one or more extended search sources that are similar in purpose. For example, queries applied to the drivers license nickname table would, in reality, cause an extended search of fifty Motor Vehicle Administration data sources (one for each state).
It is assumed that each nickname table would contain a foreign key for the person's name on which the join could be performed. Extended search field mapping would be used to normalize the foreign keys in the nickname tables with the syntactical differences encountered in the backend sources (more on this later). Given that the four nickname tables are configured in this fashion it would now be possible to pose the following query in SQL:
Sep. 05, 2001
Jul. 21, 2001
Sep. 10, 2001
Sep. 05, 2001
Jul. 21, 2001
Sep. 10, 2001
Sep. 05, 2001
Text of email
Sep. 05, 2001
Text of email
Sep. 05, 2001
Text of email
Sep. 05, 2001
Sep. 05, 2001
INS as N1,
DRIVER as N2,
EMAIL as N3,
FERTILIZER as N4
ES_SEARCH(N1.DOC_RANK, ‘DATE_OF_ISSUE >=
“01/01/2000”’) = 1 AND
ES_SEARCH(N2.DOC_RANK, ‘LICENSETYPE = “B”’) = 1
ES_SEARCH(N3.DOC_RANK, ‘DOCUMENT TOKEN “bomb” and
DOCUMENT TOKEN “fabrication”’) = 1
ES_SEARCH(N4.DOC_RANK, ‘ProductType = “FERTILIZER” and
Quantity > 500 and
Date > “01/01/2000”’) = 1
N1.LastName = N2.LastName AND
N2.LastName = N3.LastName AND
N3.LastName = N4.LastName
As previously mentioned Extended Search has the ability to map a common field name to one or more semantically equivalent but syntactically different fields on the backend. This can be very useful in producing a meaningful data model from the nickname tables.
For example, the symbolic identifier for person name in the fifty drivers license databases would most certainly be different—especially since the states are free to build their own MVA databases. Through Extended Search a single field for licensee name could be defined and mapped to the appropriate native fields in the drivers license databases. The single mapped field for licensee name would then be used in the drivers license nickname table. Without this mapping feature, you would be forced to define a nickname column for each uniquely defined name field in the backend database. The table would grow horizontally with many columns and would not be in 3rd normal form. The table would be sparsely populated since any one row would have only one name column filled in at a time.
There are applications however that can make use of a large number of fields coming from many discrete data sources. For these applications the relationships among the data (particularly unstructured data) are not known ahead of time thus making it very difficult to define and structure the nickname tables. Extended Search can support this type of application by populating what is referred to as a vertical nickname table.
A vertical nickname table contains four predefined columns. They are: field name, field value, field type, and source name. Rather than using mapped fields as recommended in the previous example, you do the reverse by letting Extended Search return the native field name/value pairs. Meta data such as the type of field (e.g. date, integer, etc . . . ) and the source from where it came is also returned. Now the nickname table is densely populated with many rows of data—one row for each field per data source.
But how might these vertical nickname tables be used in the relational model? Suppose that the same intelligence agency were to ask a series of questions that helped them discover useful relationships among the data regardless of where it came from. They have set up an extended search system to query over a thousand data sources of varying types each with their own data models and sets of fields. Not knowing which fields will be relevant in your search you configure extended search to search and return all of the fields. These fields are returned in the vertical format just described.
Now the intelligence agency can use the relational engine for the discovery and analysis of the data relationships themselves. They might ask for all fields that contain the word “fertilizer” ordering the result by data source name.
A federated database management system, also referred to as a federated database system or federated system is a system where each database server is an autonomous and independent centralized DBMS that has its own local users, local transactions, database administrator, and, therefore, a high degree of local autonomy. In a federated database management system, each individual server can authorize access to specific portions of its database by specifying an “export schema” which specifies portions of its database that can be accessed by specific sets of non-local users, and the specifications that these non-local users have. In a federated database management system, a user is essentially an additional interface to several local database management systems, thereby allowing a global user to access multiple local, autonomous databases.
A federated database management system, such as IBM DB2 Universal Database federated system, supports applications and users submitting SQL statements referencing two or more DBMSs or databases in a single statement. An example is a join between tables in two different DB2 databases. This type of statement is called a distributed request.
A DB2 Universal Database federated system provides support for distributed requests across databases and DBMSs. A user can, for example, perform a UNION operation between a DB2 table and an Oracle view.
A federated database management system, such as an IBM DB2 federated system, provides location transparency for database objects. If information (in tables and views) is moved, references to that information (called nicknames) can be updated without any changes to applications that request the information. A further aspect of a federated database management system is compensation for data sources that do not support all of the particular SQL dialects, artifacts, or certain optimization capabilities of each other. Operations that cannot be performed under such a DBMS (for example, a file system that may not be able to implement a GROUP BY clause) are run under DB2.
A federated system functions in a semi-autonomous manner, that is, IBM DB2 queries containing references to Oracle objects can be submitted while Oracle applications are accessing the same server. A federated system does not monopolize or restrict access (beyond integrity and locking constraints) to other objects on the remote data sources.
In the case of the IBM DB2 Universal Data Base federated system, the system consists of the IBM DB2 UDB instance, a database that will serve as the federated database, and one or more data sources. The federated database contains catalog entries identifying data sources and their characteristics. A data source consists of a DBMS and its data. Applications connect to the federated database just like any other database.
Federated database catalog entries contain information about data source objects: what they are called, what information they contain, and conditions under which they can be used. Because the federated database catalog stores information about objects in many data sources, it is called a global catalog. Object attributes are stored in the catalog. The actual data sources being referenced, modules used to communicate with the data source, and DBMS data objects (such as tables) that will be accessed are outside of the database. In this regard it should be noted that the one exception is a federated database can be a data source for the federated system. Specifically, IBM DB2 supports federation over remote data sources and remote DBMS's.
Federated objects can be created using, for example, the IBM DB2 UDB Control Center, or SQL Data Definition Language (“DDL”) statements. As a general rule, the required federated database objects are wrappers, servers, and nicknames. Wrappers identify the modules (DLL, library, and so on) used to access a particular class or category of data source. Servers, in this context, define data sources. Server data includes the wrapper name, server name, server type, server version, authorization information, and server options. Nicknames are identifiers stored in the federated database that reference specific data source objects (tables, aliases, views). Applications reference nicknames in queries just like they reference tables and views.
After a federated system is set up, the information in data sources can be accessed as though it were in one large database. Users and applications send queries to-one federated database, which then retrieves data from DB2 family and Oracle systems as needed. User and applications specify nicknames in queries; these nicknames provide references to tables and views located in data sources. From an end-user perspective, nicknames are similar to aliases.
Many federated system operate under some restrictions. For example, distributed requests may be limited to read-only operations. In some federated systems utility operations (LOAD, REORG, REORGCHK, IMPORT, RUNSTATS, and so on) cannot be executed against nicknames. However, a requester can use a pass-through facility to submit DDL (Data Definition Language) and DML (Data Manipulation Language) statements directly to database managers using the SQL dialect associated with that data source.
Federated systems tolerate parallel environments. Performance gains are limited by the extent to which a federated database query can be semantically broken down into local object (table, view) references and nickname references. Requests for nickname data are processed sequentially; local objects can be processed in parallel. For example, given the query SELECT*FROM A, B, C, D,
where A and B are local tables, and C and D are nicknames referencing tables at Oracle data sources, one possible plan would join tables A and B with a parallel join. The results are then joined sequentially with nicknames C and D.
An extended search engine “extends” the standard capabilities of other search products by allowing an end user to search and retrieve all types of information, not just data that is managed by the hosting software. For example, using a standard web browser, an end user can easily and quickly locate and review information contained in thousands of data repositories that are spread throughout the organization. These repositories may be of varied content and structure, and they may be geographically dispersed throughout the world.
With a single query, the end user can search internal and external web sites, full text indexes, Microsoft indices, document management systems, e-mail systems, file systems, relational databases, LDAP directories, and the full complement of Lotus databases—simultaneously. An extended search engine can be thought of as a brokered agent working on the user's behalf: it searches each of the data stores in their native form, and returns results in a single aggregated results set.
The extended search engine shields an end user from data source diversity. This is because an end user interacts with a single, generally function-rich, extended search engine interface that transparently distributes the end user's search to potentially thousands of diverse and disparate data stores. Results can be presented in a variety of ways.
With an extended search, an end user experiences more than what the end user might have come to expect from a typical search application. An end user discovers that his or her reach has been extended further into the enterprise, and that he or she can access information not easily attainable before.
Almost all search systems involve the use of an index that catalogs the information to be searched. Without an index, the time to perform the search would be greatly exaggerated—much like trying to find a book in a library without a card catalog. But while most search solutions require an end user to re-index the information into a new index, an extended search engine, such as IBM Lotus Extended Search, leverages an enterprise's current data management investment.
Note that enterprise information usually exists in many shapes and forms, is distributed throughout the enterprise, and is generally managed by the task specific software for the task at hand. An extended search engine, such as IBM Lotus Extended Search, taps into this maze of data sources and modes of data access, and treats the existing collection as one virtual index with a single point of entry.
Regardless of the mode of entry, an extended search engine translates the query into the native search languages of the target data sources and uses the search and retrieval methods that are native to each data source to return results.
One thing to recognize is that backend data sources are not created equal, however, and they can have totally divergent architectures, methods, schema, metadata and capabilities (such as full text indexes vs. relational databases vs. e-mail systems). Extended search tools and engines attempt to minimize these disparities whenever possible and achieve more than the least common denominator effect.
For example, in querying multiple data sources, an extended search engine, such as IBM Lotus Extended Search, might combine two or more operations against one data source to achieve what can be done in a single operation on a different source. This approach enables users to search multiple data sources, of differing types, architectures, structures, capabilities, and formats, in parallel with a single query. By this expedient it is possible to maintain the mechanisms of the native database or search engine and preserve the integrity and currency of the information, while avoiding the duplication of dispersed data into a centralized index (reducing overall storage requirements and eliminating costs and overhead of re-indexing resources. Moreover, the data remains in close (logical and virtual) proximity to the work that is being performed, and the respective data specific and task specific data sources and search engines can perform search operations in parallel, thereby improving search response times.
The extended search engine paradigm also offers greater scalability than multiple data source paradigms built around a centralized index. As the number of documents in a domain grows, so does the time it takes to index the information. It is not uncommon for the indexing of large domains to make the search impractical.
In this situation, the power of an extended search engine complements depth of the index: first, stabilizes the index at its maximum capacity, and then searches the index in conjunction with other data stores. With this approach, an end user have the option of indexing only what needs to be indexed while using the extended search engine to search both indexed and non-indexed sources.
Connecting new sources to the search domain results in little overhead being incurred by the extended search engine, and it is insignificant when compared to the expense of the actual search operations themselves. Because the search is executed on one or more machines that already exist in a network (including an internet or intranet) using existing search operations, the incremental cost of connecting new sources is negligible.
The extended search engine implements a strategy for accessing all of an enterprise's information wherever it happens to be located by using the enterprise's existing data management software. With this strategy comes the inherent fact that not all backend data sources are created equal. There are general areas in which most systems vary with respect to search and retrieval. Building on these commonalities, an extended search engine offers a common ground that enables system implementers to work complementarily within these areas of (1) Search language, that is, how the query is expressed; (2) Data model support, that is, how the data is organized, related, and represented, and (3) Application program interface (API) support, that is, how information access is performed.
With respect to the search language, nearly all data management systems employ a grammar or query language of some kind to express the criteria of a search. These grammars can vary widely depending on the structure and composition of the data. For example, in a free text system such as the web, for example, the search is generally expressed as a list of keywords. Additional notations are used to express boolean conditions (and, or, not) or positional information, such as specific words that must occur within the same sentence or paragraph. By way of comparison and contrast, if the data is highly codified and structured, the grammar may be more parametric and may support fielded operations (for example, the value of the Quantity field is greater than 100).
Clearly, it is impractical for a user to know the syntax of the entire set of search grammars used in an extended search. It is much more practical to let the user express the query in a single common search language. In IBM Lotus Extended Search the common language is the Generalized Query Language (GQL). It may be treated as a superset of search grammars from which most queries can be expressed.
All IBM Lotus Extended Search queries are expressed internally in GQL format (with the exception of “pass through” queries which will be discussed shortly). When the GQL expression arrives at a specific data source, Extended Search transforms it into the native query language of that source. This translation process maps the lexical elements of GQL to equivalent elements of the native grammar.
While the fullness of the GQL grammar is supported by all components of IBM Lotus Extended Search, not all backend search engines are capable of supporting all elements of the GQL grammar. When an extended search engine, such as IBM Lotus Extended Search, encounters these disparities, it tries to compensate by combining two or more native operations to achieve the same effect. Only after the extended search engine has exhausted all alternative methods will it ignore the non-supported portion of the expression. Under these circumstances, an end user can instead pass through a query that does not get translated.
Common Data Model
Just as search grammars can vary with each dissimilar backend system, so can the data models used to organize and store information. The data model used by a particular data management system is typically designed for the class of applications it serves. This determines the amount of structure and granularity found in its information.
For example, free text systems tend to use a loosely structured document model with low data granularity. A document may consist of a few fields (such as title, author, and body) but its text remains free in form and unstructured. By comparison, information can be highly structured, such as that found in relational databases. Here, data is organized into rows and columns that can be related in any number of ways, which results in high data granularity.
A modern extended search engine, such as IBM Lotus Extended Search, normalizes this diverse set of data models into a single model, one that is easy to understand and usable by most search applications. The search application designer need only contend with this one conceptual model of the data and not be confounded by the many.
Typically a source maps to a database in the conventional sense but can just as easily be mapped to a web site, a directory in a file system, or a node in an LDAP hierarchy. Likewise, a document maps conveniently to those systems that are text based but could just as easily represent an instance of data, such as a row in the table of a relational database.
A common problem encountered when relating data sources of different types is the mismatch in field labels. For example, an author's name might be labeled AUTH_NAME in one data source and CREATOR in another, and yet be represented as three fields (such first name, middle initial, and last name) in another.
An important feature of the common data model is the ability to define mapped fields. A mapped field is a composite of one or more native fields. To resolve the ambiguity in the previous example, an end user could define a single mapped field with the label AUTHOR. An end user could then map this field to one or more native fields in each of the data sources that support the semantic of author's name.
The benefits of this feature are compelling when used in the search expression. A user needs only to specify the mapped field in the query. IBM Lotus Extended Search will automatically associate the mapped field to the correct native fields on the backend. This approach greatly simplifies the query expression, and provides greater benefit as the number of data sources increases.
To illustrate this feature, consider the case of an application that is to display a barometer that is calibrated to reflect the age of a document (that is, more recent documents would have a higher barometer reading). If the “date created” field were labeled differently in each of the backend sources then the application would need an exhaustive set of conditional statements, one for each discrete date field name. But, with mapped fields, only one mapped “date created” field needs to be identified for retrieval and subsequently tested. By referencing this single mapped field, the result would contain the correct date value as it correlates to the source's native date value.
On the other hand, if the result came from an e-mail system, an end user might want to return the date, subject, and author. These semantically different data fields can be selectively retrieved using their native source field identifiers. When the native field label is too cryptic for display purposes (for example, $Doc_Abstract), then a mapped field could again be used as an alias for the native field name (for example, Document Abstract).
A further aspect of an extended search engine is the provision for common API's. The common API's answer the question of “How do I interact with all of these different backend systems to search and retrieve their managed information ?” The API to each backend system can vary dramatically by calling methodology, syntax, semantics, and programming language. The functions issued through an extended search engine common interface are translated automatically by the system into the native methods of the backend system—much like the process of translating GQL into the native search grammar.
Extended search engine seek to interface with each of the different mechanisms on the backend in the best way possible to achieve optimum parity between all data sources while respecting the operating policies of each native search API. By using the published API of the hosting software, the integrity and security of the data source is preserved.
To achieve this communicability, a link module is created for each type of backend data source and is used to encapsulate all of the native API calls required for that type.
An agent-based technology is used to apply these link modules to their respective data sources. Agents work on behalf of a brokered search and are generally transparent (links and agents will be discussed in more detail later on). From a designer's perspective, an end user is interfacing with one searchable backend system through a single API.
In the case of the IBM Lotus Extended Search, the common API is available in two forms. The first and most flexible is a Java bean interface. With this method the beans are combined with the power of the Java programming language to develop a broad range of simple to highly complex and specialized search and retrieval applications. The product demonstrates the use of these beans in a sample web application that uses JavaServer Pages (JSPs).
Alternatively, a set of HTML-like tags that allow an end user to embed extended search engine functionality into new or existing web pages may be used. These easy to use tags empower a web master and enable users to enter queries that specify a variety of search options. An end user can embed extended search engine tags anywhere within a web page—they do not interfere with the surrounding HTML tags.
The search results from an extended search application can be presented in a variety of ways. As part of configuring the system, the system can be programmed and configured to determine which fields a user is allowed to query, view on the results page, and retrieve from the data source. The user is presented with a single, consolidated page containing results from multiple sources. The list is pre-pruned for relevancy, thus ensuring that the user sees the best matches first.
Extended search systems are characterized by scalability. Specifically, the distributed component architecture of an extended search system, such as IBM Lotus Extended Search, offers the flexibility to scale a system according to changing requirements. It also allows the extended search engine components to be arranged in a topology that matches the environment, enabling an end user to blend IBM AIX, Sun Solaris, Windows 2000, and Windows NT platforms as needed.
Exemplary Scalable Extended Search Architectures Include:
Vertically, within a single extended search server, an end user can configure multiple instances of server processes to influence the number of simultaneous requests that the server can process.
Horizontally, with multiple machines, an end user can set up additional extended search servers and additional web servers. For each extended search server, an end user can determine the types of server tasks an end user want to run. By having multiple servers, an end user can distribute and balance the processing load.
Extended Search Architecture
The huge economic growth experienced toward the end of the Twentieth Century has been attributed to the advances made in information technology and to those companies that invested in it. Because the technology was (and still is) changing at break neck speeds, companies frequently invested and then reinvested their Information Technology (“IT”) budgets into ever evolving products to manage their information.
More often than not, the result has been islands of information distributed throughout the organization—highly specialized for the task at hand, but not easily accessible on an enterprise wide basis. Even if a company were able to dictate a common IT policy for the enterprise, it could be thwarted by the single acquisition of a company that employs a different IT architecture.
An extended search engine of the type herein contemplated, and exemplified by IBM Lotus Extended Search, has a multi-tiered design. For example, the IBM Lotus Extended Search system employs a four-tiered architecture. Messages start from search applications in the first tier and proceed consecutively through subsequent tiers to the backend. In most cases, the backend is a third-party data source to which IBM Lotus Extended Search is connected but it can also be the Extended Search configuration database (CDB), a private backend that is managed by a relational database management system, such as IBM DB2 RDBMS.
Message flows between the tiers can be divided into two basic categories:
Run Time messages, which are messages usually issued by the user community to perform searches and retrieve documents.
Administrative messages which are issued by the Administrator and result in updates to the configuration database.
Links are the software modules that encapsulate the native API calls for search and retrieval to a specific data management system. They contain all of the required data structures, programming objects, and procedural logic necessary to interface with the backend data system.
A link module is uniquely assembled to support (at a minimum) callable methods that typically exist in all data management systems:
Methods to connect to and disconnect from the host system
Methods to search content and retrieve data from the system
The link module performs a null operation for those methods that are not supported by the backend source. For example, a file system search does not support the concept of connecting and disconnecting.
Translators are the software modules responsible for translating the incoming GQL expression into the native search grammar of the backend data system. They, too, contain all of the required data structures, programming objects, and parsing logic necessary to generate a syntactically correct search expression.
In some cases, the same translator module applies to several different backend systems, as is the case for the SQL translator and the many varied systems that support the standard SQL grammar.
Agents are programs that respond to search and retrieval operations targeted against a particular data source. The agent loads the appropriate link and translator modules when a request against a specific data source type is first made. The agent then calls upon these module libraries for translation (XLAT), connect, disconnect, search, and retrieval operations.
For search operations, an agent will sort the results set by relevance rank and then truncate the set to the maximum number of hits, as specified in the original search request. This sorting and subsequent pruning of the list of hits is an important precursor to aggregation, which will be discussed shortly.
Agents can reside on the same machine as the data source (recommended) or use a data source's remote APIs for access. More than one copy of an agent can run on a single computer to handle concurrent search and retrieval requests. An agent can be dedicated to a single data source, a group of sources of a particular type, or a range of sources that have a mixture of link requirements.
Brokers are intermediary components that exist between the requesters of service and the agents that actually perform the service through the backend. They function as special purpose resource coordinators designed to manage the multitude of searches generated from a single request—as caused by a category search for example.
A broker typically performs the following tasks:
Validates the request.
Expands categories to obtain a list of the data sources available to the application and resolves the source addresses. (Label 1)
Distributes queries to agents for efficient, parallel searching. (Label 2)
Aggregates and optionally sorts search results that are returned by the various agents into a single search result set. (Label 3)
Caches search results for subsequent paging operations. (Label 4)
Issues requests to agents to retrieve source documents for the user (note that in most cases, the web browser uses the URL returned in the results list to retrieve the document).
Honors timeouts and response options.
The degree of responsiveness can vary dramatically from a large set of backend systems contributing to a single request. Some data management systems respond faster than others, and some not at all—possibly due to out of service conditions. To account for this situation, brokers were designed to communicate asynchronously with their agents.
To support performance and scalability, an extended search system may contain multiple brokers. This ability to establish a hierarchy of brokers, along with the ability to set up agents co-resident with the sources they support or to dedicate agents to particular sources or types of sources, provides an extended search system, such as IBM Lotus Extended Search, with endless flexibility with regard to changing and expanding environments. Under a multiple broker schema, sources get partitioned across all of the brokers, a design that prevents any one broker from being overwhelmed.
In a single broker environment, a search that targets six dozen sources would result in 72 queries being sent to the remote machines and 72 sets of search results being returned to the broker. If each result set contains the maximum number of results, most of the data will be discarded when the broker consolidates and aggregates the data for the list being returned to the requester (the broker prunes the results and keeps only the top items, up to the maximum number allowed by the search application).
With multiple brokers, an entry broker sends a single message to brokers on remote machines. The remote brokers then split the message into multiple requests for the sources (fronted by agents) on their respective machines. Instead of all result sets being returned to one broker, each broker consolidates, aggregates, and prunes the results returned by its agents, and then returns just a single list—containing the top hits—to the entry broker. The entry broker only needs to create a final results set from its own local sources and the consolidated lists returned by the remote brokers.
The broker obtains information about the resources it is to manage from the extended search application's configuration database. This database contains information about data sources and how they should be searched. It also stores network addresses, saved queries, saved search results, and data that was downloaded by a web crawler.
An end user can easily update information about a network topology, data sources, and search applications by using an intuitive Administration interface. This interface also provides the gateway through which an end user can run discovery (discussed below), view error message and event data, schedule queries, and work with saved queries and search results.
While the invention has been described with respect to certain preferred embodiments and exemplifications, it is not intended to limit the scope of the invention thereby, but solely by the claims appended hereto.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5729730||Mar 28, 1995||Mar 17, 1998||Dex Information Systems, Inc.||Method and apparatus for improved information storage and retrieval system|
|US5826258||Oct 2, 1996||Oct 20, 1998||Junglee Corporation||Method and apparatus for structuring the querying and interpretation of semistructured information|
|US5832467||Sep 18, 1996||Nov 3, 1998||U.S. Philips Corporation||Behavior prediction for rule-based data processing apparatus|
|US5893087||Apr 10, 1996||Apr 6, 1999||Dex Information Systems, Inc.||Method and apparatus for improved information storage and retrieval system|
|US5983214||Nov 5, 1998||Nov 9, 1999||Lycos, Inc.||System and method employing individual user content-based data and user collaborative feedback data to evaluate the content of an information entity in a large information communication network|
|US5987449||Aug 12, 1997||Nov 16, 1999||At&T Corporation||Queries on distributed unstructured databases|
|US5995943 *||Jan 23, 1997||Nov 30, 1999||Sabre Inc.||Information aggregation and synthesization system|
|US5999926||Aug 12, 1997||Dec 7, 1999||At&T Corp.||View maintenance for unstructured databases|
|US6052686||Sep 18, 1997||Apr 18, 2000||At&T Corporation||Database processing using schemas|
|US6282537 *||Apr 6, 1999||Aug 28, 2001||Massachusetts Institute Of Technology||Query and retrieving semi-structured data from heterogeneous sources by translating structured queries|
|US6438540 *||Jun 19, 2001||Aug 20, 2002||Vignette Corporation||Automatic query and transformative process|
|US6456737||Aug 17, 2000||Sep 24, 2002||Interval Research Corporation||Data processing system and method|
|US6581062 *||Mar 2, 2000||Jun 17, 2003||Nimble Technology, Inc.||Method and apparatus for storing semi-structured data in a structured manner|
|US6647391 *||Jul 11, 2000||Nov 11, 2003||Ian E. Smith||System, method and article of manufacture for fast mapping from a propertied document management system to a relational database|
|US20020078201||Mar 1, 2001||Jun 20, 2002||Yaniv Gvily||Adding data to text pages by means of an intermediary proxy|
|US20020128998||May 15, 2001||Sep 12, 2002||David Kil||Automatic data explorer that determines relationships among original and derived fields|
|US20020129011||Mar 7, 2001||Sep 12, 2002||Benoit Julien||System for collecting specific information from several sources of unstructured digitized data|
|US20020156817||Feb 21, 2002||Oct 24, 2002||Volantia, Inc.||System and method for extracting information|
|WO1996030845A1||Feb 1, 1996||Oct 3, 1996||Dex Information Systems||Method and apparatus for improved information storage and retrieval system|
|WO1997037314A1||Sep 17, 1996||Oct 9, 1997||The Sabre Group, Inc.||Information aggregation and synthesization system|
|WO1998008170A1||Aug 15, 1997||Feb 26, 1998||At & T Corp.||View maintenance for unstructured databases|
|WO1998008171A1||Aug 15, 1997||Feb 26, 1998||At & T Corp.||Queries on distributed unstructured databases|
|WO2002073468A1||Mar 6, 2002||Sep 19, 2002||Rockwell Scientific Company Llc||Automatic data explorer that determines relationships among original and derived fields|
|WO2002082318A2||Feb 21, 2002||Oct 17, 2002||Volantia Holdings Limited||System and method for extracting information|
|1||Florescu, D et al.; "Database Techniques for the World-Wide-Web: A Survey", ACM Sigmod Record, Online, vol. 23, Sep. 1998, (Sep. 1988), pp. 59-74, XP002292007, ACM Press, New York, NY, USA. Retrieved on Aug. 9, 2004 from: http://delivery.acm.org/10.1145/300000/290605/P059.pdf?key1=290605&key2=7885122901&coll=Portal1&d1=GUIDE&CFID=25625200&CFTOKEN=21019581.|
|2||Guan T et al.; Structure-Based queries over the World Wide Web, Conceptual Modleing-Er. International Conference on Conceptual Modeling, XX, XX, Nov. 16, 1998, pp. 102-120, XP001130882.|
|3||Spertus, E et al.; "Just-In-Time Databases and the World Wide Web", Proceedings of the Seventh International Conference on Information and Knowledge Management, pp. 30-37 XP002292006, Retrieved on Aug. 9, 2004 from http://delivery.acm.org/10.1145/290000/288638/p30-spertus.pdf?key1=288638&key2=4255122901&co11=Portal&d1=GUIDE&FID=25625200&CFTOKEN=21019581.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7516127 *||May 18, 2005||Apr 7, 2009||Computer Associates Think, Inc.||Reporting module definition language system and method|
|US7660814 *||Dec 21, 2005||Feb 9, 2010||Teradata Us, Inc.||Techniques for mapping a physical table to multiple virtual tables|
|US7730061 *||Sep 12, 2008||Jun 1, 2010||International Business Machines Corporation||Fast-approximate TFIDF|
|US7831636 *||Nov 21, 2005||Nov 9, 2010||Ubs Ag||Technique for the migration of a host environment to a new system platform|
|US7899803 *||Feb 19, 2008||Mar 1, 2011||Viewzi, Inc.||Multi-view internet search mashup|
|US7930314 *||Mar 30, 2007||Apr 19, 2011||Verint Americas Inc.||Systems and methods for storing and searching data in a customer center environment|
|US7933916||Feb 28, 2008||Apr 26, 2011||Microsoft Corporation||Querying nonSQL data stores with a SQL-style language|
|US7949654||Mar 31, 2008||May 24, 2011||International Business Machines Corporation||Supporting unified querying over autonomous unstructured and structured databases|
|US7953750 *||Mar 30, 2007||May 31, 2011||Verint Americas, Inc.||Systems and methods for storing and searching data in a customer center environment|
|US8027967 *||Jul 24, 2009||Sep 27, 2011||Fujitsu Limited||Setting checking information collecting method, setting checking information collecting device and recording medium that records setting checking information collecting program|
|US8229938||Apr 3, 2009||Jul 24, 2012||Landmark Graphics Corporation||Systems and methods for correlating meta-data model representations and asset-logic model representations|
|US8438129 *||May 19, 2010||May 7, 2013||Hrl Laboratories, Llc||Probabilistic implementation of system health prognosis|
|US8458159 *||May 5, 2010||Jun 4, 2013||Microsoft Corporation||Automatic role determination for search configuration|
|US8554778||Jun 21, 2012||Oct 8, 2013||Landmark Graphics Corporation||Systems and methods for correlating meta-data model representations and asset-logic model representations|
|US8659389||Dec 17, 2008||Feb 25, 2014||The Jewellery Store||Secure inventory control systems and methods for high-value goods|
|US8661033||Mar 31, 2009||Feb 25, 2014||Innography, Inc.||System to provide search results via a user-configurable table|
|US9064004||Mar 4, 2011||Jun 23, 2015||Microsoft Technology Licensing, Llc||Extensible surface for consuming information extraction services|
|US9081836 *||Jun 28, 2004||Jul 14, 2015||Oracle International Corporation||Method and system for implementing and accessing a virtual table on data from a central server|
|US9152699 *||Oct 31, 2008||Oct 6, 2015||Ebay Inc.||Search based on diversity|
|US9164998 *||Jul 29, 2010||Oct 20, 2015||Sap Se||Archive-system-independent archive-type objects|
|US9201905 *||Jan 14, 2010||Dec 1, 2015||The Boeing Company||Semantically mediated access to knowledge|
|US9291608||Mar 13, 2013||Mar 22, 2016||Aclima Inc.||Calibration method for distributed sensor system|
|US9292575||Nov 19, 2010||Mar 22, 2016||International Business Machines Corporation||Dynamic data aggregation from a plurality of data sources|
|US9297748||Mar 13, 2013||Mar 29, 2016||Aclima Inc.||Distributed sensor system with remote sensor nodes and centralized data processing|
|US9304995||May 24, 2011||Apr 5, 2016||Verint Americas Inc.||Systems and methods for storing and searching data in a customer center environment|
|US20050262074 *||May 18, 2005||Nov 24, 2005||Jesper Starch||Reporting module definition language system and method|
|US20050289174 *||Jun 28, 2004||Dec 29, 2005||Oracle International Corporation||Method and system for implementing and accessing a virtual table on data from a central server|
|US20070011209 *||Nov 21, 2005||Jan 11, 2007||Markus Wietlisbach||Technique for the migration of a host environment to a new system platform|
|US20070088706 *||Jan 27, 2006||Apr 19, 2007||Goff Thomas C||Methods and devices for simultaneously accessing multiple databases|
|US20070143572 *||Dec 21, 2005||Jun 21, 2007||Harold Lee||Techniques for mapping a physical table to multiple virtual tables|
|US20070203893 *||Feb 27, 2006||Aug 30, 2007||Business Objects, S.A.||Apparatus and method for federated querying of unstructured data|
|US20080016085 *||Oct 9, 2007||Jan 17, 2008||Goff Thomas C||Methods and Systems For Simultaneously Accessing Multiple Databses|
|US20080201326 *||Feb 19, 2008||Aug 21, 2008||Brandon Cotter||Multi-view internet search mashup|
|US20090119248 *||Oct 31, 2008||May 7, 2009||Neelakantan Sundaresan||Search based on diversity|
|US20090222404 *||Feb 28, 2008||Sep 3, 2009||Microsoft Corporation||Querying nonsql data stores with a sql-style language|
|US20090248619 *||Mar 31, 2008||Oct 1, 2009||International Business Machines Corporation||Supporting unified querying over autonomous unstructured and structured databases|
|US20090254569 *||Mar 13, 2009||Oct 8, 2009||Landmark Graphics Corporation, A Halliburton Compa||Systems and Methods for Real Time Data Management in a Collaborative Environment|
|US20090287661 *||Jul 24, 2009||Nov 19, 2009||Fujitsu Limited||Setting checking information collecting method, setting checking information collecting device and recording medium that records setting checking information collecting program|
|US20100005111 *||Apr 3, 2009||Jan 7, 2010||Landmark Graphics Corporation, A Halliburton Company||Systems and Methods for Correlating Meta-Data Model Representations and Asset-Logic Model Representations|
|US20100005113 *||Jul 2, 2008||Jan 7, 2010||International Business Machines Corporation||Function in a relational database|
|US20100070495 *||Sep 12, 2008||Mar 18, 2010||International Business Machines Corporation||Fast-approximate tfidf|
|US20100148934 *||Dec 17, 2008||Jun 17, 2010||The Jewellery Store||Secure Inventory Control Systems and Methods for High-Value Goods|
|US20100153351 *||Dec 16, 2008||Jun 17, 2010||Yung Alex P||Techniques for real-time database processing|
|US20100251145 *||Mar 31, 2009||Sep 30, 2010||Innography Inc.||System to provide search results via a user-configurable table|
|US20110106856 *||Mar 13, 2009||May 5, 2011||Landmark Graphics Corporation, A Halliburton Company||Systems and Methods for Real Time Data Management in a Collaborative Environment|
|US20110276583 *||May 5, 2010||Nov 10, 2011||Microsoft Corporation||Automatic role determination for search configuration|
|US20110307477 *||Jun 19, 2011||Dec 15, 2011||Semantifi, Inc.||Method and apparatus for dynamic grouping of unstructured content|
|US20120030180 *||Jul 29, 2010||Feb 2, 2012||Sap Ag||Archive-system-independent archive-type objects|
|WO2007098320A3 *||Feb 8, 2007||Oct 2, 2008||Business Objects Sa||Apparatus and method for federated querying of unstructured data|
|U.S. Classification||707/706, 707/E17.005, 707/954, 707/999.003, 707/811, 707/769, 707/999.102|
|Cooperative Classification||Y10S707/99943, Y10S707/99933, Y10S707/954, G06F17/3043, G06F17/30483|
|European Classification||G06F17/30S4P2N, G06F17/30S4P4P|
|Mar 21, 2003||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHOI, ARTHUR;LEYBA, TODD L.;PORST, BEATE;AND OTHERS;REEL/FRAME:013910/0975;SIGNING DATES FROM 20030307 TO 20030312
|Apr 16, 2010||FPAY||Fee payment|
Year of fee payment: 4
|Jul 18, 2014||REMI||Maintenance fee reminder mailed|
|Sep 26, 2014||SULP||Surcharge for late payment|
Year of fee payment: 7
|Sep 26, 2014||FPAY||Fee payment|
Year of fee payment: 8