or
Bookmark and Share
Method and apparatus for optimizing a merge-join operation across heterogeneous databases
   
Document Number
US Patent 5903893
Issued Date
May 11, 1999
Link
Map
Abstract
An improved join operation is performed between data in at least two tables, with one of the tables stored in a remote database (hereafter "remote table") and another table stored in a local database (hereafter "local table"). The entry values in both the local table and the remote table are accessible in an ordered manner, based upon an order of the entry values. The method of the join operation generally includes the steps of: determining a count of a number of entry values that reside in the local table that are to be joined with entry values in the remote table; comparing the count with a threshold value, and (i) if the count exceeds the threshold value, issuing a query to the remote table to fetch a range of entry values therefrom, the range determined by the range of entry values to be joined from the local table; and (ii) if the count does not exceed the threshold value, issuing a query to the remote table to fetch each specific entry value that matches the entry values to be joined from the local table.
Drawing
Method and apparatus for optimizing a merge-join operation across heterogeneous databases - US Patent 5903893 Drawing
Drawing from US Patent 5903893
Tags:
Description:
Amusing 0%
Clever 0%
Complex 0%
Efficient 0%
Historic 0%
Important 0%
Innovative 0%
Interesting 0%
Practical 0%
Simple 0%
Number of Claims:
14
Comments:
no comments yet
Published
May 11, 1999
Application Number
08/931,404
Filed
September 15, 1997
US Classification
707/10  
Int'l Classification
G06F   17/30   (20060101)  
Examiner
Parent Case
CROSS-REFERENCE TO RELATED PATENT APPLICATIONS This Application is related to the following co-pending patent applications: "HETEROGENEOUS DATABASE SYSTEM WITH DATA SOURCE EXTENSIBILITY", Inventor(s): Kleewein et al., U.S. Ser. No. 08/929,809; "SYSTEM AND METHOD FOR PROVIDING A SINGLE APPLICATION PROGRAM INTERFACE FOR HETEROGENEOUS DATABASES", Inventor(s): Kleewein et al., U.S. Ser. No. 08/931,008; "METHOD AN APPARATUS FOR OPTIMIZING QUERIES ACROSS HETEROGENEOUS DATA BASES", Inventor(s): Kleewein et al., U.S. Ser. No. 08/929,877; "METHOD AND APPARATUS FOR CACHING RESULT SETS FROM QUERIES TO A REMOTE DATABASE IN A HETEROGENEOUS DATABASE SYSTEM", Inventor(s): Kleewein et al., U.S. Ser. No. 08/931,003; "METHOD AND APPARATUS FOR DEFERRING LARGE OBJECT RETRIEVALS FROM A REMOTE DATABASE IN A HETEROGENEOUS DATABASE SYSTEM", Inventor(s): Kleewein et al., U.S. Ser. No. 08/929,642; "HETEROGENEOUS DATABASE SYSTEM WITH DYNAMIC COMMIT PROCEDURE CONTROL", Inventor(s): Kleewein et al., U.S. Ser. No. 08/931,029; and "METHOD AND APPARATUS FOR ACCESSING OF LARGE OBJECT DATA SEGMENTS FROM A REMOTE DATABASE", Inventor(s): Maheshwari et al., U.S. Ser. No. 08/931,002 .
USPTO Field of Search
707/10  
Related Patents
7028048 - Method for dividing a coordinate system into a plurality of intervals based on the distribution of objects represented within the coordinate system - Owned by Jema-Jori AB (Karna,SE)

A method for handling a database containing objects extending into a coordinate system, representing a multidimensional reality. The coordinate system is divisible into a plurality of defined, multidimensional intervals. Each time an object is entered into the database, the method determines the multidimensional intervals into which the object extends. For each of these intervals, the method determines the number of objects extending into the interval and compares the number of objects with a predetermined threshold value. If the threshold value is exceeded, the interval is divided into at least two smaller intervals, in order to limit the number of objects within any interval. Each interval is linked to a set of objects extending into that interval, and each object is linked to a set of intervals into which the object at least partly extends.

7536380 - Dynamic look ahead predicate generation - Owned by International Business Machines Corporation (Armonk, NY)

An apparatus, program product and method that employ a dynamic use of Look Ahead Predicate Generation that will enable the database, database engine, and/or query optimizer to alter the processing of a query, and react to sub-optimal access plan selection and additional factors arising after processing has begun, to heal many poor performing queries. Conventional use of LPG requires the query optimizer to decide whether or not to use LPG before the processing of a query begins. As a result, the query optimizer may not only make sub-optimal decisions, but the query optimizer may not consider additional factors that may arise as the query is processing. However, the dynamic use of LPG allows predicates to be built after processing of the query has started and the ability to alter the query's processing to improve query performance.

6539378 - Method for creating an information closure model - Owned by Amazon.com, Inc. (Seattle, WA)

According to the invention, a method is provided for forming an information closure of a plurality of rows in a listing stack built by a wrapper program for accessing semistructured information. This method includes removing a first row from the listing stack and computing a cross product of the fields in the first row. A step of adding this cross product to a list of accepted rows can also be part of the method. For each remaining row in the listing stack, the method includes a step of computing a selective cross product according to a plurality of steps. In one step, a result is initialized to empty. Then, for each row in the list of accepted rows, a step of determining for a first new row from the accepted row, extended with the non-empty fields of the remaining row is performed. The method can also include a step of determining a second new row from the remaining row, extended with the non-empty fields in the accepted row. Thereupon, a step of adding the two new rows to the result can be performed. Repeating the determining steps and the adding step for all rows in the list of accepted rows, and removing from the result any identical rows can provide an information closure.

7536379 - Performing a multiple table join operating based on generated predicates from materialized results - Owned by International Business Machines Corporation (Armonk, NY)

An improved mechanism for processing a multiple table query includes: determining if any tables in the query require materialization; for each table in the query that requires materialization, deriving at least one join predicate on a join column; determining if any tables earlier in a join sequence for the query has same join predicates; and applying the at least one derived join predicate to an earlier table in the join sequence, if there is at least one table earlier in the join sequence that has the same join predicate. This significantly reduces the number of rows that are joined before arriving at the final result.

6571243 - Method and apparatus for creating extractors, field information objects and inheritance hierarchies in a framework for retrieving semistructured information - Owned by Amazon.com, Inc. (Seattle, WA)

According to the invention, a system and method for extracting information from a semistructured information source. The system includes a listing stack for holding extracted information. A means for matching at least one extractor to the semistructured information to return a list of potential matches is also included. The system can also include a means for iterating through the list of potential matches and a means for retrieving information from a particular match in the list of potential matches. A means for adding a particular match into the listing stack can also be part of the system.

Claims
Description
About| FAQs| Terms & Disclaimer| Link to Us| Contact Us