Efficient hash based full-outer join

Details Efficient hash based full-outer join Efficient hash based full-outer join

2008-06-23

2010-06-01

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Database and file access

Query optimization

C707S802000

Reexamination Certificate

active

07730055

ABSTRACT:
In a database system, a full outer join is computed using a hash-based join.

REFERENCES:
patent: 5557791 (1996-09-01), Cheng et al.
patent: 6253197 (2001-06-01), Lindsay et al.
patent: 7043494 (2006-05-01), Joshi et al.
patent: 7478080 (2009-01-01), Pirahesh et al.
patent: 2002/0099691 (2002-07-01), Lore et al.
patent: 2004/0172400 (2004-09-01), Zarom et al.
patent: 2004/0199516 (2004-10-01), Thames et al.
patent: 2007/0083491 (2007-04-01), Walmsley et al.
Graefe et al. (“Hash joins and hash teams in Microsoft SQL server”, 1998-1999).
Silberschatz et al. (“Database System Concept”, Chapter 13—“Query Processing”, 2006).
Alexander Chigrik, “SQL Server 7.0: Hash Joins,” Sep. 7, 2000, www.databasejournal.com/features/mssql/article.php/a443301 p. 1-4.
Oracle8iData Warehousing Guide, Release 2 (8.1.6), Part No. A76994-01, “Parallelism and Partitioning,” Dec. 1999, 17 pages.

Affiliated with

Also associated with

Rating

Efficient hash based full-outer join does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient hash based full-outer join, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient hash based full-outer join will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4202646