Dynamic partition enhanced inequality joining using a...

Data processing: database and file management or data structures – Database and file access – Query optimization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S713000, C707S714000

Reexamination Certificate

active

07873629

ABSTRACT:
Methods, computer programs, and database systems for performing a database query to join a column A and a column B on an inequality condition are disclosed. A database includes value-count indexes for columns A and B. Minimum and a maximum values for A and B are determined, using the value-count indexes for A and B, respectively. The method includes defining three or more sets of values in A and B, relative to the minimum and maximum values for B and A, respectively. The method includes generating one or more Cartesian products between values in A and B. The database query is performed on a set of values in A and a set of values in B to generate a partial query result. The method includes merging one or more Cartesian products and the partial query result.

REFERENCES:
patent: 4956774 (1990-09-01), Shibamiya et al.
patent: 5241648 (1993-08-01), Cheng et al.
patent: 5557791 (1996-09-01), Cheng et al.
patent: 5822750 (1998-10-01), Jou et al.
patent: 5903893 (1999-05-01), Kleewein et al.
patent: 5918225 (1999-06-01), White et al.
patent: 5930785 (1999-07-01), Lohman et al.
patent: 5983215 (1999-11-01), Ross et al.
patent: 6052693 (2000-04-01), Smith et al.
patent: 6167399 (2000-12-01), Hoang
patent: 6226639 (2001-05-01), Lindsay et al.
patent: 6505189 (2003-01-01), On Au et al.
patent: 6944633 (2005-09-01), Higa et al.
patent: 2001/0000536 (2001-04-01), Tarin
patent: 2001/0014888 (2001-08-01), Tsuchida et al.
patent: 2003/0074348 (2003-04-01), Sinclair et al.
patent: 2003/0217033 (2003-11-01), Sandler et al.
patent: 2004/0172400 (2004-09-01), Zarom et al.
patent: 2004/0249845 (2004-12-01), Das
patent: 2004/0260684 (2004-12-01), Agrawal et al.
patent: 2005/0149491 (2005-07-01), Bakalash et al.
patent: 2005/0160102 (2005-07-01), Abdo et al.
patent: 2005/0240615 (2005-10-01), Barsness et al.
patent: 2006/0047638 (2006-03-01), Dettinger et al.
“Joining Tables in SQL Queries,” Ron Plew, et al, SAMS Publishing, pp. 1-14, Oct. 25, 2002.
“Non-Final Office Action”,Non-Final Office Action inU.S. Appl. No. 10/862,689 (Dec. 14, 2008).
Gennick, Jonathan et al., “Transact-SQL Cookbook”, http://oreilly.com/catalog/transqlcook/errata/transqlcook.confirmed8/21/2006, (Jul. 15, 2002).
“SQL-J Language Reference”, http://www.novell.com/documentation/extendas37/docs/help/java/jdkee/cloudscape/doc/html/coredocs/sqlj18.htm, 19.
O'Neil, Patrick et al., “Multi-Table Joins Through Bitmapped Join Indices”,SIGMOND Record, vol. 24, No. 3, Sep. 1995, 8-11.
“Oracle9i Database Performance Tuning Guide and Reference”,Release 2(9,2) Oct. 2002 Part No. A96533-02, 9-14 through 9-18.
Chigrik, Alexander “MS SQL, SQL Server 7.0: Merge Joins”, http://www.databasejournal.com/features/mssql/article.php/1459141/SQL-Server-70-Merge-Joins.htm, (Aug. 31, 2000).
Ooi, Bing C., “Subquery”, http://web.archive.org/web/20030409135608/http://www.comp.nus.edu.sg/˜ooibc/courses/sql/dml—query—subquery.htm.
Miner, Eric “New Optimizer and Query Execution Options in Adaptive Server Enterprise 12.0”,Sybase Techwave, (1999).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic partition enhanced inequality joining using a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic partition enhanced inequality joining using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic partition enhanced inequality joining using a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2625458

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.